2-path graph | 2-ladder rung graph | 3-ladder rung graph | 4-ladder rung graph | 5-ladder rung graph | 6-ladder rung graph | 7-ladder rung graph | 8-ladder rung graph | 9-ladder rung graph | 10-ladder rung graph | 11-ladder rung graph | 12-ladder rung graph | 13-ladder rung graph | 14-ladder rung graph | 15-ladder rung graph | 16-ladder rung graph | 17-ladder rung graph | 18-ladder rung graph | 19-ladder rung graph | 20-ladder rung graph | 70-ladder rung graph | 252-ladder rung graph (total: 22)

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, 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-graph 5 | 4-vertex transitive graph 2

(1, 6)-Knödel graph | 3-triangular honeycomb acute knight graph | (4, 2)-Kneser graph | 4-Haar graph | 6-circulant graph (3) | 6-graph 36 | 6-vertex transitive graph 2

(1, 8)-Knödel graph | (2, 4)-knight graph | 8-circulant graph (4) | 8-graph 910 | 8-Haar graph | 8-vertex transitive graph 2

10-circulant graph (5) | 10-graph 114756 | 10-vertex transitive graph 2 | (1, 10)-fiveleaper graph | (1, 10)-Knödel graph | 16-Haar graph

(1, 12)-Knödel graph | 12-circulant graph (6) | 12-vertex transitive graph 2 | (2, 6)-camel graph | 32-Haar graph | (4, 2)-bipartite Kneser graph

(1, 14)-Knödel graph | 14-circulant graph (7) | 14-vertex transitive graph 2 | 64-Haar graph

(1, 16)-Knödel graph | 128-Haar graph | 16-circulant graph (8) | 16-vertex transitive graph 2 | (2, 8)-giraffe graph

(1, 18)-Knödel graph | 18-circulant graph (9) | 18-vertex transitive graph 2 | 256-Haar graph

(1, 20)-Knödel graph | 20-circulant graph (10) | 20-vertex transitive graph 2 | (2, 10)-fiveleaper graph | 512-Haar graph | (6, 3)-Kneser graph

| vertex count | edge count | connected component count 2-path graph | 2 | 1 | 1 2-ladder rung graph | 4 | 2 | 2 3-ladder rung graph | 6 | 3 | 3 4-ladder rung graph | 8 | 4 | 4 5-ladder rung graph | 10 | 5 | 5 6-ladder rung graph | 12 | 6 | 6 7-ladder rung graph | 14 | 7 | 7 8-ladder rung graph | 16 | 8 | 8 9-ladder rung graph | 18 | 9 | 9 10-ladder rung graph | 20 | 10 | 10

acyclic | apex | arc-transitive | bicolorable | bipartite | block | bridged | Cayley graphs | chordal | chordless | class 1 | claw-free | distance-regular | distance-transitive | edge-transitive | forest | Haar | integral | Knödel | ladder rung | line graphs | linklessly embeddable | local | map | matchstick | Meyniel | nonempty | noneulerian | nonhamiltonian | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | Ptolemaic | regular | simple | square-free | symmetric | triangle-free | unigraphic | uniquely embeddable | unit-distance | vertex-transitive | weakly perfect | well covered

| complement graph name 2-path graph | 2-empty graph 2-ladder rung graph | square graph 3-ladder rung graph | octahedral graph 4-ladder rung graph | 16-cell graph 5-ladder rung graph | 5-cocktail party graph

| line graph name 2-path graph | singleton graph 2-ladder rung graph | 2-empty graph 3-ladder rung graph | 3-empty graph 4-ladder rung graph | 4-empty graph 5-ladder rung graph | 5-empty graph