Search arXivSearch

arXiv · 2501.14339

On finite groups whose coprime graph is a divisor graph

Abstract

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result in [Power graph of a finite group is always divisor graph, Asian-European Journal of Mathematics 16 (2023)]. We then show that, the coprime graph of a group is a generalized lexicographic product, and characterize which coprime graphs are divisor graphs. Finally, we classify the finite groups $G$ having at most four prime divisors, whose coprime graphs are divisor graphs, and we also classify the finite groups $G$ whose coprime graphs are divisor graphs, if $G$ is a nilpotent group, a dihedral group, a generalized quaternion group, a symmetric group, an alternating group, a direct product of two non-trivial groups, and a sporadic simple group.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuanlong Ma, Liangliang Zhai, Nan Gao, Junyao Pan. 2025-01-24. On finite groups whose coprime graph is a divisor graph. https://arxiv.org/abs/2501.14339

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