Download Full Text (511 KB)
This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that consists of two sets, a set of vertices and a set of edges. An edge joins two vertices and depicts a relationship between those vertices. Two graphs are said to be isomorphic if they have the same structure; their vertices can be relabeled and arranged so that the graphs look identical. This project investigates measures for determining how “close” two non-isomorphic graphs are to being isomorphic. We will explore questions such as whether two graphs can have a unique greatest common subgraph.
Aparna W Higgins
Primary Advisor's Department
Stander Symposium poster
"Distance Between Graphs" (2019). Stander Symposium Posters. 1648.