C_12

(1, 12, 11)-honeycomb toroidal graph | (1, 12, 1)-honeycomb toroidal graph | (1, 12)-KC graph | (12, 1)-wreath graph | 12-arc transitive graph 1 | 12-circulant graph (1) | 12-circulant graph (5) | 12-edge transitive graph 2 | 12-vertex transitive graph 3 | (2, 12)-Harary graph | ...

vertex count | 12 edge count | 12 connected component count | 1

antipodal | apex | arc-transitive | bicolorable | biconnected | bipartite | bridgeless | cactus | Cayley graphs | chordless | chromatically unique | circulant | class 1 | claw-free | conformally rigid | connected | cycle | cyclic | determined by spectrum | distance-regular | distance-transitive | dominating unique | edge-transitive | Eulerian | flexible | geometric | graceful | Haar | Hamilton-decomposable | Hamiltonian | Harary | honeycomb toroidal | KC | Knödel | LCF | line graphs | linklessly embeddable | local | map | matchstick | Meyniel | multigraphic | nonempty | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | pseudotree | quadratically embeddable | regular | simple | square-free | switchable | symmetric | traceable | triangle-free | two-regular | unicyclic | uniquely colorable | uniquely embeddable | uniquely Hamiltonian | unit-distance | vertex-transitive | weakly perfect | weakly regular | wreath

12-circulant graph (1, 2, 3, 4, 6)