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

preprint2021arXivOpen access

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 x→yx\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.