A walk : Sequence of vertices and edges v_i and e_i such that for 1 <= i <= k, the edge e_i has endpoints v_(i-1) and v_i.
The length of a walk is the number of edges in it.
A trail is a walk with no repeated edges.
A path is a walk with no repeated vertex.
fact - path be a trail, but path may or may not be a trial.
The distance d(u,v) between vertices u and v equals the shortest length of a u,v path.
A circuit is a closed trail.
A cycle is a closed path.
A graph is connected if any two of its vertices are joined by a path.
A tree is an undirected graph in which any two vertices are connected by exactly one simple path.
The length of a walk is the number of edges in it.
A trail is a walk with no repeated edges.
A path is a walk with no repeated vertex.
fact - path be a trail, but path may or may not be a trial.
The distance d(u,v) between vertices u and v equals the shortest length of a u,v path.
A circuit is a closed trail.
A cycle is a closed path.
A graph is connected if any two of its vertices are joined by a path.
A tree is an undirected graph in which any two vertices are connected by exactly one simple path.
No comments:
Post a Comment