Cayley-Deza graphs with fewer than 60 vertices

MaRDI QIDQ892000zbMATH OpenFDO

Authors Sergey Viktorovich Goryainov, Leonid Viktorovich Shalaginov

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 graphDeza graphgraph isomorphism

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)

Cited in

(14)

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

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)