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

FOS: Mathematics Mathematics - Combinatorics Combinatorics (math.CO) 05C20, 05C50, 15A18, 05C90 0101 mathematics 01 natural sciences
DOI: 10.48550/arxiv.1405.4972 Publication Date: 2015-08-01
ABSTRACT
Let $G$ be a graph with maximum degree $��$, and let $G^��$ be an oriented graph of $G$ with skew adjacency matrix $S(G^��)$. The skew spectral radius $��_s(G^��)$ of $G^��$ is defined as the spectral radius of $S(G^��)$. 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��$. 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^��)$, and denoted by $\mathcal{E}_s(G^��)$. As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.<br/>16 pages, 2 figures<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....