Lower bounds of the skew spectral radii and skew energy of oriented graphs

TL;DR

This paper establishes new lower bounds for the skew spectral radius and skew energy of oriented graphs, characterizing cases of equality and improving previous bounds in spectral graph theory.

Contribution

It provides novel lower bounds for the skew spectral radius and energy of oriented graphs, including characterizations of extremal cases, advancing understanding in spectral graph theory.

Findings

Lower bounds for skew spectral radius are established.

Characterization of graphs attaining the lower bound $\,\sqrt{ ext{max degree}}",$.

Improved lower bounds for skew energy compared to previous results.

Abstract

Let $G$ be a graph with maximum degree $\Delta$, and let $G^{\sigma}$ be an oriented graph of $G$ with skew adjacency matrix $S(G^{\sigma})$. The skew spectral radius $\rho_s(G^{\sigma})$ of $G^\sigma$ is defined as the spectral radius of $S(G^\sigma)$. The skew spectral radius has been studied, but only few results about its lower bound are known. This paper determines some lower bounds of the skew spectral radius, and then studies the oriented graphs whose skew spectral radii attain the lower bound $\sqrt{\Delta}$. Moreover, we apply the skew spectral radius to the skew energy of oriented graphs, which is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$, and denoted by $\mathcal{E}_s(G^\sigma)$. As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.