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 ir- regularity 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.

Keywords