Classification of small (0,2)-graphs
DOI10.1016/J.JCTA.2006.03.023zbMATH Open1105.05009OpenAlexW2077415866MaRDI QIDQ855864FDOQ855864
Authors: Andries E. Brouwer
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.023
Recommendations
Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Buildings and the geometry of diagrams (51E24)
Cites Work
Cited In (11)
- Locally triangular graphs and rectagraphs with symmetry
- Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum
- The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures
- \((0, 2)\)-graphs and root systems
- Locally triangular graphs and normal quotients of the \(n\)-cube
- Classification of the (0, 2)-graphs of valency 8
- Two-geodesic transitive graphs of valency six
- Deza graphs with parameters (v,k,k−2,a)
- On divisible design Cayley graphs
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- On 2-walk-regular graphs with a large intersection number \(c_2\)
This page was built for publication: Classification of small \((0,2)\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855864)