The Number of Subtrees of Trees with Given Degree Sequence

DOI10.1002/jgt.21674zbMath1269.05022arXiv1209.0275OpenAlexW2171458593MaRDI QIDQ5325940

Xiu-Mei Zhang, Hua Wang, Daniel Gray, Xiao Dong Zhang

Publication date: 31 July 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.0275

zbMATH Keywords

majorizationdegree sequencesubtree

Mathematics Subject Classification ID

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

Related Items (32)

On the eccentric subtree number in trees ⋮ Eccentricity sums in trees ⋮ Maximum number of subtrees in cacti and block graphs ⋮ Greedy trees, subtrees and antichains ⋮ Functions on adjacent vertex degrees of trees with given degree sequence ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Extremal problems for connected set enumeration ⋮ On the ordering of distance-based invariants of graphs ⋮ 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 of trees with given diameter ⋮ Spectral moments of trees with given degree sequence ⋮ Unified extremal results for \(k\)-apex unicyclic graphs (trees) ⋮ Extremal trees with fixed degree sequence ⋮ The minimal number of subtrees of a tree ⋮ 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 ⋮ Split sizes and extremal tree shapes ⋮ 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 ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Trees with large numbers of subtrees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Unified extremal results of topological indices and spectral invariants of graphs ⋮ Sub-trees of a random tree ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ The distances between internal vertices and leaves of a tree ⋮ On majorization of closed walk vectors of trees with given degree sequences ⋮ Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• The Laplacian spectral radii of trees with degree sequences
• The extremal values of the Wiener index of a tree with given degree sequence
• The class A(R,S) of (0,1)-matrices
• On subtrees of trees
• On \(\alpha \)-greedy expansions of numbers
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Correlation of Graph‐Theoretical Indices

This page was built for publication: The Number of Subtrees of Trees with Given Degree Sequence