This Paper delivers a new algorithm to the problem of graph isomorphism detection. Basically this method is designed in such a way that, a model graph which is known prior is compared with an unknown graph called input graph. Now the problem to be solved is to find a graph isomorphism from the input graph which is given online with the one which is known as model graph. At dynamic time the input graph is compared with the entire model graph for which there exists a graph isomorphism from the input graph are detected. The time complexity depends on the number of input graphs given and size of the graphs. Furthermore it is independent of number of model graphs given and the number of edges in any of the graph