Bicyclic oriented graphs with skew-rank 6

Yong Lu; Ligong Wang; Qiannan Zhou

doi:10.1016/j.amc.2015.08.105

Bicyclic oriented graphs with skew-rank 6

Yong Lu, Ligong Wang, Qiannan Zhou

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

Let G^σ be an oriented graph and S(G^σ) be its skew-adjacency matrix. The skew-rank of G^σ, denoted by sr(G^σ), is the rank of S(G^σ). In this paper, we characterize all the bicyclic oriented graphs with skew-rank 6. Let G^σ be a bicyclic oriented graph with pendant vertices but no pendant twins. If sr(^Gσ)=6, then 6 < |V(G)| < 10.

Original language	English
Pages (from-to)	899-908
Number of pages	10
Journal	Applied Mathematics and Computation
Volume	270
DOIs	https://doi.org/10.1016/j.amc.2015.08.105
State	Published - 1 Nov 2015

Keywords

Bicyclic oriented graph
Oriented graph
Skew-adjacency matrix
Skew-rank

Access to Document

10.1016/j.amc.2015.08.105

Cite this

@article{c8f7378662f24455bbe115c515babcdb,

title = "Bicyclic oriented graphs with skew-rank 6",

abstract = "Let Gσ be an oriented graph and S(Gσ) be its skew-adjacency matrix. The skew-rank of Gσ, denoted by sr(Gσ), is the rank of S(Gσ). In this paper, we characterize all the bicyclic oriented graphs with skew-rank 6. Let Gσ be a bicyclic oriented graph with pendant vertices but no pendant twins. If sr(Gσ)=6, then 6 < |V(G)| < 10.",

keywords = "Bicyclic oriented graph, Oriented graph, Skew-adjacency matrix, Skew-rank",

author = "Yong Lu and Ligong Wang and Qiannan Zhou",

year = "2015",

month = nov,

day = "1",

doi = "10.1016/j.amc.2015.08.105",

language = "英语",

volume = "270",

pages = "899--908",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Bicyclic oriented graphs with skew-rank 6

AU - Lu, Yong

AU - Wang, Ligong

AU - Zhou, Qiannan

PY - 2015/11/1

Y1 - 2015/11/1

N2 - Let Gσ be an oriented graph and S(Gσ) be its skew-adjacency matrix. The skew-rank of Gσ, denoted by sr(Gσ), is the rank of S(Gσ). In this paper, we characterize all the bicyclic oriented graphs with skew-rank 6. Let Gσ be a bicyclic oriented graph with pendant vertices but no pendant twins. If sr(Gσ)=6, then 6 < |V(G)| < 10.

AB - Let Gσ be an oriented graph and S(Gσ) be its skew-adjacency matrix. The skew-rank of Gσ, denoted by sr(Gσ), is the rank of S(Gσ). In this paper, we characterize all the bicyclic oriented graphs with skew-rank 6. Let Gσ be a bicyclic oriented graph with pendant vertices but no pendant twins. If sr(Gσ)=6, then 6 < |V(G)| < 10.

KW - Bicyclic oriented graph

KW - Oriented graph

KW - Skew-adjacency matrix

KW - Skew-rank

UR - http://www.scopus.com/inward/record.url?scp=84941360940&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2015.08.105

DO - 10.1016/j.amc.2015.08.105

M3 - 文章

AN - SCOPUS:84941360940

SN - 0096-3003

VL - 270

SP - 899

EP - 908

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

Bicyclic oriented graphs with skew-rank 6

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this