If you have a graph represented by an adjacency matrix, what intuitively in terms of the original graph would low rank correspond to?

I am interested in this for both directed and undirected graphs.

This is relevant because low rank is very important in common techniques such as non-negative matrix factorization and it would be interesting to understand what the assumptions mean for graphs.