An octic graph is a regular graph of vertex degree eight. The numbers of connected simple octic graphs on 
, 10, 11, ... nodes, counted
up to graph isomorphism, are 1, 1, 6, 94, 10786,
3459386, ... (OEIS A014378). Examples are illustrated
above and summarized in the following table.
graph  |  |
complete
graph  | 9 |
cocktail
party graph  | 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 |
