A directed cycle graph is a directed version of a cycle graph, with all the edges being oriented in the same direction.
In a directed graph, a set of edges which contains at least one edge (or arc) from each directed cycle is called a feedback arc set. Similarly, a set of vertices containing at least one vertex from each directed cycle is called a feedback vertex set.
A directed cycle graph has uniform in-degree 1 and uniform out-degree 1.
Directed cycle graphs are Cayley graphs for cyclic groups (see e.g. Trevisan).
Read more about this topic: Cycle Graph
Famous quotes containing the words directed, cycle and/or graph:
“[W]hat I mean by love ... is this. A sympathetic liking—excited by fancy, directed by judgment—and to which is joined also a most sincere desire of the good and happiness of its object.”
—Sarah Fielding (1710–1768)
“Only mediocrities progress. An artist revolves in a cycle of masterpieces, the first of which is no less perfect than the last.”
—Oscar Wilde (1854–1900)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)