On a family of strongly regular graphs with \(\lambda = 1\)
From MaRDI portal
Publication:463295
DOI10.1016/j.jctb.2013.05.005zbMath1301.05372arXiv1201.0383OpenAlexW2093426100WikidataQ62721768 ScholiaQ62721768MaRDI QIDQ463295
Andriy V. Bondarenko, Danylo V. Radchenko
Publication date: 16 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.0383
Related Items
Optimal and near optimal configurations on lattices and manifolds. Abstracts from the workshop held August 19--25, 2012. ⋮ Ball packings with high chromatic numbers from strongly regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance regular graphs of diameter 3 and strongly regular graphs
- Search for properties of the missing Moore graph
- A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
- Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\)
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Caps and codes
- On automorphisms of strongly regular graphs with $\lambda=0$ and $\mu=3$
- On Moore Graphs with Diameters 2 and 3
- Point configurations that are asymmetric yet balanced
- The Geometry of Two-Weight Codes
- PARTIAL QUADRANGLES
