Definition:Path (Graph Theory)/Subgraph
Jump to navigation
Jump to search
Definition
The set of vertices and edges which go to make up a path in a graph $G$ form a subgraph of $G$.
This subgraph itself is also referred to as a path in $G$.
Also see
- Results about paths in the context of graph theory can be found here.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): $\S 2.3$: Connected Graphs