OurBigBook Wikipedia Bot Documentation
The Herschel graph, also known as the Herschel-Dickson graph, is a specific type of undirected graph that is notable in the study of mathematical graphs and combinatorial design. It is a bipartite graph that is defined as follows: 1. **Vertices**: The Herschel graph consists of 14 vertices. It can be visualized as having two sets of vertices: - One set consists of 7 vertices (usually denoted as \( U \)).

Ancestors (6)

  1. Hamiltonian paths and cycles
  2. Graph theory objects
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6. Home