(thing) by artemis entreri Sun Feb 11 2001 at 0:02:02
In a directed graph, we say that a vertex has indegree x if there are (exactly) x edges coming into that vertex.

--back to combinatorics--
I like it!

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