Abstract
Let S ( G σ ) be the skew-adjacency matrix of an oriented graph G σ with n vertices, and let λ 1 , λ 2 , … , λ n be all eigenvalues of S ( G σ ) . The skew-spectral radius ρ s ( G σ ) of G σ is defined as max { | λ 1 | , | λ 2 | , … , | λ n | } . A connected graph, in which the number of edges equals the number of vertices, is called a unicyclic graph. In this paper, the structure of oriented unicyclic graphs whose skew-spectral radius does not exceed 2 is investigated. We order all the oriented unicyclic graphs with n vertices whose skew-spectral radius is bounded by 2. MSC:05C50, 15A18.

This publication has 8 references indexed in Scilit: