Laplacian coefficients of trees with a given bipartition

被引:16
|
作者
Lin, Weiqi [1 ]
Yan, Weigen [1 ]
机构
[1] Jimei Univ, Sch Sci, Xiamen 361021, Peoples R China
关键词
Laplacian coefficient; Bipartition; Perfect matching; HEXAGONAL CHAINS; GRAPHS; ENERGY;
D O I
10.1016/j.laa.2011.01.011
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a graph of order n and mu(G, lambda) = Sigma(n)(k=0)(-1)(k)c(k)lambda(n-k) the Laplacian characteristic polynomial of G. Zhou and Gutman [19] proved that among all trees of order n, the kth coefficient c(k) is largest when the tree is a path and is smallest for a star. In this paper, for two given positive integers p and q (p <= q), we characterize the trees with a given bipartition (p, q) which have the minimal and second minimal Laplacian coefficients. (C) 2011 Published by Elsevier Inc.
引用
收藏
页码:152 / 162
页数:11
相关论文
共 50 条