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. 
DOI: 10.1016/j.jcta.2006.03.023


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.