Oriented unicyclic graphs with extremal skew energy

Abstract: Let $\G$ be an oriented graph of order $n$ and $\a_1,\a_2,..., \a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\G.$ The skew energy $\displaystyle{\cal E}s(\G)= \sum{i=1}^{n} |\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.