A prolific construction of strongly regular graphs with the \(n\)-e. c. property

zbMath1006.05065MaRDI QIDQ698603

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

zbMATH Keywords

Hadamard designsPaley graphsaffine designsPaley tournaments

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (12)

Cubic and quadruple Paley graphs with the \(n\)-e.c. property ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ On an adjacency property of almost all tournaments ⋮ Graphs with the \(n\)-e.c. adjacency property constructed from affine planes ⋮ Graphs with then-e.c. adjacency property constructed from resolvable designs ⋮ Random strongly regular graphs? ⋮ Random strongly regular graphs? ⋮ Existential closure of block intersection graphs of infinite designs having infinite block size ⋮ Triply Existentially Complete Triangle‐Free Graphs ⋮ Strongly regular graphs with the \(7\)-vertex condition

This page was built for publication: A prolific construction of strongly regular graphs with the \(n\)-e. c. property