5-regular oriented graphs with optimum skew energy

详细信息    查看全文

• 作者：Lifeng Guo ^{lfguomath@163.com} ; Ligong Wang ; ^{lgwangmath@163.com} ; ^{lgwang@nwpu.edu.cn} ; Peng Xiao ^{xiaopeng@sust.edu.cn}
• 关键词：Oriented graph ; Skew-adjacency matrix ; Skew energy
• 刊名：Applied Mathematics and Computation
• 出版年：2017
• 出版时间：15 May 2017
• 年：2017
• 卷：301
• 期：Complete
• 页码：43-59
• 全文大小：1439 K
• 卷排序：301

文摘

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.