TOPICS
Search

Conway-Smith Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted Gamma^((2)) by Hall (1980), and 3 sym(7) by Brouwer et al. (1989, p. 224). It is weakly regular with parameters (n,k,lambda,mu)=(63,(10),(3),(0,2).

It is an integral graph with graph spectrum (-4)^6(-2)^(30)1^(14)5^(12)10^1. It is a weakly regular graph with parameters (63,(10),(3),(0,2)).

It is one of the three locally Petersen graphs (Hall 1980).

It it implemented in the Wolfram Language as GraphData["ConwaySmithGraph"].

See also

Distance-Transitive Graph, Hall Graph, Locally Petersen Graph

Explore with Wolfram|Alpha

References

Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. "The Conway-Smith Graph for 3-Sym(7)." §13.2B in Distance Regular Graphs. New York: Springer-Verlag, pp. 37, 224, and 399, 1989.DistanceRegular.org. "Conway-Smith Graph." http://www.distanceregular.org/graphs/conway-smith.html.Hall, J. I. "Locally Petersen Graphs." J. Graph Th. 4, 173-187, 1980.Smith, S. D. "Nonassociative Commutative Algebras for Triple Covers of 3-Transposition Groups." Mich. Math. J. 24, 372-287, 1977.

Cite this as:

Weisstein, Eric W. "Conway-Smith Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Conway-SmithGraph.html

Subject classifications