Path graph
| Path graph | ||
|---|---|---|
Chromatic index 2 | | |
| Spectrum | ||
| Properties | Unit distance Bipartite graph Tree | |
| Notation | Pn[1] | |
| Table of graphs and parameters | ||
In the
edges are {vi, vi+1} where i = 1, 2, …, n − 1. Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree
1), while all others (if any) have degree 2.
Paths are often important in their role as subgraphs of other graphs, in which case they are called paths in that graph. A path is a particularly simple example of a tree, and in fact the paths are exactly the trees in which no vertex has degree 3 or more. A disjoint union of paths is called a linear forest.
Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See, for example, Bondy and Murty (1976), Gibbons (1985), or Diestel (2005).
As Dynkin diagrams
In algebra, path graphs appear as the Dynkin diagrams of type A. As such, they classify the root system of type A and the Weyl group of type A, which is the symmetric group.
See also
- Path (graph theory)
- Caterpillar tree
- Complete graph
- Null graph
- Path decomposition
- Cycle (graph theory)
References
- ^ While it is most common to use Pn for a path of n vertices, some authors (e.g. Diestel) use Pn for a path of n edges and n+1 vertices.
- ISBN 0-444-19451-7.
- Diestel, Reinhard (2005). Graph Theory (3rd ed.). ISBN 3-540-26182-6.