Path graph
From Wikipedia, the free encyclopedia
| Path graph | |
 A path graph |
|
| Vertices | n |
|---|---|
| Edges | n - 1 |
| Radius | ⌊n/2⌋ |
| Diameter | n - 1 |
| Automorphisms | 2 |
| Chromatic number | 2 |
| Chromatic index | 2 |
| Properties | 2-regular Unit distance Bipartite graph |
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.
