Skip to content

Research at St Andrews

Graphs defined on groups

Research output: Contribution to journalArticlepeer-review

Abstract

This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect group structure in some way (so that, in particular, they are invariant under the action of the automorphism group of G). The particular graphs I will chiefly discuss are the power graph, enhanced power graph, deep commuting graph, commuting graph, and non-generating graph.

My main concern is not with properties of these graphs individually, but rather with comparisons between them. The graphs mentioned, together with the null and complete graphs, form a hierarchy (as long as G is non-abelian), in the sense that the edge set of any one is contained in that of the next; interesting questions involve when two graphs in the hierarchy are equal, or what properties the difference between them has. I also consider various properties such as universality and forbidden subgraphs, comparing how these properties play out in the different graphs.

I have also included some results on intersection graphs of subgroups of various types, which are often in a "dual" relation to one of the other graphs considered. Another actor is the Gruenberg-Kegel graph, or prime graph, of a group: this very small graph has a surprising influence over various graphs defined on the group.

Other graphs which have been proposed, such as the nilpotence, solvability,
and Engel graphs, will be touched on rather more briefly. My emphasis is on
finite groups but there is a short section on results for infinite groups. There are briefer discussions of general Aut(G)-invariant graphs, and structures other than groups (such as semigroups and rings).

Proofs, or proof sketches, of known results have been included where possible. Also, many open questions are stated, in the hope of stimulating further investigation.
Close

Details

Original languageEnglish
JournalInternational Journal of Group Theory
VolumeIn Press
Early online date15 Apr 2021
DOIs
Publication statusE-pub ahead of print - 15 Apr 2021

    Research areas

  • Power graph, Commuting graph, Cograph, Generating graph

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. The geometry of diagonal groups

    Bailey, R. A., Cameron, P. J., Praeger, C. E. & Schneider, C., 7 Jul 2021, (E-pub ahead of print) In: Transactions of the American Mathematical Society. Early View

    Research output: Contribution to journalArticlepeer-review

  2. Diagonal groups and arcs over groups

    Bailey, R. A., Cameron, P. J., Kinyon, M. & Praeger, C., 4 Jul 2021, (E-pub ahead of print) In: Designs, Codes and Cryptography. 11 p.

    Research output: Contribution to journalArticlepeer-review

  3. Forbidden subgraphs of power graphs

    Manna, P., Cameron, P. J. & Mehatari, R., 2 Jul 2021, In: Electronic Journal of Combinatorics. 28, 3, 14 p., P3.4.

    Research output: Contribution to journalArticlepeer-review

  4. Groups generated by derangements

    Bailey, R. A., Cameron, P. J., Giudici, M. & Royle, G. F., 15 Apr 2021, In: Journal of Algebra. 572, p. 245-262

    Research output: Contribution to journalArticlepeer-review

  5. Undirecting membership in models of Anti-Foundation

    Adam-Day, B. & Cameron, P. J., Apr 2021, In: Aequationes Mathematicae. 95, 2, p. 393-400 8 p.

    Research output: Contribution to journalArticlepeer-review

Related by journal

  1. All simple groups with order from 1 million to 5 million are efficient

    Robertson, E. F., Campbell, C. M., Havas, G. & Ramsay, C., Mar 2014, In: International Journal of Group Theory. 3, 1, p. 17–30 14 p.

    Research output: Contribution to journalArticlepeer-review

ID: 273687375

Top