Abstract
Graph Isomorphism is the illustration of same graph in more than one pattern. In order to check that the graphs are isomorphic it should follow some properties. Graphs have many real life applications. Here we are considering Intuitionistic Fuzzy Graphs. As it is extended from crisp graph, Intuitionistic fuzzy graphs have all the properties of crisp graphs. Intuitionistic Fuzzy graph theory is tracking down an expanding number of uses in demonstrating genuine frameworks and circumstances where the level of data is uncertain. In the field of networks, one has to take into account whether two networks are similar or not. In this context studying isomorphism of Intuitionistic Fuzzy graphs become important. In this paper we propose algorithms to check weak isomorphism and co-weak isomorphism between Intuitionistic Fuzzy Graphs. We have applied this algorithms to detect Intuitionistic Fuzzy Graph isomorphism with the suitable examples.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
