The coefficients of Laplacian characteristic polynomials of graphs

被引：5

作者：

Qiu, Wei ^{[1
]}

Yan, Weigen ^{[1
]}

机构：

[1] Jimei Univ, Sch Sci, Xiamen 361021, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2012年 / 436卷 / 07期

关键词：

Laplacian coefficient; Connectivity; Edge-connectivity; Chromatic number; TREES;

D O I：

10.1016/j.laa.2011.12.020

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Li et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math. Lett. 23 (2010) 286-290] obtained some upper bounds for the number of spanning trees of graphs. In this paper, we characterize the connected graph G with the connectivity kappa (resp. edge-connectivity kappa' and chromatic number chi)which has the maximal coefficients of the Laplacian characteristic polynomial. Since the number of spanning trees of a graph G is determined by one of the coefficients of the Laplacian characteristic polynomial of G. we generalize the results by Li et al. (C) 2011 Published by Elsevier Inc.

引用

页码：2474 / 2479

页数：6

共 11 条

[1]

Biggs N., 1993, Algebraic graph theory

[2]

Cai XC, 2008, MATCH-COMMUN MATH CO, V60, P95

[3] Trees with minimal Laplacian coefficients [J].