Bicyclic oriented graphs with skew-rank 6

Yong Lu, Ligong Wang and Qiannan Zhou

Applied Mathematics and Computation, 2015, vol. 270, issue C, 899-908

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: Oriented graph; Skew-rank; Skew-adjacency matrix; Bicyclic oriented graph (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315011613
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:270:y:2015:i:c:p:899-908

DOI: 10.1016/j.amc.2015.08.105

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().