Cycle graph
A cycle graph, or circular graph, is a connected \(2\)-regular graph. By itself, it is a single cycle formed by a chain of vertices. The symbol \(C_n\) denotes the cycle graph with \(n\) vertices.
As the number of vertices is increased, cycle graphs more closely resemble circles. Actually, a cycle graph with \(n\) vertices is an "\(n\)-gon."
Cycle graphs with fewer than \(3\) vertices are not simple, as they include parallel edges or self-loops.
Logic & Proofs
Integer •
Rational number •
Inequality •
Real number •
Theorem •
Proof •
Statement •
Proof by exhaustion •
Universal generalization •
Counterexample •
Existence proof •
Existential instantiation •
Axiom •
Logic •
Truth •
Proposition •
Compound proposition •
Logical operation •
Logical equivalence •
Tautology •
Contradiction •
Logic law •
Predicate •
Domain •
Quantifier •
Argument •
Rule of inference •
Logical proof •
Direct proof •
Proof by contrapositive •
Irrational number •
Proof by contradiction •
Proof by cases •
Summation •
Disjunctive normal form
Set Theory
Set •
Element •
Empty set •
Universal set •
Subset •
Power set •
Cartesian product •
String •
Binary string •
Empty string •
Set operation •
Set identity •
Set proof
Functions
Algorithms
Relations
Number Theory
Induction
Combinatorics
Graph Theory
Graph •
Walk •
Subgraph •
Regular graph •
Complete graph •
Empty graph •
Cycle graph •
Hypercube graph •
Bipartite graph •
Component •
Eulerian circuit •
Eulerian trail •
Hamiltonian cycle •
Hamiltonian path •
Tree •
Huffman tree •
Substring •
Forest •
Path graph •
Star •
Spanning tree •
Weighted graph •
Minimum spanning tree •
Greedy algorithm •
Prim's algorithm
Recursion