Improved bounds on the $H$-rank of a mixed graph in terms of the matching number and fractional matching number

Qi Wu, Yong Lu

A mixed graph $\tilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\tilde{G}$. Let $r(\tilde{G})$ be the $H$-rank of $\…