The number of subtrees of trees with given degree sequence
From MaRDI portal
Publication:5325940
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5016713 (Why is no real title available?)
- scientific article; zbMATH DE number 5627542 (Why is no real title available?)
- Binary trees with the largest number of subtrees
- Correlation of Graph‐Theoretical Indices
- Enumeration of subtrees of trees
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Maximum Wiener index of trees with given degree sequence
- On \(\alpha \)-greedy expansions of numbers
- On subtrees of trees
- The Laplacian spectral radii of trees with degree sequences
- The class A(R,S) of (0,1)-matrices
- The extremal values of the Wiener index of a tree with given degree sequence
Cited in
(37)- Functions on adjacent vertex degrees of trees with given degree sequence
- On the eccentric subtree number in trees
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- Extremal problems for connected set enumeration
- Extremal trees with respect to dominance order.
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees
- Subtrees of spiro and polyphenyl hexagonal chains
- 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
- The shape of node reliability
- Extremal trees with fixed degree sequence
- Some extremal ratios of the distance and subtree problems in binary trees
- Eccentricity sums in trees
- On the number of connected subgraphs of graphs
- Greedy trees, subtrees and antichains
- Spectral moments of trees with given degree sequence
- 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
- Unified extremal results for \(k\)-apex unicyclic graphs (trees)
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
- 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
- scientific article; zbMATH DE number 903055 (Why is no real title available?)
- Maximum number of subtrees in cacti and block graphs
- The number of subtrees of trees with given diameter
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Extremal problems for trees with given segment sequence
- On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
- 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
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)
