TOPICS
Search

Cameron-Montanaro-Newman-Severini-Winter Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook
CameronMontanaroNewmanSeveriniWinterGraph

The Cameron-Montanaro-Newman-Severini-Winter graph is the 18-vertex, 44-edge graph introduced by Cameron et al. (2007) in their study of the quantum chromatic number. It is the orthogonality graph of 18 vectors in R^4, with two vertices adjacent when the corresponding vectors are orthogonal.

The graph has ordinary chromatic number 5 but quantum chromatic number 4 (Cameron et al. 2007). It is Hamiltonian, nonplanar, and pancyclic.

The Cameron-Montanaro-Newman-Severini-Winter graph will be implemented in a future version of the Wolfram Language as GraphData["CameronMontanaroNewmanSeveriniWinterGraph"].

It should not be confused with the Cameron graph, the 231-vertex strongly regular graph, or with the Cameron cubic Hamiltonian graphs constructed by Kathleen Cameron.

See also

Cameron Cubic Hamiltonian Graphs, Cameron Graph, Chromatic Number, Graph Coloring, Lalonde Graph, Quantum Chromatic Number, Vertex Coloring

Explore with Wolfram|Alpha

References

Cameron, P. J.; Montanaro, A.; Newman, M. W.; Severini, S.; and Winter, A. "On the Quantum Chromatic Number of a Graph." Elec. J. Combin. 14, No. 1, R81, 2007. https://doi.org/10.37236/999.

Cite this as:

Weisstein, Eric W. "Cameron-Montanaro-Newman-Severini-Winter Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Cameron-Montanaro-Newman-Severini-WinterGraph.html

Subject classifications