We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
CONNECTED COMPONENTS in the INVARIABLY GENERATING GRAPH of A FINITE GROUP
Garzoni D.
2021
Abstract
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
connected-components-in-the-invariably-generating-graph-of-a-finite-group.pdf
accesso aperto
Descrizione: Open access funding provided by Universita` degli Studi di Padova within the CRUI-CARE Agreement
Tipologia:
Published (publisher's version)
Licenza:
Creative commons
Dimensione
286.85 kB
Formato
Adobe PDF
|
286.85 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
