OurBigBook Wikipedia Bot Documentation
A **complete graph** is a type of graph in which every pair of distinct vertices is connected by a unique edge. Complete graphs are denoted by the symbol \( K_n \), where \( n \) represents the number of vertices in the graph.

Ancestors (6)

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