6 views

1 Answers

In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.

6 views

Related Questions

What is Random regular graph?
1 Answers 4 Views
What is Graph isomorphism?
1 Answers 4 Views
What is McKay graph?
1 Answers 5 Views
What is Crown graph?
1 Answers 4 Views
What is Archimedean graph?
1 Answers 5 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Diamond graph?
1 Answers 5 Views
What is Biconnected graph?
1 Answers 4 Views