Strongly regular graph on arvau

Wikipedia / Strongly regular graph

In graph theory, a strongly regular graph (SRG) is a regular graph with vertices and degree

every two adjacent vertices have common neighbours, and
every two non-adjacent vertices have common neighbours.

Such a strongly regular graph is denoted by . Its complement graph is also strongly regular: it is an .

If a graph is strongly regular with , then is distance-regular with diameter 2. Likewise, if is strongly regular with , then it is locally linear.

Etymology

A strongly regular graph is denoted as an srg(v, k, λ, μ) in the literature. By convention, graphs which satisfy the definition trivially are excluded from detailed studies and lists of strongly regular graphs. These include the disjoint union of one or more equal-sized complete graphs, and their complements, the complete multipartite graphs with equal-sized independent sets.

Andries Brouwer and Hendrik van Maldeghem (see #References) use an alternate but fully equivalent definition of a strongly regular graph based on spectral graph theory: a strongly regular graph is a finite regular graph that has exactly three eigenvalues, only one of which is equal to the degree k, of multiplicity 1. This automatically rules out fully connected graphs (which have only two distinct eigenvalues, not three) and disconnected graphs (for which the multiplicity of the degree k is equal to the number of different connected components, which would therefore exceed one). Much of the literature, including Brouwer, refers to the larger eigenvalue as r (with multiplicity f) and the smaller one as s (with multiplicity g).

History

Strongly regular graphs were introduced by R.C. Bose in 1963. They built upon earlier work in the 1950s in the then-new field of spectral graph theory.

Examples

The cycle of length 5 is an srg(5, 2, 0, 1).
The Petersen graph is an srg(10, 3, 0, 1).
The Clebsch graph is an srg(16, 5, 0, 2).
The Shrikhande graph is an srg(16, 6, 2, 2) which is not a distance-transitive graph.
The n×n square rook's graph, i.e., the line graph of a balanced complete bipartite graph Kn,n, is an srg(n2, 2n−2, n−2, 2). The parameters for coincide with those of the Shrikhande graph, but the two graphs are not isomorphic. (The vertex neighborhood for the Shrikhande graph is a hexagon, while that for the rook graph is two triangles.)
The line graph of a complete graph Kn.
The three Chang graphs are srg(28, 12, 6, 4), the same as the line graph of K8, but these four graphs are not isomorphic.
Every generalized quadrangle of order (s, t) gives an srg((s + 1)(st + 1), s(t + 1), s − 1, t + 1) as its line graph. For example, GQ(2, 4) gives srg(27, 10, 1, 5) as its line graph.
The Schläfli graph is an srg(27, 16, 10, 8) and is the complement of the aforementioned line graph on GQ(2, 4).
The Hoffman–Singleton graph is an srg(50, 7, 0, 1).
The Gewirtz graph is an srg(56, 10, 0, 2).
The M22 graph aka the Mesner graph is an srg(77, 16, 0, 4).
The Brouwer–Haemers graph is an srg(81, 20, 1, 6).
The Higman–Sims graph is an srg(100, 22, 0, 6).
The Local McLaughlin graph is an srg(162, 56, 10, 24).
The Cameron graph is an srg(231, 30, 9, 3).
The Berlekamp–van Lint–Seidel graph is an srg(243, 22, 1, 2).
The McLaughlin graph is an srg(275, 112, 30, 56).
The Paley graph of order q is an srg(q, (q−1)/2, (q−5)/4, (q−1)/4). The smallest Paley graph, with , is the 5-cycle (above).
Self-complementary arc-transitive graphs are strongly regular.

A strongly regular graph is called primitive if both the graph and its complement are connected. All the above graphs are primitive, as otherwise or .

Conway's 99-graph problem asks for the construction of an srg(99, 14, 1, 2). It is unknown whether a graph with these parameters exists, and John Horton Conway offered a $1000 prize for the solution to this problem.

Triangle-free graphs

The strongly regular graphs with λ=0 are triangle free. Apart from the complete graphs on at most two vertices and all regular complete bipartite graphs, the seven listed earlier (pentagon, Petersen, Clebsch, Hoffman-Singleton, Gewirtz, Mesner-M22, and Higman-Sims) are the only known ones.

Geodetic graphs

is a geodetic graph, a graph in which every two vertices have a unique shortest path. is 0, therefore triangle-free as well. These are called the Moore graphs and are explored below in more detail would have, it is not known whether any more exist or even whether their number is finite. cannot be 1 for such a graph.

Algebraic properties of strongly regular graphs

Basic relationship between parameters

The four parameters in an srg(v, k, λ, μ) are not independent: In order for an srg(v, k, λ, μ) to exist, the parameters must obey the following relation:

The above relation is derived through a counting argument as follows:

Imagine the vertices of the graph to lie in three levels. Pick any vertex as the root, in Level 0. Then its k neighbors lie in Level 1, and all other vertices lie in Level 2.
Vertices in Level 1 are directly connected to the root, hence they must have λ other neighbors in common with the root, and these common neighbors must also be in Level 1. Since each vertex has degree k edges between Level 1 and Level 2.
.
Equating the two expressions for the edges between Level 1 and Level 2, the relation follows.

This relation is a necessary condition for the existence of a strongly regular graph, but not a sufficient condition. For instance, the quadruple (21,10,4,5) obeys this relation, but there does not exist a strongly regular graph with these parameters.

Adjacency matrix equations

Let I denote the identity matrix and let J denote the matrix of ones, both matrices of order v. The adjacency matrix A of a strongly regular graph satisfies two equations.

First:

which is a restatement of the regularity requirement. This shows that k is an eigenvalue of the adjacency matrix with the all-ones eigenvector.

Second:

which expresses strong regularity. The ij-th element of the left hand side gives the number of two-step paths from i to j. The first term of the right hand side gives the number of two-step paths from i back to i, namely k edges out and back in. The second term gives the number of two-step paths when i and j are directly connected. The third term gives the corresponding value when i and j are not connected. Since the three cases are mutually exclusive and collectively exhaustive, the simple additive equality follows.

Conversely, a graph whose adjacency matrix satisfies both of the above conditions and which is not a complete or null graph is a strongly regular graph.

Eigenvalues and graph spectrum

Since the adjacency matrix A is symmetric, it follows that its eigenvectors are orthogonal. We already observed one eigenvector above which is made of all ones, corresponding to the eigenvalue k. Therefore the other eigenvectors x where J is the all-ones matrix as before. Take the previously established equation:

and multiply the above equation by eigenvector x:

Call the corresponding eigenvalue p:

Eliminate x and rearrange to get a quadratic:

. There are thus exactly three eigenvalues for a strongly regular matrix.

Conversely, a connected regular graph with only three eigenvalues is strongly regular.

Following the terminology in much of the strongly regular graph literature, the larger eigenvalue is called r with multiplicity f and the smaller one is called s with multiplicity g.

Since the sum of all the eigenvalues is the trace of the adjacency matrix, which is zero in this case, the respective multiplicities f and g can be calculated:

Eigenvalue k has multiplicity 1.

As the multiplicities must be integers, their expressions provide further constraints on the values of v, k, μ, and λ.

have integer eigenvalues with unequal multiplicities.

are called conference graphs because of their connection with symmetric conference matrices. Their parameters reduce to

. Further, in this case, v must equal the sum of two squares, related to the Bruck–Ryser–Chowla theorem.

Further properties of the eigenvalues and their multiplicities are:

Given an with eigenvalues r and s, its complement has eigenvalues -1-s and -1-r.
if and only if in some order.
.
.

If any of the above conditions are violated for a set of parameters, then there exists no strongly regular graph for those parameters. Brouwer has compiled such lists of existence or non-existence here with reasons for non-existence if any. For example, there exists no srg(28,9,0,4) because that violates one of the Krein conditions and one of the absolute bound conditions.

The Hoffman–Singleton theorem

As noted above, the multiplicities of the eigenvalues are given by

which must be integers.

In 1960, Alan Hoffman and Robert Singleton examined those expressions when applied on Moore graphs, which are strongly regular graphs that have λ = 0 and μ = 1. Such graphs are free of triangles (otherwise λ would exceed zero) and quadrilaterals (otherwise μ would exceed 1), hence they have a girth (smallest cycle length) of 5. Substituting the values of λ and μ, and the eigenvalue multiplicities reduce to

is an integer.

is zero, the possibilities are:

k = 0 and v = 1 yields a trivial graph with one vertex and no edges, and
k = 2 and v = 5 yields the 5-vertex cycle graph, usually drawn as a regular pentagon.

is an integer t. Substituting:

must be an integer, therefore t. In turn:

k = 1 and v = 2 yields a trivial graph of two vertices joined by an edge,
k = 3 and v = 10 yields the Petersen graph,
k = 7 and v = 50 yields the Hoffman–Singleton graph, discovered by Hoffman and Singleton in the course of this analysis, and
k = 57 and v = 3250 famously predicts a graph that has neither been discovered since 1960, nor has its existence been disproven.

The Hoffman-Singleton theorem states that there are no girth-5 Moore graphs except the ones listed above.

Notes

References

Andries Brouwer and Hendrik van Maldeghem (2022), Strongly Regular Graphs. Cambridge: Cambridge University Press. .
A.E. Brouwer, A.M. Cohen, and A. Neumaier (1989), Distance Regular Graphs. Berlin, New York: Springer-Verlag. ,
Chris Godsil and Gordon Royle (2004), Algebraic Graph Theory. New York: Springer-Verlag.