fThe rank of a graph is defined to be the rank of its adjacency matrix. Royle [G.F. Royle, The rank of a cograph, Electron. J. Combin. 10 (2003) #N 11] proved a somewhat surprising result that the rank of a cograph is equal to the number of distinct non-z
