Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/10816
Title: Graph irregularity and its measures
Authors: Abdo H.
Dimitrov D.
Gutman I.
Journal: Applied Mathematics and Computation
Issue Date: 15-Sep-2019
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.
URI: https://scidar.kg.ac.rs/handle/123456789/10816
Type: article
DOI: 10.1016/j.amc.2019.04.013
ISSN: 00963003
SCOPUS: 85064091209
Appears in Collections:University Library, Kragujevac

Page views(s)

61

Downloads(s)

3

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.