Results 11 to 20 of about 49,235 (305)
Degree sums and dense spanning trees. [PDF]
PLoS ONE, 2017 Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to ...
Tao Li +3 more
doaj +2 more sources
Linking and Cutting Spanning Trees [PDF]
Algorithms, 2018 We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees.
Luís M. S. Russo +2 more
doaj +4 more sources
On the Number of Spanning Trees of Graphs [PDF]
The Scientific World Journal, 2014 We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), first Zagreb index (M1), and Randić index (R-1).
Ş. Burcu Bozkurt, Durmuş Bozkurt
doaj +2 more sources
Dynamics of investor spanning trees around dot-com bubble. [PDF]
PLoS ONE, 2018 We identify temporal investor networks for Nokia stock by constructing networks from correlations between investor-specific net-volumes and analyze changes in the networks around dot-com bubble.
Sindhuja Ranganathan +2 more
doaj +2 more sources
On encodings of spanning trees
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hurlbert, Glenn H., Glenn H. Hurlbert
openaire +2 more sources
Discrete Mathematics, 1992 The paper studies spanning trees of a cactus. A cactus is a connected graph in which each block is either an edge or a circuit. A rooted graph is an ordered pair \((G,R)\), where \(G\) is a graph and \(R\) is a set of its vertices which contains exactly one vertex from each connected component of \(G\).
Vestergaard, Preben Dahl, Egawa, Y.
openaire +4 more sources
Spanning Trees of Lattices Embedded on the Klein Bottle [PDF]
The Scientific World Journal, 2014 The problem of enumerating spanning trees in lattices with Klein bottle boundary condition is considered here. The exact closed-form expressions of the numbers of spanning trees for 4.8.8 lattice, hexagonal lattice, and 33·42 lattice on the Klein bottle ...
Fuliang Lu
doaj +2 more sources
Planar bichromatic bottleneck spanning trees
Journal of Computational Geometry, 2021 Given a set $P$ of red and blue points in the plane, a planar bichromatic spanning tree of $P$ is a geometric spanning tree of $P$, such that each edge connects a red and a blue point, and no two edges intersect.
Karim Abu-Affash +3 more
doaj +1 more source
Multicolored isomorphic spanning trees in complete graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors in such a way that the edges can be partitioned into edge disjoint colorful isomorphic spanning trees? A spanning treee is colorful if all n-1 colors occur
Gregory Constantine
doaj +3 more sources
Successive minimum spanning trees [PDF]
Random Structures & Algorithms, 2021 AbstractIn a complete graphwith independent uniform(or exponential) edge weights, letbe the minimum‐weight spanning tree (MST), andthe MST after deleting the edges of all previous trees. We show that each tree's weightconverges in probability to a constant, with, and we conjecture that.
Svante Janson, Gregory B. Sorkin
openaire +4 more sources