Authors: Shashanth. N, Naveen Kumar, Dr Sanjay Dutta
Abstract: Graph isomorphism the problem of finding out whether two graphs are structurally identical or same is one of the most fundamental in various fields such as computer science, chemistry, and biology specifically mathematics and so on .This breakdown deals into several algorithms which are designed to address or evaluate graph isomorphism, some of the algorithms are been studied in this paper those are, is_isomorphic, could_be_isomorphic, fast_could_be_isomorphic, and faster_could_be_isomorphic .Each algorithm preforms using different strategies to evaluate graph similarity, from strict structural comparison to quick preliminary checks based on graph properties. While is_isomorphic uses the VF2 algorithm for precise matching, could_be_isomorphic functions offer faster assessments by evaluating global and local graph properties. However these algorithms possess limitations such as potential false positives and scalability issues for large datasets. The provided flowcharts illustrate the step by step processes involved in each algorithm, which helps in understanding their functionalities. By developing graph isomorphism algorithms researchers can find out new opportunities for applications in network analysis, pattern recognition, and beyond.
