Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs
Discrete Mathematics
2007-05-23 v1
Abstract
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
Cite
@article{arxiv.cs/0612001,
title = {Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs},
author = {Matthew Delacorte},
journal= {arXiv preprint arXiv:cs/0612001},
year = {2007}
}