 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
In graph theory, a Harris graph is defined as an Eulerian, tough, non-Hamiltonian graph. Harris graphs were introduced in 2013 when, at the University of Michigan, Harris Spungen conjectured that a tough, Eulerian graph would be sufficient to be Hamiltonian. However, Douglas Shaw disproved this conjecture, discovering a counterexample with an order of 9 and a size of 14. Currently, there are 241,375 known Harris graphs. The minimal Harris graph, the Hirotaka graph, has an order of 7 and a size of 12.
Making a Harris graph
Flowering a Harris graph
A k-barnacle is a path between two nodes of length k where every node on the path has a degree of 2. Flowering is the process of adding a 2-barnacle between two nodes on the shortest path between two odd-degree nodes. Flowering a tough, non-Hamiltonian graph that has an even number of nodes with odd degrees produces a Harris graph.
Grafting two Harris graphs into one
If a 5-wheel is added between one edge in one Harris graph and another edge in another Harris graph, and two nodes from each 5-wheel are connected to each other that were not connected to the original graph, then the result will be one Harris graph.
Replacing edges with barnacles
Replacing an edge from an existing Harris graph with a 2-barnacle creates a Harris graph since all old degrees will be preserved, while the barnacle has a degree of 2 by definition, so the graph is still Eulerian. Since it is now even harder for the graph to be Hamiltonian, and since the graph's toughness remains the same, adding a barnacle anywhere keeps the graph Eulerian, tough, and non-Hamiltonian.
Types
The Hirotaka graph is the minimal Harris graph with order 7 and size 12. Douglas Shaw proved it to be minimal, and Java code written by Shubhra Mishra and Marco Troper proved it unique.
The first Harris graph discovered was the Shaw graph, which has order 9 and size 14.
The minimal barnacle-free Harris graph, or the Lopez graph, has order 13 and size 33. It was created in response to a conjecture that barnacle-free Harris graphs do not exist.
History
After Harris Spungen made his conjecture in 2013, Doug Shaw shortly discovered a counterexample, the Harris graph. Jayna Fishman and Elizabeth Petrie found two more Harris graphs in the same year. Over the next few years, three more Harris graphs were discovered, until Hirotaka Yoneda discovered what was thought to be the minimal Harris graph in 2018. In 2023, Akshay Anand implemented a Harris graph checker in Java. That same year, 241,375 Harris graphs were found of order 12 or less, and the Hirotaka graph was proven to be unique by code written by Shubhra Mishra and Marco Troper.
Applications
Harris graphs are particularly valuable in teaching graph theory because they possess easily understandable properties and methods for finding and verifying them. They offer an ideal balance between challenge and accessibility, making them an engaging problem for students at various levels.
Working with Harris graphs encourages students to experiment with different concepts and solutions, promoting creativity and mathematical thinking. This process keeps students engaged and collaborating with each other, as they often work together to verify potential solutions, enhancing teamwork and collective problem-solving skills.
References
- ^ Mishra, Shubhra. "Harris Graph Repository". sites.google.com. Retrieved 5 July 2024.
- ^ Gandini, Francesca; Mishra, Shubhra; Shaw, Douglas (18 December 2023). "Families of Harris Graphs". arXiv:2312.10936 .
- ^ Shaw, Douglas (16 November 2018). "Harris Graphs—A Graph Theory Activity for Students and Their Instructors". The College Mathematics Journal. 49 (5): 323–326. doi:10.1080/07468342.2018.1507382 – via tandfonline.
- Anand, Akshay (12 July 2023). "Harris Graph Checker". Retrieved 7 July 2024.