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 | Unit distance Bipartite graph |
| Notation | Pn |
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.
[edit] See also
[edit] External links
- Weistein, Eric W., "Path Graph" from MathWorld.
