The power graph of a torsion-free group

Peter Jephson Cameron, Horacio Guerra, Simon Jurina

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

The power graph P(G) of a group G is the graph whose vertex set is G, with x and y joined if one is a power of the other; the directed power graph P(G) has the same vertex set, with an arc from x to y if y is a power of x. It is known that, for finite groups, the power graph determines the directed power graph up to isomorphism. However, it is not true that any isomorphism between power graphs induces an isomorphism between directed power graphs. Moreover, for infinite groups the power graph may fail to determine the directed power graph.

In this paper, we consider power graphs of torsion-free groups. Our main results are that, for torsion-free nilpotent groups of class at most 2, and for groups in which every non-identity element lies in a unique maximal cyclic subgroup, the power graph determines the directed power graph up to isomorphism. For specific groups such as ℤ and ℚ, we obtain more precise results. Any isomorphism P(ℤ)→P(G) preserves orientation, so induces an isomorphism between directed power graphs; in the case of ℚ, the orientations are either all preserved or all reversed.

We also obtain results about groups in which every element is contained in a unique maximal cyclic subgroup (this class includes the free and free abelian groups), and about subgroups of the additive group of ℚ and about ℚn.
Original languageEnglish
Pages (from-to)83-98
JournalJournal of Algebraic Combinatorics
Volume49
Issue number1
Early online date28 Feb 2018
DOIs
Publication statusPublished - Feb 2019

Keywords

  • Power graph
  • Directed power graph
  • Torsion-free group

Fingerprint

Dive into the research topics of 'The power graph of a torsion-free group'. Together they form a unique fingerprint.

Cite this