| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656606 | Journal of Combinatorial Theory, Series A | 2006 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
