The diameter of the non-nilpotent graph of a finite group

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