Cayley-Deza graphs with fewer than 60 vertices

zbMath1326.05061MaRDI QIDQ892000

Leonid Viktorovich Shalaginov, Sergey Viktorovich Goryainov

Publication date: 18 November 2015

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v11/p268-310.pdf

zbMATH Keywords

automorphism groupCayley graphgraph isomorphismDeza graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

Neumaier graphs with few eigenvalues ⋮ On WL-rank of Deza Cayley graphs ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ Edge-regular graphs with regular cliques ⋮ On divisible design Cayley graphs ⋮ On WL-rank and WL-dimension of some Deza circulant graphs ⋮ Enumeration of strictly Deza graphs with at most 21 vertices ⋮ On strictly Deza graphs with parameters \((n, k, k - 1, a)\) ⋮ Another construction of edge-regular graphs with regular cliques ⋮ An infinite class of Neumaier graphs and non-existence results

This page was built for publication: Cayley-Deza graphs with fewer than 60 vertices