Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 1 - Graphs

  • Andries E. Brouwer, Technische Universiteit Eindhoven, The Netherlands, H. Van Maldeghem, Universiteit Gent, Belgium
  • Book:
    Strongly Regular Graphs
    Published online:
    06 January 2022
    Print publication:
    13 January 2022, pp 1-32

  • Summary

    The first chapter contains the basics of the theory of strongly regular graphs. In particular all basic notions such as parameters and spectrum are rigorously defined. The standard example such as Johnson graphs, Hamming graphs, Paley graphs are introduced. We treat Seidel switching and regular two-graphs, (induced) subgraphs, strongly regular graphs with smallest eigenvalue —2, regular partitions and regular (intriguing) sets. We enumerate the small examples and discuss prolific constructions. This chapter also contains an introduction to two slightly more general objects needed in the book: distance regular graphs (including the main examples, and a discussion on imprimitivity), and association schemes and coherent configurations (including a brief discussion of the Bose-Mesner algebra, linear programming bound, code-clique theorem, Krein parameters, Euclidean representation, subschemas, the absolute bound and the mu-bound).