Eric McKinney, Weber State University
Mathematics
We consider a list of properties of isomorphic simple graphs and the use of these properties as quick tests to show nonisomorphic relationships. We compare advantages of tests, and list these in order of efficiency. We consider a nonisomorphic test using cospectral graphs with its drawbacks. And lastly, we observe an algorithmic approach showing two graphs are isomorphic through efficient adjacency matrix reordering techniques.