Scribd
Upload
723 views7 pages

Graph Theory Walk and Path

A walk in graph theory is a finite sequence of alternating vertices and edges. An open walk starts and ends at different vertices, while a closed walk starts and ends at the same vertex. The length of a walk is the number of edges. A path is an open walk that does not repeat vertices or edges, while a cycle is a closed path. A trail allows vertex repetition but not edge repetition. A circuit is a closed trail.

Uploaded by

Pallvi Mahajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
723 views7 pages

Graph Theory Walk and Path

A walk in graph theory is a finite sequence of alternating vertices and edges. An open walk starts and ends at different vertices, while a closed walk starts and ends at the same vertex. The length of a walk is the number of edges. A path is an open walk that does not repeat vertices or edges, while a cycle is a closed path. A trail allows vertex repetition but not edge repetition. A circuit is a closed trail.

Uploaded by

Pallvi Mahajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Walk

 A walk is defined as a finite sequence of the form

which consists of alternating vertices and edges.


 The walk starts and ends at vertices where these two vertices are called end
vertices. The starting vertex is called initial vertex and the vertex at which the
walk ends is called terminal vertex.
 The total number of edges covered in a walk is called as Length of the Walk.

Open Walk in Graph Theory-

In graph theory, a walk is called as an Open walk if-


 Length of the walk is greater than zero
 And the vertices at which the walk starts and ends are different.

Closed Walk in Graph Theory-

In graph theory, a walk is called as a Closed walk if-


 Length of the walk is greater than zero
 And the vertices at which the walk starts and ends are same.

NOTE
It is important to note the following points-
 If length of the walk = 0, then it is called as a Trivial Walk.
 Both vertices and edges can repeat in a walk whether it is an open walk or a
closed walk.
Example-

Consider the following graph-

Fig. 1
In Fig. 1, the walk

is open, but the walk

is closed.

Path in Graph Theory-

In graph theory, a path is defined as an open walk in which-


 Neither vertices (except possibly the starting and ending vertices) are allowed to
repeat.
 Nor edges are allowed to repeat.

Cycle in Graph Theory-


In graph theory, a cycle is defined as a closed walk in which-
 Neither vertices (except possibly the starting and ending vertices) are allowed to
repeat.
 Nor edges are allowed to repeat.
 In graph theory, a closed path is called as a cycle.
Example
In Fig. 1, the following walk

is a path whereas the walk

is a cycle.

Trail in Graph Theory-


In graph theory, a trail is defined as an open walk in which-
 Vertices may repeat.
 But edges are not allowed to repeat.
Example

Fig. 1

In Fig. 1, the following walk

is a trial.
Circuit in Graph Theory-
In graph theory, a circuit is defined as a closed walk in which-
 Vertices may repeat.
 But edges are not allowed to repeat.
 In graph theory, a closed trail is called as a circuit.
NOTE
It is important to note the following points-
 Every path is a trail but every trail need not be a path.
 Every cycle is a circuit but every circuit need not be a cycle.

The following chart summarizes the above definitions and is helpful in


remembering them-
PROBLEMS BASED ON WALK IN GRAPH THEORY

Problem-01:

Consider the following graph-

Decide which of the following sequences of vertices determine walks.


For those that are walks, decide whether it is a circuit, a path, a cycle or a
trail.

1. a , b , g , f , c , b
2. b , g , f , c , b , g , a
3. c , e , f , c
4. c , e , f , c , e
5. a , b , f , a
6. f , d , e , c , b

Solution-

1. Trail
2. Walk
3. Cycle
4. Walk
5. Not a walk
6. Path
Problem-02:

Consider the following graph-

Consider the following sequences of vertices and answer the questions that
follows:

A. x,v,y,w,v
B. x,u,x,u,x
C. x,u,v,y,x
D. x,v,y,w,v,u,x

1. Which of the above given sequences are directed walks?


2. What are the lengths of directed walks?
3. Which directed walks are also directed paths?
4. Which directed walks are also directed cycles?

Solution-

Part-01:

 Only (A) and (B) are the directed walks.


 (C) is not a directed walk since there exists no edge from vertex u to vertex v.
 (D) is not a directed walk since there exists no edge from vertex v to vertex u.
Part-02:

Both the directed walks (A) and (B) have length = 4.

Part-03:

 Neither (A) nor (B) are directed paths.


 This is because vertices repeat in both of them.
 Vertex v repeats in Walk (A) and vertex u repeats in walk (B).

Part-04:

 Neither of them are directed cycles.


 Walk (A) does not represent a directed cycle because its starting and ending
vertices are not same.
 Walk (B) does not represent a directed cycle because it repeats vertices/edges.

You might also like