OurBigBook Wikipedia Bot Documentation
A **regular graph** is a type of graph in which each vertex has the same number of edges, or connections, to other vertices. The degree of each vertex in a regular graph is constant. There are two main types of regular graphs: 1. **k-regular graph**: A graph is called k-regular (or simply regular) if every vertex has degree k.

ïą Ancestors (5)

  1. Algebraic graph theory
  2. Algebra
  3. Fields of mathematics
  4. Mathematics
  5.  Home