singleton graph | 2-path graph | triangle graph | diamond graph | gem graph | Beineke graph 2 | (1, 1, 3)-complete tripartite graph | utility graph | 6-graph 82 | 6-graph 95 | 6-graph 108 | 6-graph 109 | 6-graph 128 | Beineke graph 8 | (1, 1, 4)-complete tripartite graph | (1, 5)-fan graph | 2-tree (6, 2) | 3-prism graph | 2-triangular grid graph | (6, 9, 1)-unit distance forbidden subgraph | ... (total: 284)

0-hypercube graph | 0-Pell 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 | ...

0-Dorogovtsev-Goltsev-Mendes 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)-spoke graph | (1, 1)-stacked book graph | (1, 2)-bar graph | (1, 2)-Hamming graph | (1, 2)-king graph | ...

(1, 1, 1)-complete tripartite graph | (1, 2)-fan graph | (1, 3)-Hamming graph | (1, 3)-KC graph | (1, 3)-lattice graph | (1, 3)-queen graph | (1, 3)-rook graph | 1-Dorogovtsev-Goltsev-Mendes graph | 1-Hanoi graph | 1-polyiamond 1 | ...

(1, 1, 2)-complete 3-partite graph | (1, 1, 2)-complete tripartite graph | (1, 3)-fan graph | (2, 2)-fan graph | 2-polyiamond 1 | 2-tree (4, 1) | (4, 2)-uniquely hamiltonian graph | (4, 3)-Turán graph | 4-graph 10 | 4-maximum planar embedding graph 2 | 5-matchstick graph 1

(1, 4)-fan graph | 2-tree (5, 2) | 3-polyiamond 1 | (5, 3)-uniquely hamiltonian graph | 5-graph 29 | 5-maximum planar embedding graph 4 | 7-matchstick graph 1

5-graph 31

(1, 1, 3)-complete 3-partite graph | 2-tree (5, 1) | (3, 2)-fan graph | 5-graph 19

(1, 6, 3)-honeycomb toroidal graph | 1-crossing number graph A | (3, 1)-Goethals-Seidel block design graph | (3, 3)-complete 2-partite graph | (3, 3)-complete bipartite graph | (3, 6)-Harary graph | 3-Möbius ladder graph | 3-Möbius wheel | 3-transposition graph | (6, 2)-Turán graph | ...

(6, 8)-uniquely hamiltonian graph

2-tree (6, 5) | 4-polyiamond graph 1 | (6, 11)-uniquely hamiltonian graph | 6-graph 126 | 9-matchstick graph 7

| vertex count | edge count | connected component count singleton graph | 1 | 0 | 1 2-path graph | 2 | 1 | 1 triangle graph | 3 | 3 | 1 diamond graph | 4 | 5 | 1 gem graph | 5 | 7 | 1 Beineke graph 2 | 5 | 7 | 1 (1, 1, 3)-complete tripartite graph | 5 | 7 | 1 utility graph | 6 | 9 | 1 6-graph 82 | 6 | 9 | 1 6-graph 95 | 6 | 9 | 1