K^__9

(1, 9)-bishop graph | (1, 9)-camel graph | (1, 9)-giraffe graph | (1, 9)-knight graph | (1, 9)-rook complement graph | (1, 9)-zebra graph | (3, 3)-antelope graph | (3, 3)-camel graph | (3, 3)-fiveleaper graph | (3, 3)-giraffe graph | ...

vertex count | 9 edge count | 0 connected component count | 9

acyclic | antelope | apex | bicolorable | bipartite | bishop | bridgeless | camel | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | edge-transitive | empty | Eulerian | fiveleaper | forest | giraffe | integral | Kneser | knight | line graphs | matchstick | nonhamiltonian | no perfect matching | outerplanar | perfect | planar | projective planar | pseudoforest | regular | rook complement | simple | split | square-free | strongly perfect | strongly regular | symmetric | triangle-free | Turán | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered | zebra

9-complete graph

null graph

vertex degrees | 0 (9 vertices)

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

-x^9

1

1

chromatic number | 1 edge chromatic number | 0

0^9

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

Hosoya index | 1 Kirchhoff index | ∞ stability index | 0 Wiener index | ∞