On oriented graphs with minimal skew energy

From MaRDI portal
Publication:5501697




Abstract: Let S(Gsigma) be the skew-adjacency matrix of an oriented graph Gsigma. The skew energy of Gsigma is defined as the sum of all singular values of its skew-adjacency matrix S(Gsigma). In this paper, we first deduce an integral formula for the skew energy of an oriented graph. Then we determine all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m(nlem<2(n2)) arcs, which is an analogy to the conjecture for the energy of undirected graphs proposed by Caporossi {it et al.} [G. Caporossi, D. Cvetkoviacutec, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem. Inf. Comput. Sci. 39 (1999) 984-996.]









This page was built for publication: On oriented graphs with minimal skew energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501697)