singleton graph | 2-path graph | square graph | cubical graph | tesseract graph | 5-hypercube graph | 6-hypercube graph | 7-hypercube graph | 8-hypercube graph | 9-hypercube graph | 10-hypercube graph (total: 11)

0-hypercube graph | 0-triangular grid graph | (1, 0)-permutation star graph | (1, 1, 1, 1)-grid graph | (1, 1, 1)-grid graph | (1, 1)-antelope graph | (1, 1)-bishop graph | (1, 1)-black bishop graph | (1, 1)-camel graph | (1, 1)-fiveleaper graph | ...

(1, 1, 2)-grid graph | (1, 1)-bipartite (0, 2)-graph | (1, 1)-complete bipartite graph | (1, 1)-Sierpiński simplex graph | (1, 1)-stacked book graph | (1, 2)-bar graph | (1, 2)-Hamming graph | (1, 2)-king graph | (1, 2)-Knödel graph | (1, 2)-lattice graph | ...

(1, 2, 2)-grid graph | (1, 2)-stacked book graph | (1, 4, 1)-honeycomb toroidal graph | (1, 4, 3)-honeycomb toroidal graph | 1-book graph | 1-polyomino graph 1 | (2, 1)-bipartite (0, 2)-graph | (2, 1)-Goethals-Seidel block design graph | (2, 2)-bar graph | (2, 2)-complete 2-partite graph | ...

11-Haar graph | 13-Haar graph | 14-Haar graph | (1, 8, 3)-honeycomb toroidal graph | (1, 8, 5)-honeycomb toroidal graph | (2, 2, 2)-grid graph | (2, 4, 2)-honeycomb toroidal graph | (2, 4, 4)-honeycomb toroidal graph | (2, 4)-rook complement graph | 2-polygonal bigraph | ...

16-arc transitive graph 3 | 16-edge transitive graph 8 | 16-vertex transitive graph 21 | (2, 2, 2, 2)-grid graph | (4, 2)-bipartite (0, 2)-graph | (4, 2)-Hamming graph | (4, 4)-torus grid graph | 4-Hadamard graph | 4-hypercube graph | 8-cell graph | ...

(2, 2, 2, 2, 2)-grid graph | (5, 2)-Hamming graph | (5, 4)-bipartite (0, 2)-graph | penteract graph | regular decateron graph | regular deca-5-tope graph

(2, 2, 2, 2, 2, 2)-grid graph | (6, 13)-bipartite (0, 2)-graph | (6, 2)-Hamming graph | hexeract graph | regular dodecapeton graph | regular dodeca-6-tope graph

(2, 2, 2, 2, 2, 2, 2)-grid graph | (7, 2)-Hamming graph | (7, 40)-bipartite (0, 2)-graph | hepteract graph | regular tetradecaexon graph | regular tetradeca-7-tope graph

(2, 2, 2, 2, 2, 2, 2, 2)-grid graph | (8, 104)-bipartite (0, 2)-graph | (8, 2)-Hamming graph | octeract graph | regular hexadecazetton graph | regular hexdeca-8-tope graph

(2, 2, 2, 2, 2, 2, 2, 2, 2)-grid graph | (9, 2)-Hamming graph | enneract graph | regular octadecayotton graph | regular octadeca-9-tope graph

(10, 2)-Hamming graph | (2, 2, 2, 2, 2, 2, 2, 2, 2, 2)-grid graph | dekeract graph | regular icosaxennon graph | regular icosa-10-tope graph

| vertex count | edge count | connected component count singleton graph | 1 | 0 | 1 2-path graph | 2 | 1 | 1 square graph | 4 | 4 | 1 cubical graph | 8 | 12 | 1 tesseract graph | 16 | 32 | 1 5-hypercube graph | 32 | 80 | 1 6-hypercube graph | 64 | 192 | 1 7-hypercube graph | 128 | 448 | 1 8-hypercube graph | 256 | 1024 | 1 9-hypercube graph | 512 | 2304 | 1

antipodal | bicolorable | bipartite | Cayley graphs | class 1 | connected | distance-regular | distance-transitive | edge-transitive | graceful | grid | Hamilton-laceable | H-star connected | hypercube | integral | median | perfect | regular | simple | symmetric | traceable | triangle-free | uniquely colorable | unit-distance | vertex-transitive | weakly perfect | zero-two

| complement graph name singleton graph | singleton graph 2-path graph | 2-empty graph square graph | 2-ladder rung graph cubical graph | (2, 4)-rook graph tesseract graph | (not a named graph)