Optimum skew energy of a tournament

Lifeng Guo; Ligong Wang

doi:10.1016/j.laa.2017.05.028

Optimum skew energy of a tournament

Lifeng Guo
, Ligong Wang

数学与统计学院

Northwestern Polytechnical University Xian

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

2 引用（Scopus）

摘要

Let G be a simple undirected graph and G^σ the corresponding oriented graph of G with the orientation σ. The skew energy of G^σ, denoted by ε(G^σ), is defined as the sum of the singular values of its skew adjacency matrix S(G^σ). In 2010, Adiga et al. proved ε(G^σ)≤nΔ, where Δ is the maximum degree of G of order n. In this paper, we characterize the skew energy of a tournament and present some properties about an optimum skew energy tournament.

源语言	英语
页（从-至）	405-413
页数	9
期刊	Linear Algebra and Its Applications
卷	530
DOI	https://doi.org/10.1016/j.laa.2017.05.028
出版状态	已出版 - 1 10月 2017

访问文件

10.1016/j.laa.2017.05.028

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{c8d963205a464b258c096a2ecb582516,

title = "Optimum skew energy of a tournament",

abstract = "Let G be a simple undirected graph and Gσ the corresponding oriented graph of G with the orientation σ. The skew energy of Gσ, denoted by ε(Gσ), is defined as the sum of the singular values of its skew adjacency matrix S(Gσ). In 2010, Adiga et al. proved ε(Gσ)≤nΔ, where Δ is the maximum degree of G of order n. In this paper, we characterize the skew energy of a tournament and present some properties about an optimum skew energy tournament.",

keywords = "Skew energy, Skew-adjacency matrix, Tournament",

author = "Lifeng Guo and Ligong Wang",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier Inc.",

year = "2017",

month = oct,

day = "1",

doi = "10.1016/j.laa.2017.05.028",

language = "英语",

volume = "530",

pages = "405--413",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Optimum skew energy of a tournament

AU - Guo, Lifeng

AU - Wang, Ligong

PY - 2017/10/1

Y1 - 2017/10/1

N2 - Let G be a simple undirected graph and Gσ the corresponding oriented graph of G with the orientation σ. The skew energy of Gσ, denoted by ε(Gσ), is defined as the sum of the singular values of its skew adjacency matrix S(Gσ). In 2010, Adiga et al. proved ε(Gσ)≤nΔ, where Δ is the maximum degree of G of order n. In this paper, we characterize the skew energy of a tournament and present some properties about an optimum skew energy tournament.

AB - Let G be a simple undirected graph and Gσ the corresponding oriented graph of G with the orientation σ. The skew energy of Gσ, denoted by ε(Gσ), is defined as the sum of the singular values of its skew adjacency matrix S(Gσ). In 2010, Adiga et al. proved ε(Gσ)≤nΔ, where Δ is the maximum degree of G of order n. In this paper, we characterize the skew energy of a tournament and present some properties about an optimum skew energy tournament.

KW - Skew energy

KW - Skew-adjacency matrix

KW - Tournament

UR - https://www.scopus.com/pages/publications/85019846988

U2 - 10.1016/j.laa.2017.05.028

DO - 10.1016/j.laa.2017.05.028

M3 - 文章

AN - SCOPUS:85019846988

SN - 0024-3795

VL - 530

SP - 405

EP - 413

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

Optimum skew energy of a tournament

摘要

访问文件

其它文件与链接

指纹

引用此