SearcharxivSearch

arXiv · 2312.08930

Spectrum of conjugacy and order super commuting graphs of some finite groups

Abstract

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with vertex set $V(\Gamma)$ and two distinct vertices are adjacent if either they are in the same $\mathcal{R}$-equivalence class or there are elements in their respective $\mathcal{R}$-equivalence classes that are adjacent in the original graph $\Gamma$. We first show that $\Gamma^{\mathcal{R}}$ is a generalized join of some complete graphs and using this we obtain the adjacency and Laplacian spectrum of conjugacy and order super commuting graphs of dihedral group $D_{2n}\; (n\geq 3)$, generalized quaternion group $Q_{4m} \;(m\geq 2)$ and the nonabelian group $\mathbb Z_p \rtimes \mathbb Z_q$ of order $pq$, where $p$ and $q$ are distinct primes with $q|p-1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Sandeep Dalal, Sanjay Mukherjee, Kamal Lochan. 2023-12-14. Spectrum of conjugacy and order super commuting graphs of some finite groups. https://arxiv.org/abs/2312.08930

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