Strongly Regular Graphs

Authored by: Andries E. Brouwer

Handbook of Combinatorial Designs

Print publication date:  November  2006
Online publication date:  November  2006

Print ISBN: 9781584885061
eBook ISBN: 9781420010541
Adobe ISBN:

10.1201/9781420010541-110

 Download Chapter

 

Abstract

11.1

A strongly regular graph with parameters (v, k, λ, p) is a finite graph on v vertices, without loops or multiple edges, regular of degree k (with 0 < k < v − 1, so that there are both edges and nonedges), and such that any two distinct vertices have λ common neighbors when they are adjacent, and μ common neighbors when they are nonadjacent.

 Cite
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.