Berlekamp–Van Lint–Seidel graph explained

In graph theory, the Berlekamp–Van Lint–Seidel graph is a locally linear strongly regular graph with parameters

( 243 , 22 , 1 , 2 ) . This means that it has 243 vertices, 22 edges per vertex (for a total of 2673 edges), exactly one shared neighbor per pair of adjacent vertices, and exactly two shared neighbors per pair of non-adjacent vertices. It was constructed by Elwyn Berlekamp, J. H. van Lint, and as the coset graph of the ternary Golay code.

This graph is the Cayley graph of an abelian group. Among abelian Cayley graphs that are strongly regular and have the last two parameters differing by one, it is the only graph that is not a Paley graph. It is also an integral graph, meaning that the eigenvalues of its adjacency matrix are integers. Like the

9 x 9 Sudoku graph it is an integral abelian Cayley graph whose group elements all have order 3, one of a small number of possibilities for the orders in such a graph.

There are five possible combinations of parameters for strongly regular graphs that have one shared neighbor per pair of adjacent vertices and exactly two shared neighbors per pair of non-adjacent vertices. Of these, two are known to exist: the Berlekamp–Van Lint–Seidel graph and the 9-vertex Paley graph with parameters

( 9 , 4 , 1 , 2 ) . Conway's 99-graph problem concerns the existence of another of these graphs, the one with parameters ( 99 , 14 , 1 , 2 ) .

See also

• Games graph