In the mathematical field of graph theory, a path graph is a particularly simple example of a tree, namely one which is not branched at all, that is, contains only nodes of degree two and one. In particular, two of its vertices have degree 1 and all others (if any) have degree 2.

See also

• Path (graph theory)
• Cycle graph
• Complete graph
• Null graph

External links

---

Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article