We show that the number of points with pairwise different sets of neighbors in a graph is O(2r/2), where r is the rank of the adjacency matrix. We also give an example that achieves this bound.
|Number of pages||5|
|Journal||Journal of Graph Theory|
|Publication status||Published - Oct 1996|
ASJC Scopus subject areas
- Geometry and Topology