We look for a non-zero $(0, 1)$-vector in the row space of the adjacency matrix $A(Γ)$ of a graph $Γ,$ provided $Γ$ has at least one edge. Akbari, Cameron, and Khosrovshahi conjectured that there exists a non-zero $(0,1)$-vector in the row space of $A(Γ)$ (over the real numbers) which does not occur as a row of $A(Γ).$ This conjecture can be easily verified for graphs having diameter is equal to $1$ (complete graphs). In this article, we affirmatively prove this conjecture for any graph whose diameter is $\geq 4.$ Furthermore, in the remaining two cases that is, for graphs with diameter is equal to $2$ or $3,$ we report some progress in support of the conjecture.