The McGee graph
|Named after||W. F. McGee|
The McGee graph requires at least eight crossings in any drawing of it in the plane. It is one of five non-isomorphic graphs tied for being the smallest cubic graph that requires eight crossings. Another of these five graphs is the generalized Petersen graph G(12,5), also known as the Nauru graph.
The characteristic polynomial of the McGee graph is : .
The automorphism group of the McGee graph is of order 32 and doesn't acts transitively upon its vertices: there are two vertex orbits, of lengths 8 and 16. The McGee graph is the smallest cubic cage that is not a vertex-transitive graph.
The crossing number of the McGee graph is 8.
The chromatic number of the McGee graph is 3.
The chromatic index of the McGee graph is 3.
The acyclic chromatic number of the McGee graph is 3.
- Weisstein, Eric W., "McGee Graph", MathWorld.
- Kárteszi, F. "Piani finit ciclici come risoluzioni di un certo problemo di minimo." Boll. Un. Mat. Ital. 15, 522-528, 1960
- McGee, W. F. "A Minimal Cubic Graph of Girth Seven." Canad. Math. Bull. 3, 149-152, 1960
- Tutte, W. T. Connectivity in Graphs. Toronto, Ontario: University of Toronto Press, 1966
- Wong, P. K. "Cages--A Survey." J. Graph Th. 6, 1-22, 1982
- Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance Regular Graphs. New York: Springer-Verlag, p. 209, 1989
- "Sloane's A110507 ", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- Pegg, E. T.; Exoo, G. (2009), "Crossing number graphs", Mathematica Journal 11.
- Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 237, 1976.