page_title: Cycle graph
section_title: Directed cycle graph
hierarchical_section_title: Cycle graph / Directed cycle graph
context_page_description: In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain. The cycle graph with n vertices is called Cₙ. The number of vertices in Cₙ equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.
context_section_description: 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).
caption: A directed cycle graph of length 8
exif: {}