%0 Journal Article
%T The diameter of the non-nilpotent graph of a finite group
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Lucchini, Andrea
%A Nemmi, Daniele
%D 2020
%\ 06/01/2020
%V 9
%N 2
%P 111-114
%! The diameter of the non-nilpotent graph of a finite group
%K Distance
%K nilpotency
%K hypercenter
%R 10.22108/toc.2020.122329.1719
%X 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.
%U https://toc.ui.ac.ir/article_24553_dee375fdb4286c5043d4088be2199ae6.pdf