Cycle graph
Graph with nodes connected in a closed chain / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Cycle graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about connected, 2-regular graphs. For other uses, see Cyclic graph.
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 (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with n vertices is called Cn.[2] The number of vertices in Cn equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.
Quick Facts Girth, Automorphisms ...
Cycle | |
---|---|
Girth | n |
Automorphisms | 2n (Dn) |
Chromatic number | 3 if n is odd 2 otherwise |
Chromatic index | 3 if n is odd 2 otherwise |
Spectrum | [1] |
Properties | 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian |
Notation | Cn |
Table of graphs and parameters |
Close