Graph Isomorphism in View of Decomposition Technique

Abstract

Graph Isomorphism is anopen problem in graph theory. A large number of graphs have the polynomial time algo-rithms for detection. But in general there are specific algorithms for certain range of vertices. Our try to design a generic algo-rithm. In this paper we proposed an algorithm of O(n3) complexi-ty. The decomposition techniques have been adopted as well as reconstruction conjecture in reverse for taking decision of whether the two graphs are isomorphic or not.The ideology is inherited from DNA isolation in molecular biology [Chomczynski et. al].