(1, 9)-knight Graph
K^__9
vertex count | 9 edge count | 0 connected component count | 9
bicolorable | bipartite | class 1 | knight | Meyniel | perfect | simple | triangle-free | uniquely colorable | weakly perfect
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 | ∞