3-middle Layer Graph
H(7, 3)
vertex count | 70 edge count | 140 connected component count | 1
antipodal | arc-transitive | bicolorable | biconnected | bipartite | bipartite Kneser | bridgeless | class 1 | conformally rigid | connected | cyclic | distance-regular | distance-transitive | edge-transitive | Eulerian | fully reconstructible in C^1 | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | H-star connected | incidence | integral | LCF | local | middle layer | multigraphic | nonempty | nonplanar | not uniquely embeddable | perfect | perfect matching | quadratically embeddable | quartic | regular | rigid | simple | square-free | switchable | symmetric | traceable | triangle-free | uniquely colorable | unit-distance | vertex-transitive | weakly perfect | weakly regular
(not a named graph)
(not a named graph)
vertex degrees | 4 (70 vertices)
radius | 7 diameter | 7 girth | 6 vertex connectivity | 4 edge connectivity | 4
(x - 4) (x - 3)^6 (x - 2)^14 (x - 1)^14 (x + 1)^14 (x + 2)^14 (x + 3)^6 (x + 4)
chromatic number | 2 edge chromatic number | 4
(-4)^1 (-3)^6 (-2)^14 (-1)^14 1^14 2^14 3^6 4^1
Kirchhoff index | 1665 stability index | 1.7×10^21 Wiener index | 8575