skew-spectra and skew energy of various products of graphs

Given a graph G, let G^σ be an oriented graph of G with the orientation σ and skew- adjacency matrix S(G^σ). Then the spectrum of S(G^σ) consisting of all the eigenvalues of S(G^σ) is called the skew-spectrum of G^σ , denoted by Sp(G^σ). The skew energy of the oriented graph G^σ, denoted by ES (G^σ), is defined as the sum of the norms of all the eigenvalues of S(G^σ). In this paper, we give orientations of the Kronecker product H ⊗ G and the strong product H * G of H and G where H is a bipartite graph and G is an arbitrary graph. Then we determine the skew-spectra of the resultant oriented graphs. As applications, we construct new families of oriented graphs with optimum skew energy. Moreover, we consider the skew energy of the orientation of the lexicographic product H[G] of a bipartite graph H and a graph G.