Abstract
Let be a graph with maximum degree , and let be an oriented graph of with skew adjacency matrix . The skew spectral radius of is defined as the spectral radius of . 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 . 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 , and denoted by . As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.