Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/118887We 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.Discrete MathematicsPolynomial Time Symmetry and Isomorphism Testing for Connected Graphstext