Step 1 of 3

In a graph, G the undirected and directed variants refer to the type of graph. If there is a
path/cycle G that uses each vertex exactly once, then it is called the path.

Step 2 of 3
(a)

We first reduce the undirected problem to the directed Rudrata cycle problem.

Let G be an undirected graph, which is an input to the undirected Rudrata cycle problem.
We need to produce a directed graph G ' (in polynomial time) that G has a Rudrata cycle if
and only if G ' has a (directed) Rudrata cycle. We construct G ' by replacing each edge with
two directed edges (going in the opposite direction). It is easy to check that this reduction
has the desired property.

Step 3 of 3
(b)

G  V, E  G '   V ', E ' 

Let be a directed graph, and from this, we have to produce a graph
(in polynomial time) that G has a Rudrata cycle if and only if G ' has a Rudrata cycle. Every
vertex v  G , G ' has three vertices  v ', v '', v ''' with edges ( v ', v '' ), ( v ', v '' ). For every
directed edge ( u, v ) in G , we have the edge ( u ''', v ' ) in G ' . This completes the description
of G ' .

' '' ''' ' '' '''

Suppose G has a Rudrata cycle: v1, v 2 , . . . , v n . Then is a v1 , v1 , v1 , v 2 , v 2 , v 2 , . . .
''
Rudrata cycle in G ' . Now, suppose G ' has a Rudrata cycle. Since each of the vertices v i
' ''
has degree 2, they must be preceded by v i and succeeded by v i in this cycle (or the other
'' '' '' ''
way round). Therefore, if the vertices v i appear in the cycle C in the v1 , v 2 , . . . , v n , then
v ' , v 1'' , v1''' , v 2' , v 2'' , v 2''' , v 3' , . . .,
it must be the case that the cycle looks like 1 and so it is a
G
directed cycle in .