Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.
Shun-ichi MaezawaRyota MatsubaraHaruhide MatsudaPublished in: Graphs Comb. (2019)
Keyphrases
- spanning tree
- undirected graph
- minimum weight
- weighted graph
- edge weights
- minimum spanning tree
- random graphs
- minimum spanning trees
- edge disjoint
- minimum cost
- maximum cardinality
- sufficient conditions
- root node
- planar graphs
- depth first search
- adjacency matrix
- leaf nodes
- shortest path
- graph clustering
- attributed graphs
- graph matching
- labeled graphs
- data objects
- minimum total cost
- upper bound