ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS

Document Type: Research Paper

Authors

1 Department of Mathematics, The Catholic University of America, Washington, DC 20064, USA

2 Department of Mathematics and Computer Science, Creighton University, Omaha, NB 68178, USA

3 Center for Automation Research, University of Maryland, College Park, MD 20742, USA

Abstract

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.

Keywords


[1] K.R. Bhutani and A. Rosenfeld, Strong arcs in fuzzy graphs, Information Sciences, 152 (2003)
319-322.
[2] K.R. Bhutani, A. Rosenfeld, Fuzzy end nodes in fuzzy graphs, Information Sciences, 152
(2003) 323-326.
[3] S.F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
[4] M. Delgado, J.L Verdegay, M. A. Vila, On fuzzy tree definition, European J. Operations
Research, 22 (1985) 243-249.
[5] C.M. Klein, Fuzzy Shortest Paths, Fuzzy Sets and Systems, 39 (1991) 27-41.
[6] J.N. Mordeson, P.S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, Physica-Verlag, Heidelberg,
2000.
[7] J.N. Mordeson, Y. Y. Yao, it Fuzzy cycles and fuzzy trees, The Journal of Fuzzy Mathematics,
10 (2002) 189-202.
[8] A. Rosenfeld, Fuzzy graphs, in L.A. Zadeh, K.S.Fu, K. Tanaka, and M. Shimura, eds., Fuzzy
Sets and their Applications to Cognitive and Decision Processes, Academic Press, New York
(1975) 77–95.
[9] M.S. Sunitha, A. Vijayakumar, A characterization of fuzzy trees, Information Sciences, 113
(1999) 293-300.