Abstract
The generating graph Γ(H) of a finite group H is the graph defined on the elements of H, with an edge between two vertices if and only if they generate H. We show that if H is a sufficiently large simple group with Γ(G) ≅ Γ(H) for a finite group G, then G ≅ H. We also prove that the generating graph of a symmetric group determines the group.
| Original language | English |
|---|---|
| Pages (from-to) | 91-103 |
| Journal | Journal of the Australian Mathematical Society |
| Volume | 103 |
| Issue number | 1 |
| Early online date | 26 Sept 2016 |
| DOIs | |
| Publication status | Published - Aug 2017 |
Keywords
- Generating graph
- Finite group