3P_2

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

vertex count | 6 edge count | 3 connected component count | 3

acyclic | apex | arc-transitive | bicolorable | bipartite | bridged | Cayley graphs | chordal | chordless | chromatically nonunique | circulant | class 1 | claw-free | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | edge-transitive | forest | Haar | integral | Kneser | 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 | triangular honeycomb acute knight | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered

octahedral graph

3-empty graph

vertex degrees | 1 (6 vertices)

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

(x - 1)^3 (x + 1)^3

(x + 1)^3

x^3

chromatic number | 2 edge chromatic number | 1

(-1)^3 1^3

(0 | 0 | 0 | 1 | 0 | 0 0 | 0 | 0 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 1 1 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 0 | 0)

(1 | 0 | 0 0 | 1 | 0 0 | 0 | 1 1 | 0 | 0 0 | 1 | 0 0 | 0 | 1)

Hosoya index | 8 Kirchhoff index | ∞ stability index | 8 Wiener index | ∞