Definition:Pendant Vertex
Jump to navigation
Jump to search
Definition
Let $G$ be a graph.
A vertex $v$ of $G$ is said to be a pendant vertex if and only if it has degree $1$.
Also known as
A pendant vertex can also be found to be described as an end vertex.
In the context of trees, a pendant vertex is usually known as a terminal node, a leaf node or just leaf.
Some sources render the name as pendent vertex; some purists argue that this is more linguistically accurate.
Also see
Sources
- 1981: M.N.S. Swamy: Graphs, Networks and Algorithms: $\S 1.1$