Sextic Graph
SexticGraphs
A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are illustrated above and summarized in the following table.
graph G |V(G)|
7-complete
graph 7
16-cell
graph 8
(6,4)-cone
graph 10
5-triangular
graph 10
complete
bipartite graph (6,6) 12
13-Paley graph 13
7-crown graph 14
generalized quadrangle
(2,2) 15
(16,6,2,2)-strongly regular graph 1 16
(6,5)-cage graph 40
Hoffman-Singleton graph minus
star 42
generalized
hexagon (3,1) 52
Perkel graph 57
generalized hexagon (1,5) 62
6-hypercube
graph 64
(6,8)-cage graph 312
6-odd graph 462
See also
Regular GraphExplore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Meringer, M. "Connected Regular Graphs." http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html#CRG.Sloane, N. J. A. Sequence A006822 in "The On-Line Encyclopedia of Integer Sequences."Referenced on Wolfram|Alpha
Sextic GraphCite this as:
Weisstein, Eric W. "Sextic Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SexticGraph.html