Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Strongly regular n-e.c. graphs   A result of Erd\"os and R\'enyi shows that for a fixed integer n almost all
graphs satisfy the n-e.c. adjacency property. However, there are few explicit
constructions of n e.c. graphs for n > 2, and almost all known families of
n-e.c. graphs are strongly regular graphs. In this paper we derive parameter
bounds on strongly regular n-e.c. graphs constructed from the point sets of
partial geometries. This work generalizes bounds on n-e.c. block intersection
graphs of balanced incomplete block designs given by McKay and Pike. It also
relates to work by Griggs, Grannel, and Forbes' determining 3-e.c. graphs that
are block intersection graphs of Steiner triple systems. In addition to these
bounds, we give examples of strongly regular graphs that contain every possible
subgraph of small order but are not n-e.c. for n > 2.

29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th