4P_2
vertex count | 8 edge count | 4 connected component count | 4
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 | 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
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 | ∞
