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

Transactions on Combinatorics

Andrea Lucchini¹  Daniele Nemmi¹ 

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

关键词: ‎‎distance;    nilpotency;    hypercenter;   

DOI  :  10.22108/toc.2020.122329.1719

来源: DOAJ

【 摘 要 】

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‎.

【 授权许可】

Unknown