Deza graphs: A generalization of strongly regular graph
From MaRDI portal
Recommendations
Cites work
Cited in
(58)- Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
- On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph
- On quasi-strongly regular graphs with parameters (n, k, a; k-2, c₂). I
- Deza digraphs. II.
- Deza digraphs
- q-analogs of divisible design graphs and Deza graphs
- On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
- On a family of quasi-strongly regular Cayley graphs
- Spectra of Deza graphs
- New constructions of Deza digraphs
- Spectra of strongly Deza graphs
- Deza graphs based on symplectic spaces
- Claw-free strictly Deza graphs
- On quasi-strongly regular graphs
- Links between two semisymmetric graphs on 112 vertices via association schemes
- On extendability of Deza graphs with diameter 2
- Subconstituents of symplectic graphs
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- On the second neighbourhoods of quasi-strongly regular graphs
- On the geometry of Zara graphs
- Higmanian rank-5 association schemes on 40 points
- Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
- The smallest strictly Neumaier graph and its generalisations
- Mutually unbiased bush-type Hadamard matrices and association schemes
- On the vertex connectivity of Deza graphs
- Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
- More on symplectic graphs modulo \(p^n\)
- On WL-rank and WL-dimension of some Deza dihedrants
- Divisible design graphs
- A general construction of strictly Neumaier graphs and a related switching
- Spectra of quasi-strongly regular graphs
- Deza graphs with parameters (v,k,k−2,a)
- On WL-rank of Deza Cayley graphs
- On WL-rank and WL-dimension of some Deza circulant graphs
- On \(K_{1,3}\)-free strictly Deza graphs
- On Deza graphs with disconnected second neighborhood of a vertex
- Deza graphs on 14, 15 and 16 vertices
- On divisible design Cayley graphs
- Deza graphs with parameters (n,k,k-1,a) and =1
- A generalization of strongly regular graphs
- Strictly Deza line graphs
- Enumeration of strictly Deza graphs with at most 21 vertices
- Singular linear space and its applications
- LDPC codes from Deza graphs
- Subconstituents of orthogonal graphs of odd characteristic - continued
- Orthogonal graphs over Galois rings of odd characteristic
- Symplectic graphs over finite local rings
- Generalised dual Seidel switching and Deza graphs with strongly regular children
- On quasi-strongly regular graphs with parameters \(( n , k , a ; k - 1 , c_2 )\)
- On generalized strongly regular graphs
- Subconstituents of symplectic graphs modulo \(p^n\)
- scientific article; zbMATH DE number 7033505 (Why is no real title available?)
- A Shilla graph with intersection array \(\{12, 10, 2; 1, 2, 8\}\) does not exist
- Integral graphs obtained by dual Seidel switching
- On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs
- The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures
- Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
- scientific article; zbMATH DE number 1998300 (Why is no real title available?)
This page was built for publication: Deza graphs: A generalization of strongly regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718739)
