5-regular oriented graphs with optimum skew energy

Lifeng Guo, Ligong Wang, Peng Xiao

科研成果: 期刊稿件文章同行评审

5 引用 (Scopus)

摘要

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.

源语言英语
页(从-至)43-59
页数17
期刊Applied Mathematics and Computation
301
DOI
出版状态已出版 - 15 5月 2017

指纹

探究 '5-regular oriented graphs with optimum skew energy' 的科研主题。它们共同构成独一无二的指纹。

引用此