On rank of a matrix associated with graph

In this paper we investigate the upper bound on the smallest number of cliques that cover the vertices of graph G in terms of the rank of a matrix associated with it. Let X be real matrix that is indexed by vertices of G such that all its diagonal entries are non-zero and Xij = 0 whenever vertices i,j are non-adjacent. Then 3rk(X)/2