(1, 5)-knight Graph
K^__5
vertex count | 5 edge count | 0 connected component count | 5
bicolorable | bipartite | class 1 | knight | Meyniel | perfect | simple | triangle-free | uniquely colorable | unit-distance | weakly perfect
pentatope graph
null graph
vertex degrees | 0 (5 vertices)
radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0
x^5
1
1
chromatic number | 1 edge chromatic number | 0
0^5
(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 | ∞