Essential Definitions and Theorems in Graph Theory
Classified in Computers
Written on in
English with a size of 103.48 KB
M1: Fundamental Graph Definitions
Walks, Paths, and Circuits
Walk
A Walk is a finite alternating sequence of vertices and edges, beginning and ending with vertices, such that each edge is incident with the vertices preceding and following it. No edge appears more than once in a walk, though a vertex may appear multiple times.
- Closed Walk: A walk that begins and ends at the same vertex.
- Open Walk: A walk that begins and ends at different vertices.
Path
A Path is an open walk in which no vertex appears more than once. The number of edges in a path is called the length of the path. A self-loop can be included in a walk but not in a path. The terminal vertices of a path are of degree 1, and the remaining intermediate vertices are of degree 2.
Circuit
A... Continue reading "Essential Definitions and Theorems in Graph Theory" »