Some relations between rank of a graph and its complement (Q869950)

Let \(G\) be a graph of order \(n\) and rank\((G)\) denote the rank of its adjacency matrix. Clearly, \(n\leq \text{rank}(G)+\text{rank}(\overline G)\leq 2n\). In this paper we characterize all graphs \(G\) such that \(\text{rank}(G) + \text{rank}(\overline G)=n\), \(n+1\) or \(n + 2\). Also for every integer \(n \geq 5\) and any \(k\), \(0\leq k\leq n\), we construct a graph \(G\) of order \(n\), such that \(\text{rank}(G) + \text{rank}(\overline G)=n+k\).