On incidence energy of a graph

被引:93
作者
Gutman, Ivan [1 ]
Kiani, Dariush [2 ,3 ]
Mirzakhah, Maryam [2 ]
Zhou, Bo [4 ]
机构
[1] Univ Kragujevac, Fac Sci, Kragujevac 34000, Serbia
[2] Amirkabir Univ Technol, Fac Math & Comp Sci, Tehran, Iran
[3] Inst Res Fundamental Sci IPM, Sch Math, Tehran, Iran
[4] S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
关键词
Graph spectrum; Incidence energy (of graph); Singular value (of matrix); Incidence matrix; Laplacian matrix (of graph); Signless Laplacian matrix (of graph);
D O I
10.1016/j.laa.2009.04.019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The Laplacian-energy like invariant LEL(G) and the incidence energy IE(G) of a graph are recently proposed quantities. equal, respectively, to the sum of the square roots of the Laplacian eigenvalues, and the sum of the singular values of the incidence matrix of the graph G. However, IE(G) is closely related with the eigenvalues of the Laplacian and signless Laplacian matrices of G. For bipartite graphs, IE = LEL. We now point out some further relations for IE and LEL: IE can be expressed in terms of eigenvalues of the line graph, whereas LEL in terms of singular values of the incidence matrix of a directed graph. Several lower and upper bounds for IE are obtained, including those that pertain to the line graph of G. In addition, Nordhaus-Gaddum-type results for IE are established. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:1223 / 1233
页数:11
相关论文
共 26 条
[1]  
[Anonymous], 2001, Matrix Analysis and Applied Linear Algebra
[2]  
[Anonymous], 2009, Analysis of Complex Networks: From Biology to Linguistics, DOI DOI 10.1002/9783527627981.CH7
[3]  
Biggs N., 1993, ALGEBRAIC GRAPH THEO
[4]  
Cvetkovi DM., 1980, Spectra of Graphs: Theory and Applications
[5]   Signless Laplacians of finite graphs [J].
Cvetkovic, Dragos ;
Rowlinson, Peter ;
Simic, Slobodan K. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 423 (01) :155-171
[6]  
Gutman I, 2004, MATCH-COMMUN MATH CO, P83
[7]  
Gutman I, 2001, ALGEBRAIC COMBINATORICS AND APPLICATIONS, P196
[8]   On graphs whose energy exceeds the number of vertices [J].
Gutman, Ivan .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (11-12) :2670-2677
[9]  
Gutman I, 2009, MATCH-COMMUN MATH CO, V62, P573
[10]   Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees [J].
Hong, Y ;
Zhang, XD .
DISCRETE MATHEMATICS, 2005, 296 (2-3) :187-197