... >> Mathematics >> Discrete Mathematics >> Path
Highest Rated Sign
Nobody has posted a sign yet.
Definition: A path from u to v in a graph G is a sequence of edges in G with the first edge incident to u, the last edge incident to v, and if e and e' are two consecutive edges in the sequence, then e and e' must share a vertex.
Example: It may be that u = v, so the path has no edges in it.