A novel approach for graph isomorphism: Handling large graphs

Graph Isomorphism has been proved as most crucial and very difficult process in Pattern Matching. The Graph Isomorphism problem is to check if two graphs are similar or not based on different properties like degree, vertex, edges etc. Two graphs are Isomorphic if they satisfy above properties. A Novel Approach is proposed for Graph Isomorphism Detection Problem (GIDP) based on two different methods. First method is to match an Input Graph with a Model Graph and second method is to match an input graph to the set of Model Graphs (Database of Model Graphs). This Novel Approach is used to solve Isomorphic Problems in an efficient way. Numbers of experiments are performed on large graphs and compared its performance with well-established algorithms like Ullman and VF2.