12-vertex Transitive Graph 4
2C_6
vertex count | 12 edge count | 12 connected component count | 2
apex | arc-transitive | bicolorable | bipartite | bridgeless | Cayley graphs | chordless | circulant | class 1 | claw-free | cyclic | disconnected | distance-regular | distance-transitive | edge-transitive | flexible | graceful | Haar | integral | line graphs | linklessly embeddable | local | map | matchstick | Meyniel | multigraphic | nonempty | noneulerian | nongeometric | nonhamiltonian | not determined by resistance | not determined by spectrum | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | regular | simple | square-free | switchable | symmetric | Taylor | triangle-free | two-regular | uniquely embeddable | unit-distance | untraceable | vertex-transitive | weakly perfect | weakly regular
12-circulant graph (1, 3, 4, 5, 6)
two hexagons
vertex degrees | 2 (12 vertices)
radius | ∞ diameter | ∞ girth | 6 vertex connectivity | 0 edge connectivity | 0
(x - 2)^2 (x - 1)^4 (x + 1)^4 (x + 2)^2
(x^5 y + 6 x^5 + 15 x^4 + 20 x^3 + 15 x^2 + 6 x + 1)^2
(x^5 + x^4 + x^3 + x^2 + x + y)^2
chromatic number | 2 edge chromatic number | 2
(-2)^2 (-1)^4 1^4 2^2
Hosoya index | 324 Kirchhoff index | ∞ stability index | 400 Wiener index | ∞