Some relations between rank of a graph and its complement Original Research Article

Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, image. In this paper we characterize all graphs G such that image or n + 2. Also for every integer n greater-or-equal, slanted 5 and any k, 0 less-than-or-equals, slant k less-than-or-equals, slant n, we construct a graph G of order n, such that image.