Classification of the (0, 2)-graphs of valency 8

@article{Brouwer2009ClassificationOT,
  title={Classification of the (0, 2)-graphs of valency 8},
  author={A. Brouwer and P. {\"O}sterg{\aa}rd},
  journal={Discret. Math.},
  year={2009},
  volume={309},
  pages={532-547}
}
We find the 302 graphs of valency 8 with the property that any two vertices have 0 or 2 common neighbours, and, in particular, the 104 semibiplanes of block size 8. 

Topics from this paper

References

SHOWING 1-10 OF 32 REFERENCES
Classification of small (0, 2)-graphs
  • A. Brouwer
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2006
(0, Λ)-graphs and N-cubes
On Collineation Groups of Symmetric Block Designs
  • M. Aschbacher
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1971
Dancing links
nauty User ’ s Guide ( Version 2 . 4 )
Millennial Perspectives in Computer Science
...
1
2
3
4
...