Rudrata cycle
Given a graph (undirected graph or directed graph)
a cycle is a Rudrata cycle if it visits every vertex exactly once.
Rudrata cycle
Given a graph (undirected graph or directed graph)
a cycle is a Rudrata cycle if it visits every vertex exactly once.