Abstract
Polya’s plausible reasoning methods are crucial not only in discovery of mathematics results, modeling methods, and data processing methods but also in many practical problems’ solving. This paper exemplifies how to use Polya’s plausible reasoning methods to generalize the popularized notion of 2‐connectedness of graphs to a more universal notion of the connected degree of fuzzifying matroids. We introduce the connectedness of fuzzifying matroids, which is generalized from 2‐connectedness of graphs, connectedness of matroids, and 2‐connectedness of fuzzy graphs. Moreover, the connected degree of fuzzifying matroids is presented by considering the fuzziness degree of connectedness. It is proved that a fuzzifying matroid is connected, which is equivalent to its connectedness degree is the biggest (i.e., ). This, together with other properties of the connected degree of fuzzifying matroids, demonstrates the rationality of the proposed notion. Finally, we describe the concepts of this paper through some 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.
