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

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 . 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 Es(Gσ). As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…