English

The Power Graph of a Torsion-Free Group Determines the Directed Power Graph

Group Theory 2021-02-09 v3 Combinatorics

Abstract

The directed power graph G(G)\vec{\mathcal G}(\mathbf G) of a group G\mathbf G is the simple digraph with vertex set GG such that xyx\rightarrow y if yy is a power of xx. The power graph of G\mathbf G, denoted with G(G)\mathcal G(\mathbf G), is the underlying simple graph. In this paper, for groups G\mathbf G and H\mathbf H, the following is proved. If G\mathbf G has no quasicyclic subgroup Cp\mathbf C_{p^\infty} which has trivial intersection with every cyclic subgroup K\mathbf K of G\mathbf G such that K≰Cp\mathbf K\not\leq\mathbf C_{p^\infty}, then G(G)G(H)\mathcal G(\mathbf G)\cong \mathcal G(\mathbf H) implies G(G)G(H)\vec{\mathcal G}(\mathbf G)\cong \vec{\mathcal G}(\mathbf H). Consequently, any two torsion-free groups having isomorphic power graphs have isomorphic directed power graphs.

Keywords

Cite

@article{arxiv.2006.01984,
  title  = {The Power Graph of a Torsion-Free Group Determines the Directed Power Graph},
  author = {Samir Zahirović},
  journal= {arXiv preprint arXiv:2006.01984},
  year   = {2021}
}