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

DOI10.1016/j.disc.2008.07.037zbMath1194.05129OpenAlexW1974174477MaRDI QIDQ1011491

Andries E. Brouwer, Patric R. J. Östergård

Publication date: 8 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.037

zbMATH Keywords

classificationbiplanessemibiplanes(0,2)-graphsrectagraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

Deza graphs with parameters (v,k,k−2,a), \((0, 2)\)-graphs and root systems, On 2-walk-regular graphs with a large intersection number \(c_2\), Locally triangular graphs and rectagraphs with symmetry

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \((0,\lambda)\)-graphs and \(n\)-cubes
• Classification algorithms for codes and designs
• Classification of small \((0,2)\)-graphs
• On collineation groups of symmetric block designs
• Rectagraphs, Diagrams, and Suzuki's Sporadic Simple Group
• There are exactly five biplanes with k = 11