Fuzzy end nodes in fuzzy graphs

Authors:
Kiran R. Bhutani;Azriel Rosenfeld
Affiliations:
Department of Mathematics, The Catholic University of America, Washington, DC;Computer Vision Laboratory Center for Automation Research, University of Maryland, College Park, MD
Venue:
Information Sciences: an International Journal
Year:
2003

Citing 1
Cited 6

A characterization of fuzzy trees

Information Sciences: an International Journal

Strong arcs in fuzzy graphs

Information Sciences: an International Journal
Types of arcs in a fuzzy graph

Information Sciences: an International Journal
Node connectivity and arc connectivity of a fuzzy graph

Information Sciences: an International Journal
Bipolar fuzzy graphs

Information Sciences: an International Journal
Menger's theorem for fuzzy graphs

Information Sciences: an International Journal
Cycle connectivity in fuzzy graphs

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Recent Advances in Soft Computing: Theories and Applications

Quantified Score

Hi-index	0.07

Visualization

Abstract

We define a fuzzy end node in a fuzzy graph, and show that no node can be both a cut node and a fuzzy end node. In a fuzzy tree, every node is either a cut node or a fuzzy end node, but the converse is not true. We also show that any nontrivial fuzzy tree has at least two fuzzy end nodes, and we characterize fuzzy cycles that have no cut nodes or no fuzzy end nodes.