Parameterised distance to local irregularity

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

A graph $G$ is \emph{locally irregular} if no two of its adjacent vertices have the same degree. In [Fioravantes et al. Complexity of finding maximum locally irregular induced subg…