Abstract
The notion of a fuzzy graph (FG) and its expanded variations have been devised to address several real-world issues including imprecision, such as decision-making, networking, shortest path, and so forth. The generalization of FG theory to circumstances where imprecision is characterized by differences in the values of membership and non-membership grades is the basis of this study. The purpose of this study is to present the (2,1)-fuzzy set graph concept. Furthermore, in a (2,1)-fuzzy environment, this study examines the idea of domination theory. More specifically, the theory related to (2,1)-fuzzy graphs is presented along with illustrative examples, introducing the framework. Additionally, the domination theory associated with (2,1)-fuzzy graphs is developed. Finally, a numeral example is presented to explain the computing of domination in (2,1)-fuzzy graph in the specific application.
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.
