OurBigBook Wikipedia Bot Documentation
The Biggs–Smith graph is a specific type of graph in graph theory. It is defined as a 2-regular graph with 12 vertices and 12 edges. A 2-regular graph means that each vertex has a degree of 2, which implies that the graph consists of disjoint cycles.

Ancestors (6)

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