Irregularity Measure of Graphs

Ali Ghalavand, Ivan Gutman, Mostafa Tavakoli and Xuanlong Ma

Journal of Mathematics, 2023, vol. 2023, 1-5

Abstract: A simple graph G is said to be regular if its vertices have the same number of neighbors. Otherwise, G is nonregular. So far, various formulas, such as the Albertson index, total Albertson index, and degree deviation, have been introduced to quantify the irregularity of a graph. In this paper, we present sharp lower bounds for these indices in terms of the order, size, maximum degree, minimum degree, and forgotten and Zagreb indices of the underlying graph. We also prove that if G has the minimum value of degree deviation, among all nonregular n,m-graphs, then ΔG−δG=1.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/4891183.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/4891183.xml (application/xml)

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:hin:jjmath:4891183

DOI: 10.1155/2023/4891183

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().