A sharp upper bound on the incidence energy of graphs in terms of connectivity

DOI10.1016/j.laa.2012.09.012zbMath1257.05088OpenAlexW1967416454MaRDI QIDQ1931756

Eber Lenes, Oscar Rojo

Publication date: 16 January 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.09.012

zbMATH Keywords

Laplacian matrixvertex connectivitysignless Laplacian matrixincidence energysignless Laplacian eigenvaluesLaplacian-energy like

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items

Extremal graphs for Estrada indices, On incidence energy of graphs, A unified approach to the asymptotic topological indices of various lattices, On line graphs with maximum energy, On the spectrum of an equitable quotient matrix and its application, Asymptotic incidence energy of lattices, Distance matrices on the \textit{H-join} of graphs: a general result and applications

Cites Work

• The Laplacian-energy like of graphs
• The energy of random graphs
• Integral circulant graphs of prime power order with maximal energy
• Laplacian energy of a graph
• On incidence energy of a graph
• Signless Laplacians of finite graphs
• Strongly regular graphs with maximal energy
• Graph Energy
• Eigenvalue bounds for the signless laplacian
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Energy of line graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item