Affordable Access

The asymptotics of strongly regular graphs

Authors
  • Nikiforov, Vladimir
Type
Preprint
Publication Date
Mar 25, 2004
Submission Date
Mar 25, 2004
Identifiers
arXiv ID: math/0403450
Source
arXiv
License
Unknown
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times