P_5

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

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

acyclic | 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 | no perfect matching | outerplanar | path | perfect | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | simple | spoke | square-free | switchable | traceable | tree | triangle-free | uniquely colorable | uniquely embeddable | 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