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

Document Type: Research Paper

Authors

Dipartimento di Matematica “Tullio Levi-Civita”, Università degli Studi di Padova, Italy

10.22108/toc.2020.122329.1719

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

Main Subjects