The Number of Subtrees of Trees with Given Degree Sequence

DOI10.1002/jgt.21674zbMath1269.05022arXiv1209.0275MaRDI 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

majorization; degree sequence; subtree

Mathematics Subject Classification ID

05C05: Trees

05C30: Enumeration in graph theory

05C07: Vertex degrees

Related Items

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

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