Sir any reference journal papers to state new methods to find graphs are isomorphic rather that the regular way for any special cases at least been done i have some ideas want to know before i proceed

@Robert: you are right, the problem is certainly in NP. There is strong evidence that it is not NP-complete [R. B. Boppana, J. Hastad, and S. Zachos. 1987. Does co-NP have short interactive proofs?. Inf. Process. Lett. 25, 2 (May 1987), 127-132.].

Despite the significant number of isomorphism algorithms presented in the

literature, till now no efforts have been done to characterize their different

performance in terms of matching time.

I will suggest you those links:

Solving Graph Isomorphism using Parameterized Matching

http://research.microsoft.com/pubs/199681/graphisomorphism.s...

A Performance Comparison of Five Algorithms for Graph Isomorphism

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.98....

Look at  wikipedia ! The complexity of the Graph isomorphism problemis still unknown ! 

Graph is still NP not known but I could state graph properties structural  play a main role in getting the isomorphism where I am almost working will come back once I am concrete

According to famous Laszlo Babai, the problem gets closer to P; it is in Quasi-P:

http://people.cs.uchicago.edu/~laci/quasipoly.html

http://people.cs.uchicago.edu/~laci/2015-11-10talk.mp4

One have been implemented here

http://poincare.matf.bg.ac.rs/~zstanic//scl.htm

see the module Isomorphism classes. The code is open.