Classification of small \((0,2)\)-graphs
From MaRDI portal
Publication:855864
DOI10.1016/j.jcta.2006.03.023zbMath1105.05009OpenAlexW2077415866MaRDI QIDQ855864
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
Combinatorial aspects of block designs (05B05) Enumeration in graph theory (05C30) Combinatorial aspects of finite geometries (05B25) Buildings and the geometry of diagrams (51E24) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space, Two-geodesic transitive graphs of valency six, Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum, Deza graphs with parameters (v,k,k−2,a), The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures, \((0, 2)\)-graphs and root systems, On divisible design Cayley graphs, Locally triangular graphs and normal quotients of the \(n\)-cube, Classification of the (0, 2)-graphs of valency 8, On 2-walk-regular graphs with a large intersection number \(c_2\), Locally triangular graphs and rectagraphs with symmetry
Cites Work
