SearcharxivSearch

arXiv · 1707.01127

The enhanced quotient graph of the quotient of a finite group

Abstract

For a finite group $G$ with a normal subgroup $H$, the enhanced quotient graph of $G/H$, denoted by $\mathcal{G}_{H}(G),$ is the graph with vertex set $V=(G\backslash H)\cup \{e\}$ and two vertices $x$ and $y$ are edge connected if $xH = yH$ or $xH,yH\in \langle zH\rangle$ for some $z\in G$. In this article, we characterize the enhanced quotient graph of $G/H$. The graph $\mathcal{G}_{H}(G)$ is complete if and only if $G/H$ is cyclic, and $\mathcal{G}_{H}(G)$ is Eulerian if and only if $|G/H|$ is odd. We show some relation between the graph $\mathcal{G}_{H}(G)$ and the enhanced power graph $\mathcal{G}(G/H)$ that was introduced by Sudip Bera and A.K. Bhuniya (2016). The graph $\mathcal{G}_H(G)$ is complete if and only if $G/H$ is cyclic if and only if $\mathcal{G}(G/H)$ is complete. The graph $\mathcal{G}_H(G)$ is Eulerian if and only if $|G|$ is odd if and only if $\mathcal{G}(G)$ is Eulerian, i.e., the property of being Eulerian does not depend on the normal subgroup $H$.

Explore related subjects

Keep this discovery

BibTeXRIS

Luis A. Dupont, Daniel G. Mendoza, Miriam Rodríguez. 2017-07-04. The enhanced quotient graph of the quotient of a finite group. https://arxiv.org/abs/1707.01127

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