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

  • 10 - Individual graph descriptions

  • 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 260-381

  • Summary

    In this chapter, we describe the sporadic rank 3 graphs, and further interesting strongly regular graphs that have special properties not shared by the other graphs in the infinite families to which they belong. Part of the information given here was obtained using the computer algebra system GAP and its package GRAPE(with Nauty). Among the listed properties one finds (various) constructions, a discussion of the maximal cliques and cocliques, a table with regular sets arising from a group action,local characterizations, sporadic properties such as connections with Ramsey numbers, chromatic number, p-ranks, decompositions, etc. The chapter has exactly 100 sections, mostly each dealing with an individual graph, but often also discussing a small family of graphs with equally many vertices (ranging from 5 to 531441 vertices). It contains some new geometric and/or combinatorial constructions of a few sporadic (exceptional and extraspecial) rank 3 graphs.