An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs

Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time.