In the mathematical field of graph theory, a path graph is a graph whose vertices can be listed in the order v₁, v₂, …, vₙ such that the edges are {vᵢ, vᵢ₊₁} where i = 1, 2, …, n − 1. Equivalently, a path with at least two vertices is connected... Wikipedia