The number of subtrees of trees with given degree sequence
From MaRDI portal
Publication:5325940
DOI10.1002/JGT.21674zbMATH Open1269.05022arXiv1209.0275OpenAlexW2171458593MaRDI QIDQ5325940FDOQ5325940
Authors: Xiumei Zhang, Daniel Gray, Hua Wang, Xiao-Dong Zhang 
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Abstract: This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes the recent results of Kirk and Wang. These trees coincide with those which were proven by Wang and independently Zhang et al. to minimize the Wiener index. We also provide a partial ordering of the extremal trees with different degree sequences, some extremal results follow as corollaries.
Full work available at URL: https://arxiv.org/abs/1209.0275
Recommendations
Cites Work
- On subtrees of trees
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Enumeration of subtrees of trees
- The Laplacian spectral radii of trees with degree sequences
- Title not available (Why is that?)
- The extremal values of the Wiener index of a tree with given degree sequence
- Binary trees with the largest number of subtrees
- Maximum Wiener index of trees with given degree sequence
- On \(\alpha \)-greedy expansions of numbers
- Title not available (Why is that?)
- Correlation of Graph‐Theoretical Indices
- The class A(R,S) of (0,1)-matrices
Cited In (37)
- Functions on adjacent vertex degrees of trees with given degree sequence
- On the eccentric subtree number in trees
- Extremal problems for connected set enumeration
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- Extremal trees with respect to dominance order.
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees
- On majorization of closed walk vectors of trees with given degree sequences
- Trees with the same degree sequence and path numbers
- Trees with large numbers of subtrees
- Subtrees of spiro and polyphenyl hexagonal chains
- Extremal trees with fixed degree sequence
- The shape of node reliability
- Some extremal ratios of the distance and subtree problems in binary trees
- On the number of connected subgraphs of graphs
- Eccentricity sums in trees
- Spectral moments of trees with given degree sequence
- Greedy trees, subtrees and antichains
- Unified extremal results of topological indices and spectral invariants of graphs
- The minimal number of subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- On the ordering of distance-based invariants of graphs
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
- Unified extremal results for \(k\)-apex unicyclic graphs (trees)
- The distances between internal vertices and leaves of a tree
- Binary trees with the largest number of subtrees
- The expected subtree number index in random polyphenylene and spiro chains
- Sub-trees of a random tree
- The number of subtrees in graphs with given number of cut edges
- Title not available (Why is that?)
- The number of subtrees of trees with given diameter
- Maximum number of subtrees in cacti and block graphs
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
- Extremal problems for trees with given segment sequence
- On the roots of the subtree polynomial
- Split sizes and extremal tree shapes
- Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
Uses Software
This page was built for publication: The number of subtrees of trees with given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325940)
