A sharp upper bound on the incidence energy of graphs in terms of connectivity
type: Item
instance of: scholarly article
title: A sharp upper bound on the incidence energy of graphs in terms of connectivity
zbMATH Open document ID: 1257.05088
author: Oscar Rojo
author: Eber Lenes
published in: Linear Algebra and its Applications
publication date: 2013-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6125880
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: Laplacian-energy like
zbMATH Keywords: signless Laplacian matrix
zbMATH Keywords: signless Laplacian eigenvalues
zbMATH Keywords: incidence energy
zbMATH Keywords: vertex connectivity
MaRDI profile type: Publication
full work available at URL: j.laa.2012.09.012
OpenAlex ID: W1967416454
cites work: Q4903450
cites work: Signless Laplacians of finite graphs
cites work: Towards a spectral theory of graphs based on the signless Laplacian, I
cites work: Eigenvalue bounds for the signless laplacian
cites work: The energy of random graphs
cites work: Q2724749
cites work: Laplacian energy of a graph
cites work: Energy of line graphs
cites work: On incidence energy of a graph
cites work: Q3655109
cites work: Strongly regular graphs with maximal energy
cites work: Seidel switching and graph energy
cites work: Q5572939
cites work: Q3655108
cites work: Graph Energy
cites work: Q5452549
cites work: Q4903432
cites work: Integral circulant graphs of prime power order with maximal energy
cites work: A new method of comparing the energies of subdivision bipartite graphs
cites work: The Laplacian-energy like of graphs
DOI: 10.1016/J.LAA.2012.09.012
description: scientific article; zbMATH DE number 6125880