Please use this identifier to cite or link to this item:
|Title:||Graph irregularity and its measures|
|Journal:||Applied Mathematics and Computation|
|Abstract:||© 2019 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, irr X and irr Y there exist pairs of graphs G 1 , G 2 , such that irr X (G 1 ) > irr X (G 2 ) but irr Y (G 1 ) < irr Y (G 2 ). This implies that the concept of graph irregularity is not free of ambiguities.|
|Appears in Collections:||University Library, Kragujevac|
Files in This Item:
|29.86 kB||Adobe PDF|
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.