(1, 2)-knight Graph
K^__2
vertex count | 2 edge count | 0 connected component count | 2
bicolorable | bipartite | class 1 | knight | Meyniel | perfect | simple | triangle-free | uniquely colorable | unit-distance | weakly perfect
2-path graph
null graph
vertex degrees | 0 (2 vertices)
radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0
x^2
1
1
chromatic number | 1 edge chromatic number | 0
0^2
(0 | 0 0 | 0)
Hosoya index | 1 Kirchhoff index | ∞ stability index | 1 Wiener index | ∞