Deza graphs: A generalization of strongly regular graph

DOI<395::AID-JCD1>3.0.CO;2-U 10.1002/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.0.CO;2-UzbMath0959.05122OpenAlexW1999732815MaRDI QIDQ4718739

No author found.

Publication date: 2 May 2001

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1999)7:6<395::aid-jcd1>3.0.co;2-u

zbMATH Keywords

strongly regular graphsdistanceadjacencyDeza graphcommon neighborhood

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (47)

Minimum arc-cuts of normally regular digraphs and Deza digraphs ⋮ On the second neighbourhoods of quasi-strongly regular graphs ⋮ Divisible design graphs with parameters \((4n,n+2,n-2,2,4,n)\) and \((4n,3n-2,3n-6,2n-2,4,n)\) ⋮ Subconstituents of symplectic graphs modulo \(p^n\) ⋮ Spectra of Deza graphs ⋮ Claw-free strictly Deza graphs ⋮ On Deza graphs with disconnected second neighborhood of a vertex ⋮ On \(K_{1,3}\)-free strictly Deza graphs ⋮ On WL-rank of Deza Cayley graphs ⋮ On generalized strongly regular graphs ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ Spectra of quasi-strongly regular graphs ⋮ On quasi-strongly regular graphs with parameters \((n, k, a; k-2, c_2)\). I ⋮ More on symplectic graphs modulo \(p^n\) ⋮ Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs ⋮ Deza graphs with parameters (v,k,k−2,a) ⋮ Integral graphs obtained by dual Seidel switching ⋮ Divisible design graphs ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Subconstituents of orthogonal graphs of odd characteristic - continued ⋮ Singular linear space and its applications ⋮ Orthogonal graphs over Galois rings of odd characteristic ⋮ Subconstituents of symplectic graphs ⋮ On the vertex connectivity of Deza graphs ⋮ Strictly Deza line graphs ⋮ On quasi-strongly regular graphs with parameters \(( n , k , a ; k - 1 , c_2 )\) ⋮ Generalised dual Seidel switching and Deza graphs with strongly regular children ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Spectra of strongly Deza graphs ⋮ Deza digraphs. II. ⋮ Deza digraphs ⋮ Deza graphs based on symplectic spaces ⋮ Symplectic graphs over finite local rings ⋮ On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph ⋮ On divisible design Cayley graphs ⋮ Mutually unbiased bush-type Hadamard matrices and association schemes ⋮ On WL-rank and WL-dimension of some Deza circulant graphs ⋮ A Shilla graph with intersection array \(\{12, 10, 2; 1, 2, 8\}\) does not exist ⋮ Enumeration of strictly Deza graphs with at most 21 vertices ⋮ Deza graphs with parameters and ⋮ Higmanian rank-5 association schemes on 40 points ⋮ On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs ⋮ On strictly Deza graphs with parameters \((n, k, k - 1, a)\) ⋮ Unnamed Item ⋮ On quasi-strongly regular graphs ⋮ On extendability of Deza graphs with diameter 2

Cites Work

• Unnamed Item
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)]

This page was built for publication: Deza graphs: A generalization of strongly regular graph