In a simple graph, the degree of a vertex is the number of neighbors of the vertex. In a digraph, we define the degree of a vertex to be the number of elements in the unique union of the parents and children of the vertex.
|
|
|
The source of this document is in Graphs.m2:1951:0.