Абстрактный

A Novel Algorithm for Isomorphic Graph

Jyotirmayee Rautaray, Raghvendra Kumar, Garima Bajpai

The graph isomorphism difficulty is very famous; isomorphism problem is still one of the unsolved problems of graph theory. Here in this paper we are dealing with some applications of this problem and major idea behind this is advancement of some accessible graph isomorphism algorithms. In this paper we are also focusing on producing the solution for problems that seems like isomorphic problems but they are not exactly isomorphic