SearcharxivSearch

arXiv · 2308.03719

Laplacian Eigen values of character degree graphs of solvable groups

Abstract

Let $G$ be a finite solvable group, let $Irr(G)$ be the set of all complex irreducible characters of $G$ and let $cd(G)$ be the set of all degrees of characters in $Irr(G).$ Let $\rho(G)$ be the set of primes that divide degrees in $cd(G).$ The character degree graph $\Delta(G)$ of $G$ is the simple undirected graph with vertex set $\rho(G)$ and in which two distinct vertices $p$ and $q$ are adjacent if there exists a character degree $r \in cd(G)$ such that $r$ is divisible by the product $pq.$ In this paper, we obtain Laplacian eigen values and distance Laplacian eigen values of regular character degree graph, super graphs of regular character degree graph and character degree graph with diameter $2$ has two blocks.

Explore related subjects

Keep this discovery

BibTeXRIS

G. Sivanesan, C. Selvaraj. 2023-08-07. Laplacian Eigen values of character degree graphs of solvable groups. https://arxiv.org/abs/2308.03719

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