Abstract

The concept of matching in graph theory is very important. Now, in this paper we considered the notion of matching in fuzzy graphs and we generalized this concept. First we defined the notions of (maximum) matching edge-fuzzy number and (maximum) matching vertex-fuzzy number. Then we compare them by (maximum) matching crisp number and get related results. Finally we give an application.

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 call

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.