what are the applications of the isomorphic graphs? While studying data structures i was told my instructor that even i am given 3 hour/30 days/3 years to find out whether two graphs are isomorphic or not, it is  very very complex and even after spending this much amount of time i will not able to figure out clearly whether the given two graphs are isomorphic or not. It is NP-complete problem.
So i got the curiosity that why i am studying it then. What could be the possible applications of such isomorphic graphs which can be solved ? 

If your question is actually: "what are possible applications of the isomorphism problem", then check this: http://en.wikipedia.org/wiki/Graph_isomorphism_problem#Applications
Another very interesting application of the isomorphism problem is the development of algorithms for fingerprint matching http://euler.mat.ufrgs.br/~trevisan/workgraph/regina.pdf
