Strongly regular graph

In graph theory, a strongly regular graph is defined as follows. Let G = (V, E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there are also integers λ and μ such that:

Every two adjacent vertices have λ common neighbours.
Every two non-adjacent vertices have μ common neighbours.

The Paley graph of order 13, a strongly regular graph with parameters srg(13,6,2,3).

A graph of this kind is sometimes said to be an srg(v, k, λ, μ). Strongly regular graphs were introduced by Raj Chandra Bose in 1963.[1]

Some authors exclude graphs which satisfy the definition trivially, namely those graphs which are the disjoint union of one or more equal-sized complete graphs,[2][3] and their complements, the complete multipartite graphs with equal-sized independent sets.

The complement of an srg(v, k, λ, μ) is also strongly regular. It is an srg(v, v−k−1, v−2−2k+μ, v−2k+λ).

A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ is one.

Properties

Relationship between Parameters

The four parameters in an srg(v, k, λ, μ) are not independent and must obey the following relation:

(v-k-1)\mu =k(k-\lambda -1)

The above relation can be derived very easily 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, there are $k-\lambda -1$ edges remaining for each Level 1 node to connect to nodes in Level 2. Therefore, there are $k\times (k-\lambda -1)$ edges between Level 1 and Level 2.
Vertices in Level 2 are not directly connected to the root, hence they must have μ common neighbors with the root, and these common neighbors must all be in Level 1. There are $(v-k-1)$ vertices in Level 2, and each is connected to μ nodes in Level 1. Therefore the number of edges between Level 1 and Level 2 is $(v-k-1)\times \mu$ .
Equating the two expressions for the edges between Level 1 and Level 2, the relation follows.

Adjacency Matrix

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:

AJ=JA=kJ,

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

{A}^{2}=k{I}+\lambda {A}+\mu ({J-I-A})

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 RHS gives the number of self-paths from i 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.[4]

Eigenvalues

The adjacency matrix of the graph has exactly three eigenvalues:

k, whose multiplicity is 1 (as seen above)
${\frac {1}{2}}\left[(\lambda -\mu )+{\sqrt {(\lambda -\mu )^{2}+4(k-\mu )}}\right],$ whose multiplicity is ${\frac {1}{2}}\left[(v-1)-{\frac {2k+(v-1)(\lambda -\mu )}{\sqrt {(\lambda -\mu )^{2}+4(k-\mu )}}}\right]$
${\frac {1}{2}}\left[(\lambda -\mu )-{\sqrt {(\lambda -\mu )^{2}+4(k-\mu )}}\right],$ whose multiplicity is ${\frac {1}{2}}\left[(v-1)+{\frac {2k+(v-1)(\lambda -\mu )}{\sqrt {(\lambda -\mu )^{2}+4(k-\mu )}}}\right]$

As the multiplicities must be integers, their expressions provide further constraints on the values of v, k, μ, and λ, related to the so-called Krein conditions.

Strongly regular graphs for which $2k+(v-1)(\lambda -\mu )=0$ are called conference graphs because of their connection with symmetric conference matrices. Their parameters reduce to

{\text{srg}}\left(v,{\tfrac {1}{2}}(v-1),{\tfrac {1}{4}}(v-5),{\tfrac {1}{4}}(v-1)\right).

Strongly regular graphs for which $2k+(v-1)(\lambda -\mu )\neq 0$ have integer eigenvalues with unequal multiplicities.

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

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 K_n,n, is an srg(n², 2n − 2, n − 2, 2). The parameters for n=4 coincide with those of the Shrikhande graph, but the two graphs are not isomorphic.
The line graph of a complete graph K_n is an srg( ${\binom {n}{2}},2(n-2),n-2,4$ ).
The Chang graphs are srg(28, 12, 6, 4), the same as the line graph of K₈, but these four graphs are not isomorphic.
The line graph of a generalized quadrangle GQ(2, 4) is an srg(27, 10, 1, 5). In fact every generalized quadrangle of order (s, t) gives a strongly regular graph in this way: to wit, an srg((s+1)(st+1), s(t+1), s-1, t+1).
The Schläfli graph is an srg(27, 16, 10, 8).[6]
The Hoffman–Singleton graph is an srg(50, 7, 0, 1).
The Sims-Gewirtz graph is an (56, 10, 0, 2).
The M22 graph aka 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 q=5, 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 μ=0 or λ=k.

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 has offered a $1000 prize for the solution to this problem.[7]

Moore graphs

The strongly regular graphs with λ = 0 are triangle free. Apart from the complete graphs on less than 3 vertices and all complete bipartite graphs the seven listed above (pentagon, Petersen, Clebsch, Hoffman-Singleton, Gewirtz, Mesner-M22, and Higman-Sims) are the only known ones. Strongly regular graphs with λ = 0 and μ = 1 are Moore graphs with girth 5. Again the three graphs given above (pentagon, Petersen, and Hoffman-Singleton), with parameters (5, 2, 0, 1), (10, 3, 0, 1) and (50, 7, 0, 1), are the only known ones. The only other possible set of parameters yielding a Moore graph is (3250, 57, 0, 1); it is unknown if such a graph exists, and if so, whether or not it is unique.

Notes

https://projecteuclid.org/euclid.pjm/1103035734, R. C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math 13 (1963) 389–419. (p. 122)
Brouwer, Andries E; Haemers, Willem H. Spectra of Graphs. p. 101 Archived 2012-03-16 at the Wayback Machine
Godsil, Chris; Royle, Gordon. Algebraic Graph Theory. Springer-Verlag New York, 2001, p. 218.
Cameron, P.J.; van Lint, J.H. (1991), Designs, Graphs, Codes and their Links, London Mathematical Society Student Texts 22, Cambridge University Press, p. 37, ISBN 978-0-521-42385-4
Godsil, Chris; Royle, Gordon. Algebraic Graph Theory. Springer-Verlag, New York, 2001, Lemma 10.2.1.
Weisstein, Eric W. "Schläfli graph". MathWorld.
Conway, John H., Five $1,000 Problems (Update 2017) (PDF), Online Encyclopedia of Integer Sequences, retrieved 2019-02-12

References

A.E. Brouwer, A.M. Cohen, and A. Neumaier (1989), Distance Regular Graphs. Berlin, New York: Springer-Verlag. ISBN 3-540-50619-5, ISBN 0-387-50619-5
Chris Godsil and Gordon Royle (2004), Algebraic Graph Theory. New York: Springer-Verlag. ISBN 0-387-95241-1

External links

Eric W. Weisstein, Mathworld article with numerous examples.
Gordon Royle, List of larger graphs and families.
Andries E. Brouwer, Parameters of Strongly Regular Graphs.
Brendan McKay, Some collections of graphs.
Ted Spence, Strongly regular graphs on at most 64 vertices.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] ttps://projecteuclid.org/euclid.pjm/1103035734, R. C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math 13 (1963) 389–419. (p. 122)

[2] Brouwer, Andries E; Haemers, Willem H. Spectra of Graphs. p. 101 Archived 2012-03-16 at the Wayback Machine

[3] Godsil, Chris; Royle, Gordon. Algebraic Graph Theory. Springer-Verlag New York, 2001, p. 218.

[4] Cameron, P.J.; van Lint, J.H. (1991), Designs, Graphs, Codes and their Links, London Mathematical Society Student Texts 22, Cambridge University Press, p. 37, ISBN 978-0-521-42385-4

[5] Godsil, Chris; Royle, Gordon. Algebraic Graph Theory. Springer-Verlag, New York, 2001, Lemma 10.2.1.

[6] Weisstein, Eric W. "Schläfli graph". MathWorld.

[7] Conway, John H., Five $1,000 Problems (Update 2017) (PDF), Online Encyclopedia of Integer Sequences, retrieved 2019-02-12

Graph families defined by their automorphisms
distance-transitive	→	distance-regular	←	strongly regular
↓
symmetric (arc-transitive)	←	t-transitive, $t \geq 2$		skew-symmetric
↓
_{(if connected)} vertex- and edge-transitive	→	edge-transitive and regular	→	edge-transitive
↓		↓		↓
vertex-transitive	→	regular	→	_{(if bipartite)} biregular
↑
Cayley graph	←	zero-symmetric		asymmetric