The minimal number of subtrees with a given degree sequence

DOI10.1007/s00373-013-1383-zzbMath1306.05031OpenAlexW2092565390MaRDI QIDQ489367

Xiu-Mei Zhang, Xiao Dong Zhang

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-1383-z

zbMATH Keywords

caterpillardegree sequencesubtree

Mathematics Subject Classification ID

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

Related Items (15)

Eccentricity sums in trees ⋮ 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 expected subtree number index in random polyphenylene and spiro chains ⋮ On the roots of the subtree polynomial ⋮ The shape of node reliability ⋮ 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 ⋮ 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 ⋮ On majorization of closed walk vectors of trees with given degree sequences ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• The Wiener maximum quadratic assignment problem
• Extended formulations for the cardinality constrained subtree of a tree problem
• 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
• Trees with the mos subtrees - an algorithmic approach
• On \(\alpha \)-greedy expansions of numbers
• Non-isomorphic caterpillars with identical subtree data
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• 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

This page was built for publication: The minimal number of subtrees with a given degree sequence