6P_2

(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

vertex count | 12 edge count | 6 connected component count | 6

acyclic | apex | arc-transitive | bicolorable | bipartite | bipartite Kneser | bridged | camel | Cayley graphs | chordal | chordless | circulant | class 1 | claw-free | disconnected | distance-regular | distance-transitive | edge-transitive | forest | Haar | integral | Knödel | ladder rung | line graphs | matchstick | nonempty | noneulerian | nonhamiltonian | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | regular | simple | square-free | strongly perfect | strongly regular | symmetric | triangle-free | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered

6-cocktail party graph

6-empty graph

vertex degrees | 1 (12 vertices)

radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0

(x - 1)^6 (x + 1)^6

(x + 1)^6

x^6

chromatic number | 2 edge chromatic number | 1

(-1)^6 1^6

Hosoya index | 64 Kirchhoff index | ∞ stability index | 64 Wiener index | ∞