Octic Graph
OcticGraphs
An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are illustrated above and summarized in the following table.
graph G |V(G)|
complete
graph K_9 9
cocktail
party graph K_(5×2) 10
(8,6)-cone
graph 14
6-triangular
graph 15
complete
bipartite graph (8,8) 16
17-Paley graph 17
9-crown graph 18
24-cell graph 24
(25,8,3,2)-strongly
regular graph 1 25
line graph of the icosahedral
graph 30
generalized
hexagon (4,1) 105
generalized hexagon (1,7) 114
8-hypercube graph 256
(8,8)-cage
graph 800
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 A014378 in "The On-Line Encyclopedia of Integer Sequences."Referenced on Wolfram|Alpha
Octic GraphCite this as:
Weisstein, Eric W. "Octic Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OcticGraph.html