SearcharxivSearch

arXiv · 2406.00710

Non-Isomorphic Groups with Isomorphic Power and Commuting Graphs

Abstract

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in $G$. The enhanced power graph of a group $G$ is a graph with vertex set $G$ and an edge joining two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. In this paper, we answer a question posed by P. J. Cameron, namely, if there exist groups $G$ and $H$ such that the power graph of $G$ is isomorphic to the commuting graph of $H$. We show that the answer is yes if $G$ is the generalised quaternion group and $H$ is the dihedral group. We also show that the enhanced power graph of the dicyclic group is isomorphic to the commuting graph of the dihedral group.

Explore related subjects

Keep this discovery

BibTeXRIS

Surbhi, Geetha Venkataraman. 2024-06-02. Non-Isomorphic Groups with Isomorphic Power and Commuting Graphs. https://arxiv.org/abs/2406.00710

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR