On Deza graphs with triangular and lattice graph complements as parameters

DOI10.1134/S1990478913030083MaRDI QIDQ5263807zbMATH OpenFDO

Authors Sergey Viktorovich Goryainov, Leonid Viktorovich Shalaginov

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

involutive automorphismDeza graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• Enumeration of strictly Deza graphs with at most 21 vertices
• On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
• Claw-free strictly Deza graphs
• On \(K_{1,3}\)-free strictly Deza graphs
• Deza graphs with parameters \((n,k,k-1,a)\) and \(\beta=1\)

Cited in

(2)

• On the vertex connectivity of Deza graphs
• On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs

This page was built for publication: On Deza graphs with triangular and lattice graph complements as parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263807)