On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
From MaRDI portal
Publication:2311365
DOI10.1016/j.ejc.2018.07.011zbMath1415.05174arXiv1712.09529OpenAlexW2778983193MaRDI QIDQ2311365
Leonid Viktorovich Shalaginov, Vladislav V. Kabanov, Natal'ya Vladimirovna Maslova
Publication date: 10 July 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09529
Related Items (6)
Spectra of Deza graphs ⋮ On quasi-strongly regular graphs with parameters \((n, k, a; k-2, c_2)\). I ⋮ Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs ⋮ Deza graphs with parameters (v,k,k−2,a) ⋮ On quasi-strongly regular graphs with parameters \(( n , k , a ; k - 1 , c_2 )\) ⋮ Deza graphs with parameters and
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the vertex connectivity of Deza graphs
- Deza graphs based on symplectic spaces
- Deza graphs on 14, 15 and 16 vertices
- Cayley-Deza graphs with fewer than 60 vertices
- The connectivity of strongly regular graphs
- Edge-regular graphs with regular cliques
- Divisible design graphs
- Deza graphs: A generalization of strongly regular graph
This page was built for publication: On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
