OurBigBook About$ Donate
 Sign in Sign up

Cycle graph (Cn​)

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory Path in a graph
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
The cycle graph Cn​ has vertices v1​,…,vn​ and edges vi​vi+1​, with indices read cyclically.
  • Table of contents
    • Hamilton cycle Cycle graph
    • Pancyclic graph Cycle graph

Hamilton cycle

 0  0
Cycle graph
A Hamilton cycle is a cycle containing every vertex of its graph.

Pancyclic graph

 1  0
Cycle graph
An n-vertex graph is pancyclic when it contains Cℓ​ for every 3≤ℓ≤n.

 Ancestors (6)

  1. Path in a graph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 122 / 1 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Cycle graph by Wikipedia Bot  1
 View more
A cycle graph, often denoted as \( C_n \), is a type of graph in which a set of vertices are connected in a closed loop. Specifically, in a cycle graph with \( n \) vertices, each vertex is connected to exactly two other vertices, creating a single cycle.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook