Results 51 to 60 of about 42,490 (162)
Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +1 more source
An Edge-Swap Heuristic for Finding Dense Spanning Trees
Theory and Applications of Graphs, 2016 Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures.
Mustafa Ozen +3 more
doaj +1 more source
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
Packing of rigid spanning subgraphs and spanning trees
Journal of Combinatorial Theory, Series B, 2014 We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6 ...
Cheriyan, Joseph +2 more
openaire +4 more sources
Spanning Trees in Dense Graphs [PDF]
Combinatorics, Probability and Computing, 2001 In this paper we prove the following almost optimal theorem. For any δ > 0, there exist constants c and n0 such that, if n [ges ] n0, T is a tree of order n and maximum degree at most cn/log n, and G is a graph of order n and minimum degree at least (1/2 + δ)n, then T is a subgraph of G.
János Komlós +2 more
openaire +2 more sources
Spanning Trees at the Connectivity Threshold
SIAM Journal on Discrete Mathematics, 2022 We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
Yahav Alon +2 more
openaire +3 more sources
Spanning trees homeomorphic to a small tree
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akira Saito, Kazuki Sano
openaire +1 more source
Computing Well-Balanced Spanning Trees of Unweighted Networks
AlgorithmsA spanning tree of a network or graph is a subgraph that connects all nodes with the minimum number or total weight of edges. Spanning trees are among the simplest yet most effective techniques for network simplification, sampling, and uncovering a ...
Lovro Šubelj
doaj +1 more source
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
Discrete Mathematics, 1992 The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree
openaire +2 more sources