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

نویسندگان
Nemmi, Daniele ID 1
Lucchini, Andrea ID 2

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

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

doi
10.22108/toc.2020.122329.1719
چکیده

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

کلیدواژه‌ها
‎‎Distance, nilpotency, hypercenter