Classification of small -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.