Given a simple graph G, the oriented graph Gσ is obtained from G by orienting each edge and G is called the underlying graph of Gσ. The skew-symmetric adjacency matrix S(Gσ)of Gσ, where the(u, v)-entry is 1 if there is an arc from u to v, and -1 if there is an arc from v to u(and 0 otherwise), has eigenvalues of 0 or pure imaginary. The k-th-skew spectral moment of Gσis the sum of power k of all eigenvalues of S(Gσ), where k is a non-negative integer. The skew spectral moments can be used to produce graph catalogues. In this paper, we res...
