4P_2

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

vertex count | 8 edge count | 4 connected component count | 4

bicolorable | bipartite | class 1 | knight | Meyniel | perfect | simple | triangle-free | uniquely colorable | weakly perfect

16-cell graph

4-empty graph

vertex degrees | 1 (8 vertices)

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

(x - 1)^4 (x + 1)^4

(x + 1)^4

x^4

chromatic number | 2 edge chromatic number | 1

(-1)^4 1^4

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

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

Hosoya index | 16 Kirchhoff index | ∞ stability index | 16 Wiener index | ∞