English

4-Regular oriented graphs with optimum skew energy

Combinatorics 2013-04-04 v1

Abstract

Let GG be a simple undirected graph, and GσG^\sigma be an oriented graph of GG with the orientation σ\sigma and skew-adjacency matrix S(Gσ)S(G^\sigma). The skew energy of the oriented graph GσG^\sigma, denoted by ES(Gσ)\mathcal{E}_S(G^\sigma), is defined as the sum of the absolute values of all the eigenvalues of S(Gσ)S(G^\sigma). In this paper, we characterize the underlying graphs of all 4-regular oriented graphs with optimum skew energy and give orientations of these underlying graphs such that the skew energy of the resultant oriented graphs indeed attain optimum. It should be pointed out that there are infinitely many 4-regular connected optimum skew energy oriented graphs, while the 3-regular case only has two graphs: K4K_4 the complete graph on 4 vertices and Q3Q_3 the hypercube.

Keywords

Cite

@article{arxiv.1304.0847,
  title  = {4-Regular oriented graphs with optimum skew energy},
  author = {Xiaolin Chen and Xueliang Li and Huishu Lian},
  journal= {arXiv preprint arXiv:1304.0847},
  year   = {2013}
}

Comments

18 pages

R2 v1 2026-06-21T23:52:42.917Z