Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph

preprint2016arXivOpen access

Abstract

Let GσG^σ be an oriented graph and S(Gσ)S(G^σ) be its skew-adjacency matrix, where GG is called the underlying graph of GσG^σ. The skew-rank of GσG^σ, denoted by sr(Gσ)sr(G^σ), is the rank of S(Gσ)S(G^σ). Denote by d(G)=∣E(G)∣−∣V(G)∣+θ(G)d(G)=|E(G)|-|V(G)|+θ(G) the dimension of cycle spaces of GG, where ∣E(G)∣|E(G)|, ∣V(G)∣|V(G)| and θ(G)θ(G) are the edge number, vertex number and the number of connected components of GG, respectively. Recently, Wong, Ma and Tian [European J. Combin. 54 (2016) 76--86] proved that sr(Gσ)≤r(G)+2d(G)sr(G^σ)\leq r(G)+2d(G) for an oriented graph GσG^σ, where r(G)r(G) is the rank of the adjacency matrix of GG, and characterized the graphs whose skew-rank attain the upper bound. However, the problem of the lower bound of sr(Gσ)sr(G^σ) of an oriented graph GσG^σ in terms of r(G)r(G) and d(G)d(G) of its underlying graph GG is left open till now. In this paper, we prove that sr(Gσ)≥r(G)−2d(G)sr(G^σ)\geq r(G)-2d(G) for an oriented graph GσG^σ and characterize the graphs whose skew-rank attain the lower bound.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.