SearcharxivSearch

arXiv · 2503.14722

On finite nilpotent groups with the same enhanced power graph

Abstract

The enhanced power graph of a group $G$ is the graph $P_e(G)$ whose vertex set is $G$, such that two distinct vertices $x$ and $y$, are adjacent if $\langle x, y\rangle$ is cyclic. In this paper, we analyze the structure of the enhanced power graph of a finite nilpotent group in terms of the enhanced power graphs of its Sylow subgroups. We establish that for two nilpotent groups, their enhanced power graphs are isomorphic if and only if the enhanced power graphs of their Sylow subgroups are isomorphic. Additionally, we identify specific nilpotent groups for which the enhanced power graphs uniquely characterize the group structure, meaning that if $P_e(G)\cong P_e(H)$ then $G \cong H$. Finally, we extend these results to power graphs and cyclic graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Mirzargar, S. Sorgun, M. J. Nadjafi Arani. 2025-03-18. On finite nilpotent groups with the same enhanced power graph. https://arxiv.org/abs/2503.14722

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