Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (Q724735)

Let \(G^{\sigma}\) be an oriented graph for which its underlying graph is \(G\). The skew-adjacency matrix associated to \(G^{\sigma}\), denoted by \(S(G^{\sigma})\), is defined to be an \(n\times n\) matrix \([s_{x,y}]\) such that \(s_{x,y}=1\) if there is an arc from \(x\) to \(y\), \(s_{x,y}=-1\) if there is an arc from \(y\) to \(x\) and \(s_{x,y}=0\), otherwise. The rank of \(S(G^{\sigma})\) is called the skew-rank of \(G^{\sigma}\), denoted by \(\operatorname{sr}(G^{\sigma})\). The value \(d(G):=|E(G)|-|V(G)|+\omega(G)\) is called the dimension of cycle space of \(G\), where \(\omega(G)\) is the number of the components of \(G\). As usual the independence number of graph \(G\) is denoted by \(\alpha(G)\). The authors prove that \(\operatorname{sr}(G^{\sigma}))+2\alpha(G)\geq 2|V(G)|-2d(G)\) and also established sharp lower bounds for \(\operatorname{sr}(G^{\sigma})+\alpha(G)\), \(\operatorname{sr}(G^{\sigma})-\alpha(G)\), \(\operatorname{sr}(G^{\sigma})/\alpha(G)\) and characterize all corresponding extremal graphs.