P_3

(1, 1, 3)-grid graph | (1, 2)-complete 2-partite graph | (1, 2)-complete bipartite graph | (1, 2)-Sierpiński simplex graph | (1, 3, 1)-quasi-regular graph | (1, 3)-king graph | (1, 3)-KP graph | 1-tree (3, 1) | (2, 1)-spoke graph | (2, 1)-stacked book graph | ...

vertex count | 3 edge count | 2 connected component count | 1

acyclic | almost controllable | almost Hamiltonian | apex | asymmetric | bicolorable | bipartite | black bishop | block | bridged | cactus | caterpillar | chordal | chordless | chromatically unique | class 1 | claw-free | complete bipartite | complete k-partite | complete tree | conformally rigid | connected | determined by resistance | determined by spectrum | distance-hereditary | dominating unique | edge-transitive | Fibonacci cube | flexible | forest | geodetic | graceful | grid | king | KP | k-tree | line graphs | linklessly embeddable | lobster | Lucas cube | map | matchstick | maximally nonhamiltonian | median | Meyniel | noncayley | nonempty | noneulerian | nongeometric | nonhamiltonian | no perfect matching | outerplanar | path | perfect | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | quasi-regular | simple | smallest fully forested | split | spoke | square-free | stacked book | star | strongly perfect | traceable | tree | triangle-free | triangular honeycomb bishop | Turán | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | unit-distance | unswitchable | weakly perfect | white bishop

2-path and singleton

2-path graph

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

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

x (x^2 - 2)

(x + 1)^2

x^2

chromatic number | 2 edge chromatic number | 2

(-sqrt(2))^1 0^1 sqrt(2)^1

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

(1 | 0 1 | 1 0 | 1)

Hosoya index | 3 Kirchhoff index | 4 stability index | 0 Wiener index | 4