research

# The skew-rank of oriented graphs

## Abstract

An oriented graph $G^\sigma$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^\sigma$. Let $S(G^\sigma)$ denote the skew-adjacency matrix of $G^\sigma$. The rank of the skew-adjacency matrix of $G^\sigma$ is called the {\it skew-rank} of $G^\sigma$, denoted by $sr(G^\sigma)$. The skew-adjacency matrix of an oriented graph is skew symmetric and the skew-rank is even. In this paper we consider the skew-rank of simple oriented graphs. Firstly we give some preliminary results about the skew-rank. Secondly we characterize the oriented graphs with skew-rank 2 and characterize the oriented graphs with pendant vertices which attain the skew-rank 4. As a consequence, we list the oriented unicyclic graphs, the oriented bicyclic graphs with pendant vertices which attain the skew-rank 4. Moreover, we determine the skew-rank of oriented unicyclic graphs of order $n$ with girth $k$ in terms of matching number. We investigate the minimum value of the skew-rank among oriented unicyclic graphs of order $n$ with girth $k$ and characterize oriented unicyclic graphs attaining the minimum value. In addition, we consider oriented unicyclic graphs whose skew-adjacency matrices are nonsingular.Comment: 17 pages, 4 figure

## Full text

arXiv.org e-Print ArchiveProvided a free PDF (195.62 KB)

1404.7230oai:arXiv.org:1404.7230
Last time updated on October 24, 2014View original full text link

This paper was published in arXiv.org e-Print Archive.

# Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.