The number of subtrees of trees with given degree sequence

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

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

This article 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 generalize the recent results of Kirk and Wang (SIAM J Discrete Math 22 (2008), 985-995). These trees coincide with those which were proven by Wang and independently Zhang et al. (2008) 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.

Original languageEnglish
Pages (from-to)280-295
Number of pages16
JournalJournal of Graph Theory
Volume73
Issue number3
DOIs
StatePublished - Jul 2013

Scopus Subject Areas

  • Geometry and Topology

Keywords

  • degree sequence
  • majorization
  • subtree
  • tree

Fingerprint

Dive into the research topics of 'The number of subtrees of trees with given degree sequence'. Together they form a unique fingerprint.

Cite this