FREE NODES AND BUSY NODES OF A FUZZY GRAPH

A. Nagoorgani, V. Chandrasekaran

East Asian Mathematical Journal · 2006 · 10 citations · 1 references

Concepts

Abstract

Abstract. In networking, it is essential to analyse the nodesalong with their neighbours. The properties of fuzzy finite graphsare very much useful in obtaining solutions to many problems liketraffic congestion problem. In this paper, free nodes and busynodes are defined and the properties of nodes are examined atvarious levels of their degrees. 1. IntroductionA fuzzy subset [3] of a nonempty set S is a mapping σ : S → [0,1].A fuzzy relation on S is a fuzzy subset of S ×S. If µ and ν are fuzzyrelations, then µ ◦ ν(u,w) = sup{µ(u,v) ∧ ν(v,w) : v ∈ S} and µ k =sup{µ(u,u 1 )∧µ(u 1 ,u 2 )∧µ(u 2 ,u 3 )∧...∧µ(u k−1 ,v) : u 1 ,u 2 ,...u k−1 ∈ S},where ∧ stands for minimum. A fuzzy graph is a pair of functionsσ : V → [0,1] and µ : V × V → [0,1], where for all u,v ∈ V, wehave µ(u,v) ≤ σ(u) ∧ σ(v). The degree of a vertex v is defined byd(v) = Σ u6= v µ(v,u).Apathρinafuzzygraphisasequenceofdistinctnodesv 0 ,v 1 ,v 2 ,...,v n such that µ(v i−1 ,v i ) > 0,1 ≤ i ≤ n; here n ≥ 0 is called the lengthof the path ρ. The consecutive pairs (v

References

1