Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
zbMATH Open0955.05068MaRDI QIDQ1591740FDOQ1591740
Authors: Anthony Bonato, W. H. Holzmann, H. Kharaghani 
Publication date: 9 January 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120786
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
- The search for N-e.c. Graphs
- scientific article; zbMATH DE number 2061960
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cited In (8)
- A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
- Binary Covering Arrays and Existentially Closed Graphs
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
- Further results on existentially closed graphs arising from block designs
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Entanglement entropy in the spinless free fermion model and its application to the graph isomorphism problem
- Bordered Complex Hadamard Matrices and Strongly Regular Graphs
This page was built for publication: Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591740)
