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

  • 11 - Classification of rank 3 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 382-398

  • Summary

    The classification of rank 3 graphs is due to Foulser-Kallaher-Kantor-Liebler-Liebeck- Saxl and others. We describe that result in this chapter. We provide the relevant group-theoretic theorems (without proof) and identify all graphs that appear with graphs that were mentioned (and in most cases explicitly constructed) in previous chapters. This way, we give all pairs (Γ,), with Γ a strongly regular graph and 𝐺 a group of automorphisms of Γ acting rank 3. We also provide a table of the parameters of the sporadic rank 3 graphs, which have up to 531441 vertices, and a similar table for all rank 3 graphs up to 1024 vertices. Finally, we tabulate small primitive rank 4–10 strongly regular graphs which do not have Latin square parameters.