Abstract
The concept of connectivity plays an important role in both theory and applications of fuzzy graphs. Depending on the strength of an arc, this paper classifies arcs of a fuzzy graph into three types namely α -strong, β -strong and δ -arcs. The advantage of this type of classification is that it helps in understanding the basic structure of a fuzzy graph completely. We analyze the relation between strong paths and strongest paths in a fuzzy graph and obtain characterizations for fuzzy bridges, fuzzy trees and fuzzy cycles using the concept of α -strong, β -strong and δ -arcs. An arc of a fuzzy tree is α -strong if and only if it is an arc of its unique maximum spanning tree. Also we identify different types of arcs in complete fuzzy graphs.
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.
