The Number of Subtrees of Trees with Given Degree Sequence

From MaRDI portal
Publication:5325940

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




Related Items (32)

On the eccentric subtree number in treesEccentricity sums in treesMaximum number of subtrees in cacti and block graphsGreedy trees, subtrees and antichainsFunctions on adjacent vertex degrees of trees with given degree sequenceComputing the expected subtree number of random hexagonal and phenylene chains based on probability matricesExtremal problems for connected set enumerationOn the ordering of distance-based invariants of graphsThe expected subtree number index in random polyphenylene and spiro chainsOn the roots of the subtree polynomialThe shape of node reliabilityThe number of subtrees of trees with given diameterSpectral moments of trees with given degree sequenceUnified extremal results for \(k\)-apex unicyclic graphs (trees)Extremal trees with fixed degree sequenceThe minimal number of subtrees of a treeThe minimal number of subtrees with a given degree sequenceThe number of subtrees in graphs with given number of cut edgesSubtrees of spiro and polyphenyl hexagonal chainsSplit sizes and extremal tree shapesEnumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in treesExtremal problems for trees with given segment sequenceOn the number of connected subgraphs of graphsOn \(\sigma\)-span and \(F\)-span of trees and full binary treesTrees with large numbers of subtreesOn Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtreesUnified extremal results of topological indices and spectral invariants of graphsSub-trees of a random treeSome extremal ratios of the distance and subtree problems in binary treesThe distances between internal vertices and leaves of a treeOn majorization of closed walk vectors of trees with given degree sequencesExtremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity


Uses Software


Cites Work


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