# Relation between the skew-rank of an oriented graph and the independence number of its underlying graph

Relation between the skew-rank of an oriented graph and the independence number of its underlying... An oriented graph $$G^\sigma$$ G σ is a digraph without loops or multiple arcs whose underlying graph is G. Let $$S\left( G^\sigma \right)$$ S G σ be the skew-adjacency matrix of $$G^\sigma$$ G σ and $$\alpha (G)$$ α ( G ) be the independence number of G. The rank of $$S(G^\sigma )$$ S ( G σ ) is called the skew-rank of $$G^\sigma$$ G σ , denoted by $$sr(G^\sigma )$$ s r ( G σ ) . Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that $$sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)$$ s r ( G σ ) + 2 α ( G ) ⩾ 2 | V G | - 2 d ( G ) , where $$|V_G|$$ | V G | is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for $$sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)$$ s r ( G σ ) + α ( G ) , s r ( G σ ) - α ( G ) , $$sr(G^\sigma )/\alpha (G)$$ s r ( G σ ) / α ( G ) and characterize all corresponding extremal graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Combinatorial Optimization Springer Journals

# Relation between the skew-rank of an oriented graph and the independence number of its underlying graph

, Volume 36 (1) – Mar 30, 2018
16 pages      /lp/springer_journal/relation-between-the-skew-rank-of-an-oriented-graph-and-the-Vs4Koc0ou9
Publisher
Springer Journals
Subject
Mathematics; Combinatorics; Convex and Discrete Geometry; Mathematical Modeling and Industrial Mathematics; Theory of Computation; Optimization; Operations Research/Decision Theory
ISSN
1382-6905
eISSN
1573-2886
DOI
10.1007/s10878-018-0282-x
Publisher site
See Article on Publisher Site

### Abstract

An oriented graph $$G^\sigma$$ G σ is a digraph without loops or multiple arcs whose underlying graph is G. Let $$S\left( G^\sigma \right)$$ S G σ be the skew-adjacency matrix of $$G^\sigma$$ G σ and $$\alpha (G)$$ α ( G ) be the independence number of G. The rank of $$S(G^\sigma )$$ S ( G σ ) is called the skew-rank of $$G^\sigma$$ G σ , denoted by $$sr(G^\sigma )$$ s r ( G σ ) . Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that $$sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)$$ s r ( G σ ) + 2 α ( G ) ⩾ 2 | V G | - 2 d ( G ) , where $$|V_G|$$ | V G | is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for $$sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)$$ s r ( G σ ) + α ( G ) , s r ( G σ ) - α ( G ) , $$sr(G^\sigma )/\alpha (G)$$ s r ( G σ ) / α ( G ) and characterize all corresponding extremal graphs.

### Journal

Journal of Combinatorial OptimizationSpringer Journals

Published: Mar 30, 2018

Access the full text.