Cayley-Deza graphs with fewer than 60 vertices
From MaRDI portal
(Redirected from Publication:892000)
Cited in
(12)- On WL-rank of Deza Cayley graphs
- Enumeration of strictly Deza graphs with at most 21 vertices
- A general construction of strictly Neumaier graphs and a related switching
- An infinite class of Neumaier graphs and non-existence results
- On WL-rank and WL-dimension of some Deza circulant graphs
- On the Existence of Small Strictly Neumaier Graphs
- On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
- The smallest strictly Neumaier graph and its generalisations
- Edge-regular graphs with regular cliques
- On divisible design Cayley graphs
- Neumaier graphs with few eigenvalues
- 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)