Bicyclic oriented graphs with skew-rank 6

作者：

Highlights：

•

摘要

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.

论文关键词：Oriented graph,Skew-rank,Skew-adjacency matrix,Bicyclic oriented graph

论文评审过程：Received 6 July 2015, Revised 21 August 2015, Accepted 24 August 2015, Available online 14 September 2015, Version of Record 14 September 2015.

论文官网地址：https://doi.org/10.1016/j.amc.2015.08.105