LAUSR

Let $$G^\sigma $$Gσ be an oriented graph obtained by assigning an orientation $$\sigma $$σ to the edge set of a simple undirected graph G. Let $$S(G^\sigma )$$S(Gσ) be the skew-adjacency matrix of $$G^\sigma $$Gσ. The skew energy of $$G^\sigma $$Gσ is defined as the sum of the absolute values of all eigenvalues of $$S(G^\sigma )$$S(Gσ). In this paper, we determine the tricyclic oriented graphs of order $$n\ge 13$$n≥13 with the maximal skew energy.