The diameter of the non-nilpotent graph of a finite group
دریافت مدرک
FullText
اندازه فایل:
200.9کیلوبایتنوع فايل (MIME):
PDFنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
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.
کلید واژگان
Distancenilpotency
hypercenter
20D60 Arithmetic and combinatorial problems
شماره نشریه
2تاریخ نشر
2020-06-011399-03-12
ناشر
University of Isfahanسازمان پدید آورنده
Dipartimento di Matematica “Tullio Levi-Civita", Università degli Studi di Padova, ItalyDipartimento di Matematica “Tullio Levi-Civita", Università degli Studi di Padova, Italy
شاپا
2251-86572251-8665
