P_5

(1, 1, 5)-grid graph | (1, 3)-Sierpiński simplex graph | (1, 5)-king graph | (2, 5)-black bishop graph | (2, 5)-white bishop graph | 4-matchstick graph 5 | 5-graph 21 | (5)-grid graph | 5-tree 1

vertex count | 5 edge count | 4 connected component count | 1

acyclic | apex | asymmetric | bicolorable | bipartite | black bishop | bridged | cactus | caterpillar | chordal | chordless | chromatically nonunique | class 1 | claw-free | connected | determined by resistance | determined by spectrum | forest | geodetic | graceful | grid | king | line graphs | lobster | matchstick | median | noncayley | nonempty | noneulerian | nonhamiltonian | no perfect matching | outerplanar | path | perfect | planar | projective planar | pseudoforest | pseudotree | simple | square-free | traceable | tree | triangle-free | uniquely colorable | unit-distance | weakly perfect | white bishop

house graph

4-path graph

vertex degrees | 1 (2 vertices) | 2 (3 vertices)

radius | 2 diameter | 4 girth | ∞ vertex connectivity | 1 edge connectivity | 1

-((x - 1) x (x + 1) (x^2 - 3))

(x + 1)^4

x^4

chromatic number | 2 edge chromatic number | 2

(-sqrt(3))^1 (-1)^1 0^1 1^1 sqrt(3)^1

(0 | 1 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 0 | 1 | 0 | 1 | 0 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 1 | 0)

(1 | 0 | 0 | 0 1 | 1 | 0 | 0 0 | 1 | 1 | 0 0 | 0 | 1 | 1 0 | 0 | 0 | 1)

Hosoya index | 8 Kirchhoff index | 20 stability index | 0 Wiener index | 20