A prolific construction of strongly regular graphs with the n-e. c. property
From MaRDI portal
Publication:698603
zbMATH Open1006.05065MaRDI QIDQ698603FDOQ698603
Authors: Peter J. Cameron, Dudley Stark 
Publication date: 22 September 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122390
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- The search for N-e.c. Graphs
- Adjacency properties of graphs and a conjecture of Erdős
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
Cited In (19)
- Binary Covering Arrays and Existentially Closed Graphs
- Random strongly regular graphs?
- Title not available (Why is that?)
- Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs
- Strongly regular graphs with the \(7\)-vertex condition
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- Existentially closed graphs via permutation polynomials over finite fields
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- The smallest strictly Neumaier graph and its generalisations
- Adjacency properties of graphs and a conjecture of Erdős
- Random strongly regular graphs?
- The search for N-e.c. Graphs
- Triply existentially complete triangle-free graphs
- On an adjacency property of almost all tournaments
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Existential closure of block intersection graphs of infinite designs having infinite block size
- Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
- A strongly regular \(n\)-full graph of small order
This page was built for publication: A prolific construction of strongly regular graphs with the \(n\)-e. c. property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698603)
