Graph irregularity and its measures

Hosam Abdo, Darko Dimitrov and Ivan Gutman

Applied Mathematics and Computation, 2019, vol. 357, issue C, 317-324

Abstract: Let G be a simple graph. If all vertices of G have equal degrees, then G is said to be regular. Otherwise, G is irregular. There were various attempts to quantify the irregularity of a graph, of which the Collatz–Sinogowitz index, Bell index, Albertson index, and total irregularity are the best known. We now show that no two of these irregularity measures are mutually consistent, namely that for any two such measures, irrX and irrY there exist pairs of graphs G1, G2, such that irrX(G1) > irrX(G2) but irrY(G1) < irrY(G2). This implies that the concept of graph irregularity is not free of ambiguities.

Keywords: Irregularity (of graph); Irregularity measure; Degree (of vertex) (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319302954
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:357:y:2019:i:c:p:317-324

DOI: 10.1016/j.amc.2019.04.013

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 ().