Classification of small (0, 2)-graphs

@article{Brouwer2006ClassificationOS,
  title={Classification of small (0, 2)-graphs},
  author={A. Brouwer},
  journal={J. Comb. Theory, Ser. A},
  year={2006},
  volume={113},
  pages={1636-1645}
}
  • A. Brouwer
  • Published 2006
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
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. 

Topics from this paper

Classification of the (0, 2)-graphs of valency 8
(0, 2)-Graphs and Root Systems
On divisible design Cayley graphs.
4-cycle properties for characterizing rectagraphs and hypercubes
Locally triangular graphs and normal quotients of the n-cube
On 2-walk-regular graphs with a large intersection number c2
Two-geodesic transitive graphs of valency six
Locally triangular graphs and rectagraphs with symmetry
...
1
2
...

References

SHOWING 1-10 OF 13 REFERENCES
Rectagraphs, Diagrams, and Suzuki's Sporadic Simple Group
Reconstructing projective planes form semibiplanes
Distance-Regular Graphs
Table of (0,2)-graphs of order less than 32
  • Rapport de Recherche/IMAG RR 939
  • 1994
Reconstructing projective planes from semibiplanes, in: Coding theory and design theory, Part II
  • Math. Appl
  • 1990
A
  • M. Cohen & A. Neumaier, Distance-regular graphs, Springer, Berlin
  • 1989
Generalized Hussain graphs and semibiplanes with k ≤ 6
  • Ars Combin
  • 1982
Rectagraphs
  • diagrams, and Suzuki’s sporadic simple group, in: Algebraic and geometric combinatorics, pp. 305–318, North-Holland Math. Stud. 65, North-Holland, Amsterdam
  • 1982
Two New Semibiplanes
On semibiplanes
  • On semibiplanes
  • 1980
...
1
2
...