Editing Degree (graph theory) (section)

==Special values==
[[File:Depth-first-tree.png|thumb|An undirected graph with leaf nodes 4, 5, 6, 7, 10, 11, and 12]]
*A vertex with degree 0 is called an [[isolated vertex]].
*A vertex with degree 1 is called a leaf vertex or end vertex or a pendant vertex, and the edge incident with that vertex is called a pendant edge. In the graph on the right, {3,5} is a pendant edge. This terminology is common in the study of [[tree (graph theory)|tree]]s in graph theory and especially [[tree (data structure)|tree]]s as [[data structure]]s.
* A vertex with degree ''n''&nbsp;&minus;&nbsp;1  in a graph on ''n'' vertices is called a [[dominating vertex]].