Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume 02, Issue 02, December 2013, Page No.81-82

ISSN: 2278-2397

On Domination in Fuzzy Graphs

D.Antony Xavior1, D.Florence Isido1, V.M.Chtira2
1
Department of Mathematics, Loyola College, Chennai
2
SKR Engineering College, Poonamalee, Chennai
Email: [email protected]

Abstract - A set D ⊂ V of a given fuzzy graph G ( V , ρ , μ )is a μ :V × V → [ 0,1 ] where μ(u , v)≤ σ ( u ) σ ( v ) for all u , v ∈V
dominating set if for every u ∈V −Dthere exists v ∈ D such .
that (u , v ) is a strong arc and ρ(u) ≤ ρ(v ) and if the number
of vertices of D is minimum then it is called a minimum Definition4: The underlying crisp graph of G=(σ , μ) is
dominating set of G. Domination number of G is the sum of ¿
denoted by G =(V , E) where
membership values of vertices ofa minimum dominating set D
and it is denoted by γ (D). In this paper we study domination V = { u∈ V :σ (u)>0 }and
in fuzzy graphs. Also we formulate an algorithm to find E={ ( u , v ) ∈V ×V : μ (u , v )> 0 }.
dominating set for a given fuzzy graph.
Definition5: The order p and sizeq of the fuzzy graph
Keywords: fuzzy domination, strong arc, weak arc, strength of
connectedness. G=(σ , μ) are defined by
p= ∑ σ ( v ) andq= ∑ μ(u , v ).
I. INTRODUCTION u ∈V (u , v)∈ E

It is quite well known that graphs are simply models of

relations. A graph is a convenient way of representing Definition6: Let G be a fuzzy graph on V and S⊆V, then the
information involving relationship between objects. The fuzzy cardinality of S is defined to be ∑ σ (u).
objects are represented by vertices and relations by edges. u ∈S
When there is vagueness in the description of the objects or in
its relationships or in both, it is natural that we need to design a Definition 7: The strength of the connectedness between two
Fuzzy Graph Model.
nodes u, v in a fuzzy graph G is μ∞ ( u , v ) ={ μ ( u , v ) :k =1,2,3. . }
k

¿
Application of fuzzy relations are widespread and important;
especially in the field of clustering analysis, neural networks, where k
μ (u , v ) =
{μ ( u ,u1 ) ⋀ μ ( u1 , u2) ⋀ μ (u2 ,u3 )
⋀ μ(u3 ,u4 )⋀ …. μ (u k−1 , v) } .
computer networks, pattern recognition, decision making and
expert systems. In each of these, the basic mathematical
structure is that of a fuzzy graph. Definition8: An arc (u, v) is said to be a strong arc if μ (u, v) =
∞
μ (u , v) If μ(u , v)=0 for every v ∈V , then u is called an
Harary et al[2] explained an interesting application in voting
isolated node.
situations using the concept of domination in graphs.
Rosenfeld[4] introduced the notion of fuzzy graph and several
fuzzy analogs of graph theoretic concepts such as paths, cycles Let us now define dominating set, minimum dominating set
and connectedness. Somasundaram A. and Somasundaram S. and domination number in a fuzzy graph
[5] discussed about domination in fuzzy graph. The concept of
strong arcs was introduced by Bhutani[1] in which an arc of a Definition 9: Let G(V , ρ , μ) be a fuzzy graph and
fuzzy graph is strong if and only if its weight is equal to the D ⊑V , D is a dominating set if for every u ∈V −S there
strength of connectedness of its end nodes. In this paper we
exist v ∈ D such that (i) (u , v ) is a strong arc and (ii)
define dominating set in a fuzzy graph G ( V , ρ , μ )connecting
the concepts of strong arcs and membership values of vertices ρ(u) ≤ ρ¿ ).
of G.

II. PRELIMINARIES

Let us see the following basic definitions in a fuzzy graph. [3].

Definition 1: A fuzzy subset of a nonempty set V is a mapping
σ : V ⟶ [ 0,1 ] .
Definition 2: A fuzzy relation on V is a fuzzy subset of V × V.
Definition 3: A fuzzy graphG=(σ , μ) is a pair of function
σ : V → [ 0,1 ] and
1
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume 02, Issue 02, December 2013, Page No.81-82
ISSN: 2278-2397

Figure 1 D = {V2, V5}

Definition 10: A dominating set of a fuzzy graph with

minimum number of vertices is called a minimum dominating
set.
Definition 11:Domination number of a fuzzy graph is the sum
of membership values of the vertices of a minimum Figure 2 different steps of the above algorithm
dominating set.
III. MAIN RESULTS In the above Fuzzy graph the dominating set is D= { v 2 , v 4 } .

Proposition1: A fuzzy graph remains connected even after Proposition 2: In a fuzzy cycle all arcs are strong arcs.
removal of all weak edges in it.
Proof: Let G be a fuzzy cycle. Assume that all arcs are not
Proof: strong arcs.Then there exist at least one weak edge inG. Let us
∞ discuss the proof in two cases.
Let G be a fuzzy graph and μ (u,v ) denotes the strength of
connectedness between two vertices u and v. Let e be a weak Case 1: Only one weak edge exists.The membership value of
edge in G andG ' =G−e. the edgeis minimum.

To prove: G ' is connected. But in fuzzy cycle there should be at least two edges with
minimum membership valuewhich is a contradictionto our
assumption.
Let us prove this by method of contradiction. Assume that G ' is
a disconnected graph. Suppose that the weak edge e=(u , v ) Case 2:more than two edges with minimum membership value.
makes the graphG ' disconnected into more than one Then the edges will not be weak edges.
component. That implies that there is no path between u Proposition 3: Let D be a dominating set of a fuzzy graph
and v except the edge e=(u , v )in G.Therefore μ(u,v) = G.Then for each v ∈ D , there is no vertex in D dominates v.
∞
μ (u,v ) which is a contradiction. Proposition 4:Let D be a dominating set of a fuzzy graph G
then no bridge exists between any two vertices ofV −D .
An Algorithm to find Dominating set Proof: Suppose there exists a bridge between any two
∞
Step 1: Find μ (u,v ) for all edges (u , v )
u , v ∈V −D.Then (u,v) is a strong arc. Then either u
Step 2: Delete all the weak edges dominates v or v dominates u or v dominates u.Therefore
eitheru ∈ D∨v ∈ D .
Step 3: Select the vertex u with maximum ρ (u) in G
'

Step 4: Group the vertices dominated by u, as V 1 Proposition 5: Let D be aminimum dominating set of a fuzzy

|V2 |
'
Step 5: Find G −V 1
graph G.If|D|≥ , then γ ( D)≥ γ(V −D) .
Step 6: Repeat the steps 3 to 5 until we get isolated vertices.
Step 7: The collection of vertices selected in step 3 and the
isolated vertices will form a dominating set.
Proof: Let us assume γ ( D)<γ (V −D) .Then number of
IV. AN ILLUSTRATION vertices in D must be less than number of vertices in V −D
.Therefore |D|<|V −D|.But|D|+|V −D|=|V |,
|V −D|=|V |−|D|>|D|,|V |>2|D| .Then |D|< |V2 |
2
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume 02, Issue 02, December 2013, Page No.81-82
ISSN: 2278-2397

Proposition 6: If γ ( D )< γ ( V −D ) ,then there exists atleast

one v ∈ D dominates two or more vertices ofV −D , where D
is a minimum dominating set.

Proof: Suppose no vertices of D dominates two or more

vertices of V −D .Then every vertices in D dominates a
vertex inV −D , which implies |D|=|V −D| .This implies
that. γ ( D)≥ γ(V −D) by definition of domination
It is easy to prove the following property.

Proposition 7: Let D be a dominating set of a fuzzy graph G

and D ' is a dominating set of the supp G,then |D|≥|D '|.

V. CONCLUSION

In this paper we definea dominating set, minimum dominating

set and domination number in a fuzzy graph and an algorithm
is also formulatedfor finding adominating set of a fuzzy graph.
Various results regarding the domination number of a fuzzy
graph are discussed.

REFERENCES
[1] K.R. Bhutani,“Strong arcs in fuzzy graphs” information Science, 152,
(1989), pp.319-322.
[2] F. Harary, “Graph Theory”, Addison-Wesley, Reading, MA, 1969.
[3] A.Nagoor Gani, and V.T.Chandrasekaran, “Domination in Fuzzy Graph”,
Advances in Fuzzy Sets and Systems, 1 (1) (2006), 17-26.
[4] A. Rosenseld, “Fuzzy graphs” In L. A.Zadeh, K.S Fu and M.
Shimura(Eds.),Fuzzy sets and Their Applications. AcademicPress, New
York.
[5] A.Somasundaram, S.Somasundaram, “Domination in Fuzzy Graphs-I”,
Elsevier science, 19 (1998) 787-791. Discrete mathematics 33(1981)
249-258.
[6] A. Somasundaram, S. Somasundaram “Domination in fuzzy graphs I”
Pattern Recognition Letters, 19, (1998),pp.787-791.