ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS

The notion of strong arcs in a fuzzy graph was introduced by Bhutani and Rosenfeld in (1) and fuzzy end nodes in the subsequent paper (2) using the concept of strong arcs. In Mordeson and Yao (7), the notion of "degrees" for concepts fuzzified from graph theory were defined and studied. In this note, we discuss degrees for fuzzy end nodes and study further some properties of fuzzy end nodes and fuzzy cut nodes.

[1]  Miguel Delgado,et al.  On fuzzy tree definition , 1985 .

[2]  Frank Harary,et al.  Distance in graphs , 1990 .

[3]  C. Klein.  Fuzzy shortest paths , 1991 .

[4]  Ambat Vijayakumar,et al.  A Characterization of Fuzzy Trees , 1999, Inf. Sci..

[5]  John N. Mordeson,et al.  Fuzzy Graphs and Fuzzy Hypergraphs , 2000, Studies in Fuzziness and Soft Computing.

[6]  Azriel Rosenfeld,et al.  Strong arcs in fuzzy graphs , 2003, Inf. Sci..

[7]  Azriel Rosenfeld,et al.  Fuzzy end nodes in fuzzy graphs , 2003, Inf. Sci..