Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

GI and Knot Problem both are problem of deciding structural equivalence of mathematical objects. Are there any results establishing connections between them? Nice connections of knot problem to statistical physics have been explored via knot polynomials, are there similar results for $GI$?

It would be particularly helpful to know if there are any standard results/warnings/suggestions/comments before one start looking into $GI$ motivated by knot problem. Actually, I was wondering if its recommended to explore in this direction for my master's thesis. I am interested in quantum/classical approaches to $GI$ and algebraic problems. Any other suggestions are welcome.

share|cite|improve this question
from mathworld isomorphic graphs: "n some sense, graph isomorphism is easy in practice except for a set of pathologically difficult graphs that seem to cause all the problems. So, unlike knot theory, there have never been any significant pairs of graphs for which isomorphism was unresolved. ... Unfortunately, there is almost certainly no simple-to-calculate universal graph invariant, whether based on the graph spectrum or any other parameters of a graph (Royle 2004)." – vzn Oct 1 '12 at 15:34
Apparently knot equivalence is also easy in practice. – Jeffε Oct 2 '12 at 3:49
I have poster similar question here… also – DurgaDatta Oct 8 '12 at 4:54
To my knowledge, there are no "pathologically difficult" knots that cause all of the problems. It would be very interesting to find a family of unknots that had poor running times on the various unknot recognition programs, either provably or just experimentally. – Sam Nead Feb 24 '14 at 12:00
up vote 17 down vote accepted

One connection is that graph isomorphism and knot isomorphism are both special cases of 3-manifold homeomorphism. In the knot case, two knots are isomorphic if their complements (manifolds formed by deleting the points of the knot from 3-space) are homeomorphic.

And in the graph case it's possible to transform graphs into manifolds in such a way that the graphs are isomorphic if and only if the manifolds are homeomorphic. I wrote a comment about this on a Google+ post last December, but unfortunately not on a post I can share. The construction is to start with a manifold for each vertex v, in the form of the complement in a 3-sphere of a bouquet of degree(v) loops (connected together at a common vertex). For each edge uv, connect the manifolds for u and v together by a surgery, and link one loop from u and one loop from v across the surgery ball. Then every isomorphism of graphs lifts to a homeomorphism of the resulting manifold (this would be true even if we just used surgery on 3-spheres without the bouquets) and the bouquets prevent the manifold from having extra homeomorphisms that don't come from the graph.

share|cite|improve this answer

the more general question is the connection between knot theory and graph theory. as one possible place to start there is a connection between the Jones polynomial (used to classify knots) and the Tutte polynomial of planar graphs. ie in knot theory, the Tutte polynomial appears as the Jones polynomial of an alternating knot. (so maybe there is some connection of knot theory to GI on planar graphs.)

see thms 7,8 in:

Computing the Tutte Polynomial of a Graph and the Jones Polynomial of an Alternating Link of Moderate Size Sekine, Imai, Tani


share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.