4-Regular oriented graphs with optimum skew energy
Preprint
Abstract
Let $G$ be a simple undirected graph, and $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the absolute values of all the eigenvalues of $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: $K_4$ the complete graph on 4 vertices and $Q_3$ the hypercube.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- The skew energy of random oriented graphsLinear Algebra and its Applications, 2013
- 3-Regular digraphs with optimum skew energyLinear Algebra and its Applications, 2012
- Bicyclic digraphs with extremal skew energyThe Electronic Journal of Linear Algebra, 2012
- On the skew energy of orientations of hypercubesLinear Algebra and its Applications, 2011
- Characteristic Polynomials of Skew-Adjacency Matrices of Oriented GraphsThe Electronic Journal of Combinatorics, 2011
- The skew energy of a digraphLinear Algebra and its Applications, 2010
- Skew Spectra of Oriented GraphsThe Electronic Journal of Combinatorics, 2009