Coupon Accepted Successfully!


Paths, Connectivity


Path and its length in a graph (multigraph) G : A path α in G with origin v0 and end vn is an alternating sequence of vertices and edges of the form.


where each edge ei is incident on vertices vi–1 and vi. The number of edges, n is called length of α. When there is no ambiguity, we denote α by its sequence of edges, α = (e1, e2, ... en), or by its sequence of vertices α = (vo, v1, ..., vn).

Test Your Skills Now!
Take a Quiz now
Reviewer Name