Graph irregularity and its measures

dc.contributor.authorAbdo H.
dc.contributor.authorDimitrov D.
dc.contributor.authorGutman, Ivan
dc.date.accessioned2021-04-20T16:44:49Z
dc.date.available2021-04-20T16:44:49Z
dc.date.issued2019
dc.description.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.
dc.identifier.doi10.1016/j.amc.2019.04.013
dc.identifier.issn0096-3003
dc.identifier.scopus2-s2.0-85064091209
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/10816
dc.rightsrestrictedAccess
dc.sourceApplied Mathematics and Computation
dc.titleGraph irregularity and its measures
dc.typearticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
PaperMissing.pdf
Size:
29.86 KB
Format:
Adobe Portable Document Format