In the mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order  such that the edges are  where .
In the realm of graph theory, a path graph (or linear graph) is defined as a graph where vertices can be arranged in a specific sequence, and the edges connect these vertices in a sequential manner.