Cycle graph
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
Cycle graph
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 Cn. The number of vertices in a Cn equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.
A note on terminologyThere are many synonyms for "cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which are merely not acyclic. Among graph theorists, cycle, polygon, or n-gon are also often used. A cycle with an even number of vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle. PropertiesA cycle graph is:
In addition:
Directed cycle graphA 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). See also
External links
cs:Kru?nice (graf) eo:Cikla grafeo es:Grafo ciclo hu:Körgráf ja:????? sv:Cyklisk graf Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement