9P_2

(1, 18)-Knödel graph | 18-circulant graph (9) | 18-vertex transitive graph 2 | 256-Haar graph

vertex count | 18 edge count | 9 connected component count | 9

acyclic | apex | arc-transitive | bicolorable | bipartite | bridged | 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

9-cocktail party graph

9-empty graph

vertex degrees | 1 (18 vertices)

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

(x - 1)^9 (x + 1)^9

(x + 1)^9

x^9

chromatic number | 2 edge chromatic number | 1

(-1)^9 1^9

Hosoya index | 512 Kirchhoff index | ∞ stability index | 512 Wiener index | ∞