Irregularity Measure of Graphs(Article)(Open Access)
- aDepartment of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, P.O. Box 1159, Mashhad, 91775, Iran
- bFaculty of Science, University of Kragujevac, Kragujevac, 34000, Serbia
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. © 2023 Ali Ghalavand et al.
- ISSN: 23144629
- Source Type: Journal
- Original language: English
- DOI: 10.1155/2023/4891183
- Document Type: Article
- Publisher: Hindawi Limited
Tavakoli, M.; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, P.O. Box 1159, Mashhad, Iran;
© Copyright 2023 Elsevier B.V., All rights reserved.
Cited by 2 documents
(2025) Journal of Applied Mathematics and Computing
(2024) Engineering Letters