## Abstract

A graph is n-e.c. (n-existentially closed) if for every pair of subsets U, W of the vertex set V of the graph such that U ∩ W = 0 and |U| + |W| = n, there is a vertex v ∈ V - (U ∪ W) such that all edges between v and U are present and no edges between v and W are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices v_{1}, v_{2} ∈ V depends only on whether or not {v_{1}, v_{2}} is an edge in the graph. The only strongly regular graphs that are known to be n-e.c. for large n are the Paley graphs. Recently D. G. Fon-Der-Flaass has found prolific constructions of strongly regular graphs using affine designs. He notes that some of these constructions were also studied by Wallis. By taking the affine designs to be Hadamard designs obtained from Paley tournaments, we use probabilistic methods to show that many non-isomorphic strongly regular n-e.c. graphs of order (q + 1)^{2} exist whenever q ≥ 16n^{2}2^{2n} is a prime power such that q ≡ 3 (mod 4).

Original language | English |
---|---|

Pages (from-to) | 1-12 |

Number of pages | 12 |

Journal | Electronic Journal of Combinatorics |

Volume | 9 |

Issue number | 1 R |

Publication status | Published - 1 Dec 2002 |