The minimal number of subtrees of a tree

DOI10.1007/s00373-013-1376-yzbMath1306.05030OpenAlexW2091297225MaRDI QIDQ489363

Andrew V. Sills, Hua Wang

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1376-y

zbMATH Keywords

caterpillardegree sequencesubtrees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (max. 100)

Eccentricity sums in trees ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ On the roots of the subtree polynomial ⋮ The shape of node reliability ⋮ Extremal problems for trees with given segment sequence ⋮ On the number of connected subgraphs of graphs ⋮ The distances between internal vertices and leaves of a tree

Cites Work

• Unnamed Item
• On the maximal Wiener index and related questions
• The Wiener maximum quadratic assignment problem
• The extremal values of the Wiener index of a tree with given degree sequence
• Wiener index versus maximum degree in trees
• On subtrees of trees
• Further analysis on the total number of subtrees of trees
• On \(\alpha \)-greedy expansions of numbers
• The Maximum Wiener Index of Trees with Given Degree Sequences
• The Number of Subtrees of Trees with Given Degree Sequence
• Correlation of Graph‐Theoretical Indices
• Wiener index of trees: Theory and applications

This page was built for publication: The minimal number of subtrees of a tree