OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Herschel graph

 Home Mathematics Fields of mathematics Graph theory Graph theory objects Hamiltonian paths and cycles
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook