3-empty graph | 2-ladder rung graph | 5-cycle graph | 3-prism graph | 7-circulant graph (1, 2) | 8-circulant graph (1, 2, 4) | 9-circulant graph (1, 2, 3) | 10-circulant graph (1, 2, 4, 5) | 11-circulant graph (1, 2, 3, 4) | 12-circulant graph (1, 2, 3, 4, 6) | 13-circulant graph (1, 2, 3, 4, 5) | 14-circulant graph (1, 2, 3, 4, 6, 7) | 15-circulant graph (1, 2, 3, 4, 5, 6) | 16-circulant graph (1, 2, 3, 4, 5, 6, 8) | 17-circulant graph (1, 2, 3, 4, 5, 6, 7) | 18-circulant graph (1, 2, 3, 4, 5, 6, 8, 9) | 19-circulant graph (1, 2, 3, 4, 5, 6, 7, 8) | 20-circulant graph (1, 2, 3, 4, 5, 6, 7, 8, 10) (total: 18)

(1, 3)-bishop graph | (1, 3)-camel graph | (1, 3)-fiveleaper graph | (1, 3)-giraffe graph | (1, 3)-knight graph | (1, 3)-rook complement graph | (1, 3)-zebra graph | (1, 5)-black bishop graph | (1, 6)-black bishop graph | (1, 6)-white bishop graph | ...

(1, 4)-Knödel graph | 1-Hadamard graph | (2, 1)-bipartite Kneser graph | (2, 2)-bishop graph | (2, 2)-rook complement graph | 2-crown graph | 2-Haar graph | 4-circulant graph (2) | 4-cycle complement graph | 4-edge-transitive graph 6 | ...

(2, 5)-Harary graph | 2-Andrásfai graph | 3-Mycielski graph | (5, 1)-stacked prism graph | (5, 1)-wreath graph | 5-arc transitive graph 1 | 5-circulant graph (1) | 5-circulant graph (2) | 5-cycle complement graph | 5-edge-transitive graph 9 | ...

(2, 3)-lattice graph | (2, 3)-rook graph | (3, 1, 1)-I graph | (3, 1)-generalized Petersen graph | (3, 2)-generalized prism graph | (3, 2)-stacked prism graph | 3-circular ladder graph | 3-symmetric group graph | 6-circulant graph (2, 3) | 6-cubic graph 1 | ...

(4, 7)-Harary graph | 7-circulant graph (1, 3) | 7-circulant graph (2, 3) | 7-cycle complement graph | 7-graph 1024 | 7-vertex transitive graph 3

(5, 8)-Harary graph | 8-circulant graph (2, 3, 4) | 8-cycle complement graph | 8-graph 12312 | 8-quintic graph 2 | 8-vertex transitive graph 11

(6, 9)-Harary graph | (9, 1)-torus triangulation graph | 9-circulant graph (1, 3, 4) | 9-circulant graph (2, 3, 4) | 9-cycle complement graph | 9-graph 274617 | 9-sextic graph 3 | 9-vertex transitive graph 8

10-circulant graph (2, 3, 4, 5) | 10-cycle complement graph | 10-graph 12005084 | 10-septic graph 3 | 10-vertex transitive graph 20

11-circulant graph (1, 2, 3, 5) | 11-circulant graph (1, 2, 4, 5) | 11-circulant graph (1, 3, 4, 5) | 11-circulant graph (2, 3, 4, 5) | 11-cycle complement graph | 11-vertex transitive graph 7 | (8, 11)-Harary graph

12-circulant graph (2, 3, 4, 5, 6) | 12-cycle complement graph | 12-vertex transitive graph 70 | (9, 12)-Harary graph

| vertex count | edge count | connected component count 3-empty graph | 3 | 0 | 3 2-ladder rung graph | 4 | 2 | 2 5-cycle graph | 5 | 5 | 1 3-prism graph | 6 | 9 | 1 7-circulant graph (1, 2) | 7 | 14 | 1 8-circulant graph (1, 2, 4) | 8 | 20 | 1 9-circulant graph (1, 2, 3) | 9 | 27 | 1 10-circulant graph (1, 2, 4, 5) | 10 | 35 | 1 11-circulant graph (1, 2, 3, 4) | 11 | 44 | 1 12-circulant graph (1, 2, 3, 4, 6) | 12 | 54 | 1

Cayley graphs | circulant | claw-free | cycle complement | regular | simple | vertex-transitive | well covered

| complement graph name 3-empty graph | triangle graph 2-ladder rung graph | square graph 5-cycle graph | 5-cycle graph 3-prism graph | 6-cycle graph 7-circulant graph (1, 2) | 7-cycle graph

| dual graph name 3-prism graph | 3-dipyramidal graph