Near Matches
Ignore Exact
Everything
2
outdegree
(
thing
)
by
artemis entreri
Sun Feb 11 2001 at 4:49:08
In a
directed graph
, we say that a
vertex
has
outdegree
x if there are (
exactly
) x
edges
leaving that
vertex
.
--back to
combinatorics
--
Eulerian graph
Premature ejaculation
eigenvector
Combinatorics
Log in
or
register
to write something here or to contact authors.