the notion of strong arcs in a fuzzy graph was introduced bybhutani 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 someproperties of fuzzy end nodes and fuzz...

The notion of strong arcs in a fuzzy graph was introduced byBhutani 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 someproperties of fuzzy end nodes and fuzz...

The fuzzy graph approach is more powerful in cluster analysis than the usual graph – theoretic approach due to its ability to handle the strengths of arcs effectively. The concept of node-strength sequence is introduced and is studied in a complete fuzzy graph. Two new connectivity parameters in fuzzy graphs namely, fuzzy node connectivity ðjÞ and fuzzy arc connectivity ðj0Þ are introduced and ...

Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...

The concept of fuzzy magic labeling is introduced.Fuzzy magic labeling for some graphs like path, cycle and star graph are defined. It is proved that, every fuzzy magic graph is a fuzzy labeling graph, but the converse is not true. And we show that the removal of a fuzzy bridge from a fuzzy magic graph G, such that G* is a cycle with odd number of nodes is a fuzzy magic graph.And also some prop...

In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...

investigation of reliability characteristics under fuzzy environments is proposed in this paper. fuzzy weibull distribution and lifetimes of components are using it described. formulas of a fuzzy reliability function, fuzzy hazard function and their α-cut set are presented. furthermore, the fuzzy functions of series systems and parallel systems are discussed, respectively. finally, some numeric...

Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...

Fuzzy Graphs are having numerous applications in problems like Network analysis, Clustering, Pattern Recognition and Neural Networks. The analysis of properties of fuzzy graphs has facilitated the study of many complicated networks like Internet. In this paper we study the structures of complement of many important fuzzy graphs such as Fuzzy cycles, Blocks etc. The complement of fuzzy graphs wi...