Results 51 to 60 of about 212,144 (329)
Orderly Spanning Trees with Applications
, 2002 We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs.
Ching-Chi Lin +3 more
core +1 more source
Spanning 3-Ended Trees in Almost Claw-Free Graphs
Discrete Dynamics in Nature and Society, 2015 We prove that if G is a k-connected (k≥2) almost claw-free graph of order n and σk+3(G)≥n+2k-2, then G contains a spanning 3-ended tree, where σk(G)=min{∑v∈Sdeg(v):S is an independent set of G with S=k}.
Xiaodong Chen, Meijin Xu, Yanjun Liu
doaj +1 more source
UHD Journal of Science and TechnologyThis paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP). Moreover, practical scenarios are presented to help the reader understand the concepts and implementations of these protocols.
Dana Faiq Abd +3 more
openaire +2 more sources
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
Sensors, 2021 For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source
Counting spanning trees in self-similar networks by evaluating determinants
, 2011 Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network.
Chen, Guanrong +3 more
core +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Meta‐analysis fails to show any correlation between protein abundance and ubiquitination changes
FEBS Open Bio, EarlyView.We analyzed over 50 published proteomics datasets to explore the relationship between protein levels and ubiquitination changes across multiple experimental conditions and biological systems. Although ubiquitination is often associated with protein degradation, our analysis shows that changes in ubiquitination do not globally correlate with changes in ...
Nerea Osinalde +3 more
wiley +1 more source
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
IEEE Access, 2021 A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang +5 more
doaj +1 more source
Minimum spanning trees on random networks
, 2001 We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform disorder.
A. A. Middleton +24 more
core +1 more source
Spanning trees in random series-parallel graphs [PDF]
, 2015 By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \varrho^{-n} (1+o(1))$, where $s$ and ...
Ehrenmüller, Julia, Rué, Juanjo
core +3 more sources