Infinite groups with isomorphic power graph and commuting graph

Abstract

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is a graph in which two vertices are adjacent if one is some power of the other. In the enhanced power graph, an edge joins two vertices if they generate a cyclic subgroup of $G$. In the commuting graph, two vertices are adjacent if they commute in $G$. We prove a necessary and sufficient condition for any two of these graphs to be equal. This extends existing results for finite groups. In addition, we show that the power graph of the locally quaternion group is isomorphic to the commuting graph of the locally dihedral group. Lastly, we also answer a question posed by P. J. Cameron about the existence of groups $G_1$ and $G_2$ both of whom have power graph not equal to commuting graph but the power graph of $G_1$ and the commuting graph of $G_2$ are isomorphic.

Figures (2)

• Figure 1: A depiction of the commuting graph of $Q_{\infty}$ and the power graph of $Q_{2^{\infty}}$
• Figure 2: Commuting graph of $D_{\infty}$ and power graph of $D_{2^{\infty}}$

Theorems & Definitions (22)

• Theorem 1
• Theorem 2
• Theorem 3
• Theorem 4
• Theorem 5
• Theorem 1
• proof
• Theorem 2
• proof
• Corollary 3