Largest Number of Subtrees of Trees with a Given Maximum Degree

DOI10.1137/070687736zbMath1180.05030OpenAlexW2039079531MaRDI QIDQ3394983

Russell Kirk, Hua Wang

Publication date: 20 August 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070687736

zbMATH Keywords

treeWiener indexmaximum degreesubtree

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (28)

Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree ⋮ On the eccentric subtree number in trees ⋮ The Number of Subtrees of Trees with Given Degree Sequence ⋮ Maximum number of subtrees in cacti and block graphs ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ Extremal problems for connected set enumeration ⋮ The number of maximum matchings in a tree ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ The number of subtrees of trees with given diameter ⋮ Extremal trees with fixed degree sequence ⋮ The minimal number of subtrees with a given degree sequence ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On the number of connected subgraphs of graphs ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Trees with large numbers of subtrees ⋮ The sum of the distances between the leaves of a tree and the `semi-regular' property ⋮ On the number of independent subsets in trees with restricted degrees ⋮ Sub-trees of a random tree ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ The distances between internal vertices and leaves of a tree ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ Enumeration of BC-subtrees of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs

This page was built for publication: Largest Number of Subtrees of Trees with a Given Maximum Degree