Opentopia Directory Encyclopedia Tools

Cycle graph

Encyclopedia : C : CY : CYC : Cycle graph


A cycle graph of length 6.
A cycle graph of length 6.

In graph theory, a cycle 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_n]. The number of vertices in a [C_n] equals the number of edges, and every vertex has degree two, that is, every vertex has exactly two edges incident with it.

A note on terminology

There are many synonyms for "cycle-graph." These include simple cycle graph and cyclic graph, although the latter term appears to be used more often by non-graph theorists. Among graph theorists, cycle, polygon, or n-gon are also often used. More specifically, a cycle with an even number of vertices is called even cycle, a cycle with an odd number of vertices is called odd cycle.

Properties

A cycle graph is: In addition:

Directed cycle graph

A directed cycle graph of length 8.
A directed cycle graph of length 8.

A directed cyclic graph is a directed version of a cyclic graph, with all the edges being oriented in 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.

There is a directed cycle through any two vertices in a strongly connected component.

External link

 


From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles
0123456789
ABCDEFGHIJ
KLMNOPQRST
UVWXYZ?

E-mail this article to:

Personal Message: