Strongly regular n-e.c. graphs

Details Strongly regular n-e.c. graphs Strongly regular n-e.c. graphs

2011-03-14

arxiv.org/abs/1103.2572v2

Mathematics

Combinatorics

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Strongly regular n-e.c. graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strongly regular n-e.c. graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strongly regular n-e.c. graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258868