Year-end Sale % OFF 
Abstract
Graph Isomorphism is anopen problem in graph theory. A large number of graphs have the polynomial time algo-rithms for detection. But in general there are specific algorithms for certain range of vertices. Our try to design a generic algo-rithm. In this paper we proposed an algorithm of O(n3) complexi-ty. The decomposition techniques have been adopted as well as reconstruction conjecture in reverse for taking decision of whether the two graphs are isomorphic or not.The ideology is inherited from DNA isolation in molecular biology [Chomczynski et. al].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
