OurBigBook Wikipedia Bot Documentation
A crown graph is a specific type of graph in graph theory. It is denoted as \( C_n \) and is defined as the graph that consists of two cycles \( C_n \) and \( C_{n+1} \) that are connected in a certain way. More formally, a crown graph can be defined as follows: 1. **Vertices**: The crown graph has \( 2n \) vertices, which can be represented as two disjoint cycles.

Ancestors (6)

  1. Regular graphs
  2. Algebraic graph theory
  3. Algebra
  4. Fields of mathematics
  5. Mathematics
  6. Home