Largest Number of Subtrees of Trees with a Given Maximum Degree

DOI10.1137/070687736MaRDI QIDQ3394983zbMATH OpenOpenAlexFDO

Authors 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

treemaximum degreeWiener indexsubtree

Mathematics Subject Classification ID

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

Recommendations

• The number of subtrees of trees with given degree sequence
• Binary trees with the largest number of subtrees
• Trees with the mos subtrees - an algorithmic approach
• Further analysis on the total number of subtrees of trees
• On subtrees of trees

Cited in

(38)

• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• On the eccentric subtree number in trees
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• The number of maximum matchings in a tree
• Extremal problems for connected set enumeration
• On \(\sigma\)-span and \(F\)-span of trees and full binary trees
• Subtrees of spiro and polyphenyl hexagonal chains
• Trees with large numbers of subtrees
• Enumeration of subtrees of trees
• Extremal trees with fixed degree sequence
• Some extremal ratios of the distance and subtree problems in binary trees
• On the number of connected subgraphs of graphs
• Greedy trees, subtrees and antichains
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• Further analysis on the total number of subtrees of trees
• The distances between internal vertices and leaves of a tree
• On subtrees of trees
• Binary trees with the largest number of subtrees
• scientific article; zbMATH DE number 1465679 (Why is no real title available?)
• The expected subtree number index in random polyphenylene and spiro chains
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Sub-trees of a random tree
• Enumeration of BC-subtrees of trees
• Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
• On the number of independent subsets in trees with restricted degrees
• The number of subtrees in graphs with given number of cut edges
• The number of subtrees of trees with given degree sequence
• scientific article; zbMATH DE number 5016713 (Why is no real title available?)
• Maximum number of subtrees in cacti and block graphs
• The number of subtrees of trees with given diameter
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• About the largest subtree common to several X-trees
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• Computing the number and average size of connected sets in planar 3-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394983)