5-regular oriented graphs with optimum skew energy

Lifeng Guo, Ligong Wang and Peng Xiao

Applied Mathematics and Computation, 2017, vol. 301, issue C, 43-59

Abstract: Let G be a simple undirected graph and Gσ be the corresponding oriented graph of G with the orientation σ. The skew energy of Gσ, denoted by εs(Gσ), is defined as the sum of the singular values of the skew adjacency matrix S(Gσ). In 2010, Adiga et al. certified that ɛs(Gσ)≤nΔ, where Δ is the maximum degree of G of order n. It has been shown that every 5-regular oriented graph with optimum skew energy has even neighborhood property, that is each pair of neighborhoods of a graph have even number of common vertices. In this paper, we characterize all connected 5-regular graphs of order n with this property. Moreover, we determine all connected 5-regular oriented graphs of order n with maximum skew-energy.

Keywords: Oriented graph; Skew-adjacency matrix; Skew energy (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316307408
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:301:y:2017:i:c:p:43-59

DOI: 10.1016/j.amc.2016.12.014

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().