TOPICS
Search

Conference Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

A conference graph is a strongly regular graph associated with a symmetric C-matrix.

A strongly regular graph is a conference graph iff it has regular parameters (nu,k,lambda,mu) satisfying k=(nu-1)/2, lambda=(nu-5)/4, and mu=(mu-1)/4.

The vertex count nu of a conference graph must be 1 (mod 4) and a sum of two squares.

If G is a strongly regular graph with nu=p vertices where p is a prime number, then G is a conference graph (Godsil and Royle 2001, p. 222).

All Paley graphs are conference graphs, as are all Peisert graphs.

A strongly regular graph with parameters (nu,k,lambda,mu) has graph eigenvalues k, theta, and tau, where

theta=((lambda-mu)+sqrt(Delta))/2
(1)
tau=((lambda-mu)-sqrt(Delta))/2,
(2)

where

Delta=(lambda-mu)^2+4(k-mu)
(3)

(Godsil and Royle 2001, pp. 221-222). In the case of theta and tau distinct, call their multiplicities in the graph spectrum m_theta and m_tau. Then a graph with m_theta=m_tau is called a conference graph.

A strongly regular graph is either a conference graph, has theta and tau integers and theta-tau a square number (correcting a typo in Godsil and Royle 2001, p. 222), or both of the above (Godsil and Royle 2001, p. 222). Paley graphs P(q) with q a square number (including the (2,1)-generalized quadrangle, which is isomorphic to the 9-Paley graph) satisfy both conditions.

The following table summarizes some conference graphs.

ngraph(n,k,a,c)characteristic polynomial
55-cycle graph(5,2,0,1)(x-2)(x^2+x-1)^2
9(2,1)-generalized quadrangle(9,4,1,2)(x-4)(x-1)^4(x+2)^4
1313-Paley graph(13,6,2,3)(x-6)(x^2+x-3)^6
1717-Paley graph(17,8,3,4)(x-8)(x^2+x-4)^8
2525-Paley graph(25,12,5,6)(x-12)(x-2)^(12)(x+3)^(12)
2525-Paley graph(25,12,5,6)(x-12)(x-2)^(12)(x+3)^(12)
2525-Paulus graph 1-14(25,12,5,6)(x-12)(x-2)^(12)(x+3)^(12)
2929-Paley graph(29,14,6,7)(x-14)(x^2+x-7)^(14)
3737-Paley graph(37,18,8,9)(x-18)(x^2+x-9)^(18)
4141-Paley graph(41,20,9,10)(x-20)(x^2+x-10)^(20)
4949-Paley graph(49,24,11,12)(x-24)(x-3)^(24)(x+4)^(24)
5353-Paley graph(53,26,12,13)(x-26)(x^2+x-13)^(26)
6161-Paley graph(61,30,14,15)(x-30)(x^2+x-15)^(30)
7373-Paley graph(73,36,17,18)(x-36)(x^2+x-18)^(36)
8181-Paley graph(81,40,19,20)(x-40)(x-4)^(40)(x+5)^(40)
8989-Paley graph(89,44,21,22)(x-44)(x^2+x-22)^(44)
9797-Paley graph(97,48,23,24)(x-48)(x^2+x-24)^(48)
101101-Paley graph(101,50,24,25)(x-50)(x^2+x-25)^(50)
109109-Paley graph(109,54,26,27)(x-54)(x^2+x-27)^(54)
113113-Paley graph(113,56,27,28)(x-56)(x^2+x-28)^(56)
121121-Paley graph(121,60,29,30)(x-60)(x-5)^(60)(x+6)^(60)
125125-Paley graph(125,62,30,31)(x-62)(x^2+x-31)^(62)
137137-Paley graph(137,68,33,34)(x-68)(x^2+x-34)^(68)
149149-Paley graph(149,74,36,37)(x+74)(x^2+x-37)^(74)
157157-Paley graph(157,78,38,39)(x-78)(x^2+x-39)^(78)
169169-Paley graph(169,84,41,42)(x-84)(x-6)^(84)(x+7)^(84)

See also

C-Matrix, Graph Eigenvalue, Graph Spectrum, Paley Graph, Paulus Graphs, Peisert Graph, Strongly Regular Graph

Explore with Wolfram|Alpha

References

Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance Regular Graphs. New York: Springer-Verlag, 1989.Godsil, C. and Royle, G. Algebraic Graph Theory. New York: Springer-Verlag, p. 222, 2001.House of Graphs. Conference Graphs. C5, K3 square K3 (Paley graph), Circulant C13 (1,3,4) (Paley graph), Circulant C17 (1,2,4,8) (Paley graph), 25-Paley graph, Circulant C29 (1,4,5,6,7,9,13), Circulant C37 (1,3,4,7,9,10,11,12,16), Circulant C41 (1,2,4,5,8,9,10,16,18,20), and 49-Paley graph.

Referenced on Wolfram|Alpha

Conference Graph

Cite this as:

Weisstein, Eric W. "Conference Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ConferenceGraph.html

Subject classifications