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.
The diameter of the non-nilpotent graph of a finite group
Lucchini A.
;
2020
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
TOC_2020 Summer_Vol 9_Issue 2_Pages 111-114.pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Creative commons
Dimensione
200.81 kB
Formato
Adobe PDF
|
200.81 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
