Articles by others on the same topic
The degree of a vertex is the number of incident edge ends in an undirected graph, counting a self-loop twice. Parallel edges contribute separately. In a simple graph, this equals the cardinality of the graph neighbourhood . Thus a vertex with one self-loop and no other edges has degree two, whereas a leaf of a graph has degree one. Counting these incidences at every vertex gives the handshaking lemma .