On the generating graph of a simple group

Andrea Lucchini, Attila Maroti, Colva Mary Roney-Dougal

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)
5 Downloads (Pure)

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 GH. We also prove that the generating graph of a symmetric group determines the group.
Original languageEnglish
Pages (from-to)91-103
JournalJournal of the Australian Mathematical Society
Volume103
Issue number1
Early online date26 Sept 2016
DOIs
Publication statusPublished - Aug 2017

Keywords

  • Generating graph
  • Finite group

Fingerprint

Dive into the research topics of 'On the generating graph of a simple group'. Together they form a unique fingerprint.

Cite this