The Number of Subtrees of Trees with Given Degree Sequence

被引:47
作者
Zhang, Xiu-Mei [1 ,2 ]
Zhang, Xiao-Dong [1 ]
Gray, Daniel [3 ]
Wang, Hua [4 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China
[2] Shanghai Sandau Univ, Dept Math, Shanghai 201209, Peoples R China
[3] Univ Florida, Dept Math, Gainesville, FL 32611 USA
[4] Georgia So Univ, Dept Math Sci, Statesboro, GA 30460 USA
基金
中国国家自然科学基金;
关键词
tree; subtree; degree sequence; majorization; WIENER INDEX;
D O I
10.1002/jgt.21674
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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), 985995). 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. (C) 2012 Wiley Periodicals, Inc.
引用
收藏
页码:280 / 295
页数:16
相关论文
共 15 条