Some new spectral bounds for graph irregularity

Xiaodan Chen, Yaoping Hou and Fenggen Lin

Applied Mathematics and Computation, 2018, vol. 320, issue C, 331-340

Abstract: The irregularity of a simple graph G=(V,E) is defined as irr(G)=∑uv∈E(G)|dG(u)−dG(v)|,where dG(u) denotes the degree of a vertex u ∈ V(G). This graph invariant, introduced by Albertson in 1997, is a measure of the defect of regularity of a graph. Recently, it also gains interest in Chemical Graph Theory, where it is named the third Zagreb index. In this paper, by means of the Laplacian eigenvalues and the normalized Laplacian eigenvalues of G, we establish some new spectral upper bounds for irr(G). We then compare these new bounds with a known bound by Goldberg, and it turns out that our bounds are better than the Goldberg bound in most cases. We also present two spectral lower bounds on irr(G).

Keywords: Graph irregularity; The third Zagreb index; Spectral bound; Laplacian eigenvalues; Normalized Laplacian eigenvalues (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317306665
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:320:y:2018:i:c:p:331-340

DOI: 10.1016/j.amc.2017.09.038

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().