8P_2

(1, 16)-Knödel graph | 128-Haar graph | 16-circulant graph (8) | 16-vertex transitive graph 2 | (2, 8)-giraffe graph

vertex count | 16 edge count | 8 connected component count | 8

acyclic | apex | arc-transitive | bicolorable | bipartite | bridged | Cayley graphs | chordal | chordless | chromatically nonunique | circulant | class 1 | claw-free | disconnected | distance-regular | distance-transitive | edge-transitive | forest | giraffe | 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

8-cocktail party graph

8-empty graph

vertex degrees | 1 (16 vertices)

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

(x - 1)^8 (x + 1)^8

(x + 1)^8

x^8

chromatic number | 2 edge chromatic number | 1

(-1)^8 1^8

Hosoya index | 256 Kirchhoff index | ∞ stability index | 256 Wiener index | ∞