Home / Get Math Help
(1, 8)-knight Graph
Image
Notation
K^__8
Alternate names
Basic properties
vertex count | 8 edge count | 0 connected component count | 8
Graph features
bicolorable | bipartite | class 1 | knight | Meyniel | perfect | simple | triangle-free | uniquely colorable | weakly perfect
Complement graph
8-complete graph
Line graph
null graph
Graph degrees
vertex degrees | 0 (8 vertices)
Topological properties
radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0
Graph polynomials
x^8
1
1
Coloring properties
chromatic number | 1 edge chromatic number | 0
Spectrum
0^8
Associated matrices
(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)
Graph indices
Hosoya index | 1 Kirchhoff index | ∞ stability index | 1 Wiener index | ∞