A simple graph G is said to be regular if its vertices have the same number of neighbors. Otherwise, id="M2"> nonregular. So far, various formulas, such as Albertson index, total and degree deviation, been introduced quantify irregularity a graph. In this paper, we present sharp lower bounds for these indices in terms or...