C_9
vertex count | 9 edge count | 9 connected component count | 1
apex | arc-transitive | biconnected | bridgeless | cactus | Cayley graphs | chordless | chromatically unique | circulant | class 2 | claw-free | connected | cycle | cyclic | determined by resistance | determined by spectrum | distance-regular | distance-transitive | edge-transitive | Eulerian | geodetic | Hamilton-decomposable | Hamiltonian | Harary | imperfect | LCF | line graphs | local | matchstick | nonempty | no perfect matching | outerplanar | planar | projective planar | pseudoforest | pseudotree | regular | simple | square-free | stacked prism | symmetric | traceable | triangle-free | two-regular | ungraceful | unicyclic | unit-distance | vertex-transitive | weakly regular | wreath
9-circulant graph (1, 2, 3)
9-cycle graph
vertex degrees | 2 (9 vertices)
radius | 4 diameter | 4 girth | 9 vertex connectivity | 2 edge connectivity | 2
-((x - 2) (x + 1)^2 (x^3 - 3 x + 1)^2)
x^8 y + 9 x^8 + 36 x^7 + 84 x^6 + 126 x^5 + 126 x^4 + 84 x^3 + 36 x^2 + 9 x + 1
x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x + y
chromatic number | 3 edge chromatic number | 3
(root of 1 - 3 x + x^3 near x = -1.87939)^2 (-1)^2 (root of 1 - 3 x + x^3 near x = 0.347296)^2 (root of 1 - 3 x + x^3 near x = 1.53209)^2 2^1
(0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0)
(1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1)
Hosoya index | 76 Kirchhoff index | 60 stability index | 2 Wiener index | 90