The number of subtrees of trees with given diameter

DOI10.1142/S1793830918500015zbMath1380.05026MaRDI QIDQ4603866

Zichong Chen

Publication date: 23 February 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

treediameternumber of subtrees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Related Items (2)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ On the number of connected subgraphs of graphs

Cites Work

• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• The extremal values of the Wiener index of a tree with given degree sequence
• The average order of a subtree of a tree
• On subtrees of trees
• Further analysis on the total number of subtrees of trees
• Enumeration of BC-subtrees of trees
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On the Local and Global Means of Subtree Orders
• The Number of Subtrees of Trees with Given Degree Sequence
• Correlation of Graph‐Theoretical Indices

This page was built for publication: The number of subtrees of trees with given diameter