The asymptotics of strongly regular graphs

Details The asymptotics of strongly regular graphs The asymptotics of strongly regular graphs

2004-03-25

arxiv.org/abs/math/0403450v1

Mathematics

Combinatorics

Scientific paper

A strongly regular graph is called trivial if it or its complement is a union
of disjoint cliques. We prove that every infinite family of nontrivial strongly
regular graphs is quasi-random in the sense of Chung, Graham and Wilson.

Affiliated with

Also associated with

No associations

Rating

The asymptotics of strongly regular 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 The asymptotics of strongly regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The asymptotics of strongly regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-383549