This means that it has 231 vertices, 30 edges per vertex, 9 triangles per edges, and 3 two-edge paths between every two non-adjacent vertices.

In this construction, the 231 vertices of the graph correspond to the 231 unordered pairs of elements.

Two vertices are adjacent whenever they come from two disjoint pairs whose union belongs to one of the blocks.

[1] It is one of a small number of strongly regular graphs on which the Mathieu group M22 acts as symmetries taking every vertex to every other vertex.

This graph theory-related article is a stub.