Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2

被引：0

作者：

Ping-Feng Chen

Guang-Hui Xu

Li-Pu Zhang

机构：

[1] Zhejiang A&F University,School of Information Engineering

[2] Zhejiang A&F University,School of Science

来源：

Journal of Inequalities and Applications | / 2013卷

关键词：

oriented unicyclic graph; skew-adjacency matrix; skew-spectral radius;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ with n vertices, and let λ1,λ2,…,λn be all eigenvalues of S(Gσ). The skew-spectral radius ρs(Gσ) of Gσ is defined as max{|λ1|,|λ2|,…,|λn|}. A connected graph, in which the number of edges equals the number of vertices, is called a unicyclic graph. In this paper, the structure of oriented unicyclic graphs whose skew-spectral radius does not exceed 2 is investigated. We order all the oriented unicyclic graphs with n vertices whose skew-spectral radius is bounded by 2.

引用

共 28 条

[1]

Cvetković D(1982)On graphs whose spectral radius does not exceed Ars Comb 14 225-239

[2]

Doob M(1989)The graphs with largest eigenvalue between 2 and Linear Algebra Appl 114/115 273-276

[3]

Gutman I(2007)On graphs whose spectral radius is bounded by Graphs Comb 23 713-726

[4]

Brouwer AE(2008)Some notes on graphs whose spectral radius is close to Linear Algebra Appl 429 1606-1618

[5]

Neumaier A(2003)The first six unicyclic graphs of order Appl. Math. J. Chin. Univ. Ser. A 18 480-486

[6]

Woo R(2008) with larger spectral radius Discrete Appl. Math 156 1670-1682

[7]

Neumaier A(2010)Ordering graphs with index in the interval Linear Algebra Appl 432 1825-1835

[8]

Wang JF(2012)The skew energy of a graph Linear Algebra Appl 436 465-471

[9]

Huang QX(2012)The characteristic polynomial and the matchings polynomial of a weighted oriented graph Linear Algebra Appl 436 4512-4529

[10]

An XH(undefined)Skew-adjacency matrices of graphs undefined undefined undefined-undefined

← 1 2 3 →