Title of article :
The diameter of the non-nilpotent graph of a finite group
Author/Authors :
Lucchini, Andrea Dipartimento di Matematica “Tullio Levi-Civita” - Università degli Studi di Padova, Italy , Nemmi, Daniele Dipartimento di Matematica “Tullio Levi-Civita” - Università degli Studi di Padova, Italy
Abstract :
We prove that the graph obtained from the non-nilpotent graph of a finite group by deleting the isolated vertices is connected with diameter at most 3. This bound is the best possible.
Keywords :
Distance , nilpotency , hypercenter
Journal title :
Transactions on Combinatorics
