Cayley-Deza graphs with fewer than 60 vertices

zbMATH Open1326.05061MaRDI QIDQ892000FDOQ892000

Leonid Viktorovich Shalaginov, Sergey Viktorovich Goryainov

Publication date: 18 November 2015

Published in: Sibirskie Elektronnye 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

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

Cited In (12)

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

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

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