Given a finite group G, the invariably generating graph of G is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of G, and two classes are adjacent if and only if they invariably generate G. In this paper, we study this object for alternating and symmetric groups. The main result of the paper states that if we remove the isolated vertices from the graph, the resulting graph is connected and has diameter at most 6.
The invariably generating graph of the alternating and symmetric groups
Garzoni, Daniele
2020
Abstract
Given a finite group G, the invariably generating graph of G is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of G, and two classes are adjacent if and only if they invariably generate G. In this paper, we study this object for alternating and symmetric groups. The main result of the paper states that if we remove the isolated vertices from the graph, the resulting graph is connected and has diameter at most 6.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
10.1515_jgth-2019-0187.pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Accesso libero
Dimensione
247.67 kB
Formato
Adobe PDF
|
247.67 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
