Lower bounds of the skew spectral radii and skew energy of oriented graphs
Preprint
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.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2Journal of Inequalities and Applications, 2013
- On oriented graphs whose skew spectral radii do not exceed 2Linear Algebra and its Applications, 2013
- Some inequalities on the skew-spectral radii of oriented graphsJournal of Inequalities and Applications, 2012
- Skew-adjacency matrices of graphsLinear Algebra and its Applications, 2012
- The skew energy of a digraphLinear Algebra and its Applications, 2010
- Skew Spectra of Oriented GraphsThe Electronic Journal of Combinatorics, 2009
- The chromatic number of oriented graphsJournal of Graph Theory, 1997
- Spectral Radius and Degree SequenceMathematische Nachrichten, 1988
- The Eigenvalues of a Graph and Its Chromatic NumberJournal of the London Mathematical Society, 1967