The Gray graph
|Named after||Marion Cameron Gray|
In the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three edges. It was discovered by Marion C. Gray in 1932 (unpublished), then discovered independently by Bouwer 1968 in reply to a question posed by Jon Folkman 1967. The Gray graph is interesting as the first known example of a cubic graph having the algebraic property of being edge but not vertex transitive (see below).
The Gray graph can be constructed (Bouwer 1972) from the 27 points of a 3×3×3 grid and the 27 axis-parallel lines through these points. This collection of points and lines forms a projective configuration: each point has exactly three lines through it, and each line has exactly three points on it. The Gray graph is the Levi graph of this configuration; it has a vertex for every point and every line of the configuration, and an edge for every pair of a point and a line that touch each other. This construction generalizes (Bouwer 1972) to any dimension n ≥ 3, yielding an n-valent Levi graph with algebraic properties similar to those of the Gray graph. In (Monson,Pisanski,Schulte,Ivic-Weiss 2007), the Gray graph appears as a different sort of Levi graph for the edges and triangular faces of a certain locally toroidal abstract regular 4-polytope. It is therefore the first in an infinite family of similarly constructed cubic graphs.
Marušič and Pisanski (2000) give several alternative methods of constructing the Gray graph. As with any bipartite graph, there are no odd-length cycles, and there are also no cycles of four or six vertices, so the girth of the Gray graph is 8. The simplest oriented surface on which the Gray graph can be embedded has genus 7 (Marušič, Pisanski & Wilson 2005).
The automorphism group of the Gray graph is a group of order 1296. It acts transitively on the edges the graph but not on its vertices : there are symmetries taking every edge to any other edge, but not taking every vertex to any other vertex. The vertices that correspond to points of the underlying configuration can only be symmetric to other vertices that correspond to points, and the vertices that correspond to lines can only be symmetric to other vertices that correspond to lines. Therefore, the Gray graph is a semi-symmetric graph, the smallest possible cubic semi-symmetric graph.
The characteristic polynomial of the Gray graph is
- Bouwer, I. Z. (1968), "An edge but not vertex transitive cubic graph", Bulletin of the Canadian Mathematical Society 11: 533–535, doi:10.4153/CMB-1968-063-0.
- Bouwer, I. Z. (1972), "On edge but not vertex transitive regular graphs", Journal of Combinatorial Theory, Series B 12: 32–40, doi:10.1016/0095-8956(72)90030-5.
- Folkman, J. (1967), "Regular line-symmetric graphs", Journal of Combinatorial Theory 3 (3): 533–535, doi:10.1016/S0021-9800(67)80069-3.
- Marušič, Dragan; Pisanski, Tomaž (2000), "The Gray graph revisited", Journal of Graph Theory 35: 1–7, doi:10.1002/1097-0118(200009)35:1<1::AID-JGT1>3.0.CO;2-7.
- Marušič, Dragan; Pisanski, Tomaž; Wilson, Steve (2005), "The genus of the Gray graph is 7", European Journal of Combinatorics 26 (3–4): 377–385, doi:10.1016/j.ejc.2004.01.015.
- Monson, B.; Pisanski, T.; Schulte, E.; Ivic-Weiss, A. (2007), "Semisymmetric Graphs from Polytopes", Journal of Combinatorial Theory, Series A 114 (3): 421–435, doi:10.1016/j.jcta.2006.06.007