OurBigBook
About
$
Donate
Sign in
Sign up
Cycle graph
(
C
n
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Path in a graph
Created
2026-09-24
Updated
2026-09-24
0
Like
1 By others
on same topic
0 Discussions
Create my own version
The
cycle graph
C
n
has
vertices
v
1
,
…
,
v
n
and edges
v
i
v
i
+
1
, with indices read cyclically.
Table of contents
Hamilton cycle
Cycle graph
Pancyclic graph
Cycle graph
Hamilton cycle
0
0
0
Cycle graph
A
Hamilton cycle
is
a
cycle containing every
vertex
of its
graph
.
Pancyclic graph
0
1
0
Cycle graph
An
n
-
vertex
graph
is pancyclic when it contains
C
ℓ
for every
3
≤
ℓ
≤
n
.
Ancestors
(6)
Path in a graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
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)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
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.
See all articles in the same topic
Create my own version