In a directed graph, we say that a vertex has outdegree x if there are (exactly) x edges leaving that vertex.

--back to combinatorics--

Log in or register to write something here or to contact authors.