Table of Contents
Fetching ...

Cayley graphs on symmetric groups generated by $n$-cycles are hyperenergetic

Mahdi Ebrahimi

Abstract

Let $Γ$ be a simple graph with $n$ vertices. The energy of $Γ$, denoted by $\mathcal{E}(Γ)$, is defined as the sum of the absolute values of the eigenvalues of $Γ$. The graph $Γ$ is said to be hyperenergetic if $\mathcal{E}(Γ)>2n-2$. For the graph $Γ$, the multiplicity of the eigenvalue $0$, denoted by $η(Γ)$, is called the nullity of $Γ$. In this paper, we show that for every positive integer $n\geq 4$, the Cayley graph $Γ_n$ on the symmetric group $\mathrm{Sym}(n)$ generated by $n$-cycles is an integral hyperenergetic graph with $\mathcal{E}(Γ_n)=2^{n-1}(n-1)!$ and $η(Γ_n)=n!-\binom{2n-2}{n-1}$.

Cayley graphs on symmetric groups generated by $n$-cycles are hyperenergetic

Abstract

Let be a simple graph with vertices. The energy of , denoted by , is defined as the sum of the absolute values of the eigenvalues of . The graph is said to be hyperenergetic if . For the graph , the multiplicity of the eigenvalue , denoted by , is called the nullity of . In this paper, we show that for every positive integer , the Cayley graph on the symmetric group generated by -cycles is an integral hyperenergetic graph with and .

Paper Structure

This paper contains 2 sections, 3 theorems, 9 equations.

Key Result

Theorem 1.1

For a positive integer $n\geq 4$, let $G$ be the symmetric group $\mathrm{Sym}(n)$ on $n$ letters, and $Z_n$ be the set of all $n$-cycles of $G$. Then the Cayley graph $\Gamma_n:=\mathrm{Cay}(G,Z_n)$ is an integral hyperenergetic graph with $\mathcal{E}(\Gamma_n)=2^{n-1}(n-1)!$ and $\eta(\Gamma_n)=n

Theorems & Definitions (3)

  • Theorem 1.1
  • Corollary 1.2
  • Theorem 2.1