Misplaced Pages

Berlekamp–Van Lint–Seidel graph

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Berlekamp–van Lint–Seidel graph)
Two drawings of the Berlekamp–Van Lint–Seidel graph

In graph theory, the Berlekamp–Van Lint–Seidel graph is a locally linear strongly regular graph with parameters ( 243 , 22 , 1 , 2 ) {\displaystyle (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 Johan Jacob Seidel [de] 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 × 9 {\displaystyle 9\times 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 ) {\displaystyle (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 ) {\displaystyle (99,14,1,2)} .

See also

References

  1. Berlekamp, E. R.; Van Lint, J. H.; Seidel, J. J. (1973), "A strongly regular graph derived from the perfect ternary Golay code" (PDF), A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), Amsterdam: North-Holland: 25–30, doi:10.1016/B978-0-7204-2262-7.50008-9, ISBN 9780720422627, MR 0364015
  2. Arasu, K. T.; Jungnickel, D.; Ma, S. L.; Pott, A. (1994), "Strongly regular Cayley graphs with λ − μ = − 1 {\displaystyle \lambda -\mu =-1} ", Journal of Combinatorial Theory, Series A, 67 (1): 116–125, doi:10.1016/0097-3165(94)90007-8, MR 1280602
  3. Weisstein, Eric W., "Berlekamp–Van Lint-Seidel Graph", MathWorld
  4. Klotz, Walter; Sander, Torsten (2010), "Integral Cayley graphs over abelian groups", Electronic Journal of Combinatorics, 17 (1): Research Paper 81, 13pp, doi:10.37236/353, MR 2651734
  5. Makhnev, A. A.; Minakova, I. M. (January 2004), "On automorphisms of strongly regular graphs with parameters λ = 1 {\displaystyle \lambda =1} , μ = 2 {\displaystyle \mu =2} ", Discrete Mathematics and Applications, 14 (2), doi:10.1515/156939204872374, MR 2069991, S2CID 118034273
  6. Conway, John H., Five $1,000 Problems (Update 2017) (PDF), Online Encyclopedia of Integer Sequences, retrieved 2019-02-12
Categories: