A characterization of long graphs of arbitrary rank

The rank of a graph G is defined to be the rank of its adjacency matrix. A connected graph G of rank n is called long if it has maximum diameter among all connected graphs with rank n. In this paper, we characterize the long graphs of rank n, for n an arbitrary positive integer.