Allan Bickle

Irregularity and Near Star Graphs

The (Albertson) irregularity of a graph G is irr ( G ) = ∑︁ | d ( u ) − d ( v ) | , where the sum is over all edges of G . In 2005, Hansen and M´elot proved an upper bound on the irregularity of a graph on n vertices and m edges that is attained for all feasible values, and characterized the extremal graphs. We give a...