An improved algorithm to discover isomorphism

Despite the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that we still need such an efficient algorithm for graph isomorphism which is applicable on all the general graphs. We propose an improved algorithm for discovering graph isomorphism. The emphasis is on the power of algorithm for solving practical problems and making the algorithm more efficient. The algorithm works for all kinds of undirected graphs.