Characterizing graphs with maximal Laplacian Estrada index

被引：9

作者：

Li, Jianping ^{[1
,2
]}

Zhang, Jianbin ^{[1
,3
]}

机构：

[1] S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China

[2] Guangdong Univ Technol, Fac Appl Math, Guangzhou 510090, Guangdong, Peoples R China

[3] Fudan Univ, Sch Comp Sci, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2015年 / 465卷

关键词：

Estrada index; Laplacian eigenvalues; Laplacian Estrada index; Chromatic number; EIGENVALUES; MATRICES;

D O I：

10.1016/j.laa.2014.09.029

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a simple graph on n vertices. The Laplacian Estrada index of G is defined as LEE(G) = Sigma(n)(i=1)e(mu i), where mu(1), mu(2), . . . mu(n), are the Laplacian eigenvalues of G. In this paper, we give some upper bounds for the Laplacian Estrada index of graphs and characterize the connected (n, m)-graphs for n + 1 <= m <= 3n-5/2 and the graphs of given chromatic number having maximum Laplacian Estrada index, respectively. (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：312 / 324

页数：13

共 24 条

[1]

[Anonymous], 1952, Inequalities

[2] THE GRONE-MERRIS CONJECTURE [J].