Bounds and Computation of Irregularity of a Graph

Hosam Abdo, Nathann Cohen, Darko Dimitrov

Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u\in V$…