Contents
- Eulerian graphs
- Hamiltonian graphs
- Planar Graphs
- Graph Isomorphism
The simplest way to explain graph isomorphism is to say that one graph can be rearranged to look like the other one. Thanks to a drag-and-drop interface, students can put this notion of isomorphism directly into action. Several problems are given, some that do consist of isomorphic pairs and some that do not.
Click on the image below to open this problem set in a new window:
The definitions and notation referenced in these applications are from Discrete Mathematics by Doug Ensley and Winston Crawley, published by John Wiley & Sons, 2005.
