8-tree 1
P_8
vertex count | 8 edge count | 7 connected component count | 1
acyclic | antipodal | apex | asymmetric | bicolorable | bipartite | black bishop | block | bridged | cactus | caterpillar | chordal | chordless | chromatically nonunique | class 1 | claw-free | connected | determined by resistance | determined by spectrum | distance-hereditary | dominating nonunique | flexible | forest | geodetic | graceful | grid | king | KP | k-tree | line graphs | linklessly embeddable | lobster | map | matchstick | median | Meyniel | multigraphic | noncayley | nonempty | noneulerian | nongeometric | nonhamiltonian | outerplanar | path | perfect | perfect matching | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | simple | square-free | switchable | traceable | tree | triangle-free | uniquely colorable | uniquely embeddable | unit-distance | weakly perfect | white bishop
8-path complement graph
7-path graph
vertex degrees | 1 (2 vertices) | 2 (6 vertices)
radius | 4 diameter | 7 girth | ∞ vertex connectivity | 1 edge connectivity | 1
(x - 1) (x + 1) (x^3 - 3 x - 1) (x^3 - 3 x + 1)
(x + 1)^7
x^7
chromatic number | 2 edge chromatic number | 2
(root of 1 - 3 x + x^3 near x = -1.87939)^1 (root of -1 - 3 x + x^3 near x = -1.53209)^1 (-1)^1 (root of -1 - 3 x + x^3 near x = -0.347296)^1 (root of 1 - 3 x + x^3 near x = 0.347296)^1 1^1 (root of 1 - 3 x + x^3 near x = 1.53209)^1 (root of -1 - 3 x + x^3 near x = 1.87939)^1
(0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0)
(1 | 0 | 0 | 0 | 0 | 0 | 0 1 | 1 | 0 | 0 | 0 | 0 | 0 0 | 1 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 1 | 0 | 0 | 0 0 | 0 | 0 | 1 | 1 | 0 | 0 0 | 0 | 0 | 0 | 1 | 1 | 0 0 | 0 | 0 | 0 | 0 | 1 | 1 0 | 0 | 0 | 0 | 0 | 0 | 1)
Hosoya index | 34 Kirchhoff index | 84 stability index | 34 Wiener index | 84