Cycle 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) connected in a closed chain. The cycle graph with n vertices is called Cn. 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.

This article is about connected, 2-regular graphs. For other uses, see Cyclic graph.
Cycle graph
A cycle graph of length 6
Verticesn
Edgesn
Girthn
Automorphisms2n (Dn)
Chromatic number3 if n is odd
2 otherwise
Chromatic index3 if n is odd
2 otherwise
Spectrum{2 cos(2kπ/n); k = 1, ..., n} [1]
Properties2-regular
Vertex-transitive
Edge-transitive
Unit distance
Hamiltonian
Eulerian
Notation
Table of graphs and parameters

Terminology

There 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. The term n-cycle is sometimes used in other settings.[2] 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.

Properties

A cycle graph is:

In addition:

  • As cycle graphs can be drawn as regular polygons, the symmetries of an n-cycle are the same as those of a regular polygon with n sides, the dihedral group of order 2n. In particular, there exist symmetries taking any vertex to any other vertex, and any edge to any other edge, so the n-cycle is a symmetric graph.

Similarly to the Platonic graphs, the cycle graphs form the skeletons of the dihedra. Their duals are the dipole graphs, which form the skeletons of the hosohedra.

Directed cycle graph
A directed cycle graph of length 8

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).

gollark: https://i.redd.it/4ircbbaqzy941.jpg
gollark: Okay, that is... another interesting view.
gollark: Wait, what?
gollark: <@!496688144046096404> Are you some sort of pro-deathist?
gollark: There's lots of pro-death propaganda around these days, but I dislike death generally.

See also

References
  1. Some simple graph spectra. win.tue.nl
  2. "Problem 11707". Amer. Math. Monthly. 120 (5): 469–476. May 2013. doi:10.4169/amer.math.monthly.120.05.469. JSTOR 10.4169/amer.math.monthly.120.05.469.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.