Finding the isomorphic graph with the use of algorithms based on DNA

Finding the isomorphic graph is the problem that have algorithms with the complexity time. For this in general, because of classification for algorithms time complexity, this solution stay in NP-complete group. In this essay tried to show the new style for DNA algorithms, until decrease the solution of the problem in vast. This style heel show to exploit of graphs Adjacency matrix representation, to investigate the isomorphic of graphs in proximity matrix by the method of using molecule model and DNA operation to be investigate and determine this isomorphic.