Results 31 to 40 of about 42,490 (162)
Lower-Stretch Spanning Trees [PDF]
SIAM Journal on Computing, 2005 We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
Michael Elkin +3 more
openaire +2 more sources
Spanning trees with a bounded number of leaves [PDF]
Opuscula Mathematica, 2017 In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai +3 more
doaj +1 more source
Intersection of random spanning trees in complex networks
Applied Network Science, 2023 In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023)
András London, András Pluhár
doaj +1 more source
Computational Geometry, 2014 Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree of S. In this work, we study the problem of finding a second plane geometric tree T' spanning S, such that is compatible with T and ...
Garcia Olaverri, Alfredo Martin +3 more
openaire +3 more sources
Reconfiguration of non-crossing spanning trees
Journal of Computational GeometryFor a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common endpoint.
Oswin Aichholzer +10 more
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
Spanning k-ended trees of 3-regular connected graphs
Electronic Journal of Graph Theory and Applications, 2017 A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we obtain sufficient conditions for spanning k-trees of 3-
Hamed Ghasemian Zoeram, Daniel Yaqubi
doaj +1 more source
On encodings of spanning trees
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Spanning Trees and Spanners [PDF]
, 2000 We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire +2 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein +2 more
openaire +1 more source