Classification of small (0, 2)-graphs

We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block size at most 7.

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Andries E. Brouwer
• Keywords: Common Neighbours, JCT 2006, Nonadjacent Vertices