Nonregular graphs with minimal total irregularity

From MaRDI portal




Abstract: The {it total irregularity} of a simple undirected graph G is defined as mirrt(G)= frac12sumu,vinV(G) left|dG(u)dG(v)ight|, where dG(u) denotes the degree of a vertex uinV(G). Obviously, mirrt(G)=0 if and only if G is regular. Here, we characterize the non-regular graphs with minimal total irregularity and thereby resolve the recent conjecture by Zhu, You and Yang~cite{zyy-mtig-2014} about the lower bound on the minimal total irregularity of non-regular connected graphs. We show that the conjectured lower bound of 2n4 is attained only if non-regular connected graphs of even order are considered, while the sharp lower bound of n1 is attained by graphs of odd order. We also characterize the non-regular graphs with the second and the third smallest total irregularity.











This page was built for publication: Nonregular graphs with minimal total irregularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501742)