Results 1 to 10 of about 48,125 (188)
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
Computing Persistent Homology by Spanning Trees and Critical Simplices [PDF]
Research, 2023 Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the dataset, that is,
Dinghua Shi +3 more
doaj +2 more sources
Spanning Trees with Disjoint Dominating and 2-Dominating Sets
Discussiones Mathematicae Graph Theory, 2022 In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.
Miotk Mateusz, Żyliński Paweł
doaj +3 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
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
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
Spanning trees of finite Sierpiński graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that the number of spanning trees in the finite Sierpiński graph of level $n$ is given by $\sqrt[4]{\frac{3}{20}} (\frac{5}{3})^{-n/2} (\sqrt[4]{540})^{3^n}$.
Elmar Teufl, Stephan Wagner
doaj +1 more source
Determining hop-constrained spanning trees with repetitive heuristics
Journal of Telecommunications and Information Technology, 2023 The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges.
Manuela Fernandes +2 more
doaj +1 more source