Professional Documents
Culture Documents
=(I,E) where
I ={u I o(u) >0}and
E = {(u,:) I I:p(u,:) >0}.
Definition 5: The order p and size q of the
fuzzy graph 0 =(o,p) are defined by
p = o(:)
uv
and q = p(u,:)
(u,)L
.
Definition 6: Let G be a fuzzy graph on V and
SV, then the fuzzy cardinality of S is defined
to be o(u)
uS
.
Definition 7: The strength of the
connectedness between two nodes u, v in a
fuzzy graph G
is p
(u,:) =sup{p
k
(u,:):k =
1,2,3..}where
p
k
(u,:) =
sup _
p(u,u
1
)p(u
1
,u
2
)p(u
2
,u
3
)
p(u
3
,u
4
).p(u
k-1
,:)
_.
Definition 8: An arc (u, v) is said to be a
strong arc if (u, v) =p
(u,:) If p (u,:) =
0 for every : I, then u is called an isolated
node.
Let us now define dominating set, minimum
dominating set and domination number in a
fuzzy graph
Definition 9: Let 0(I,p,p) be a fuzzy graph
and I , is a dominating set if for every
Volume: 02, October 2013, Pages: 248-250 International J ournal of Computing Algorithm
Integrated Intelligent Research (IIR) 249
u I S there exist : such that (i)
(u,:) is a strong arc and (ii)p(u) p(:).
v3
v4
v5
(1)
(0.4)
(0.5)
0.6
0.4
0.3
0.5
0.7
0.5
0.7
v1(0.8)
v2
Figure 1 D = {V
2
, V
5
}
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 sumof membership values of the
vertices of a minimumdominating set.
3. Main Results
Proposition 1: A fuzzy graph remains
connected even after removal of all weak
edges in it.
Proof:
Let G be a fuzzy graph and ) , ( v u
denotes
the strength of connectedness
between two vertices u and v. Let e be a weak
edge in G and0
i
=0 c.
To prove: 0
i
is connected.
Let us prove this by method of contradiction.
Assume that 0
i
is a disconnected graph.
Suppose that the weak edge c =(u,:) makes
the graph0
i
disconnected into more than one
component. That implies that there is no path
between u and v except the edge c =(u,:) in
G. Therefore ) , ( v u = ) , ( v u
which is a
contradiction.
An Algorithm to find Dominating set
Step 1: Find ) , ( v u
v
2
, theny() y(I ).
Proof: Let us assume y() <y(I ) .Then
number of vertices in D must be less than
number of vertices in I .Therefore
|| <|I |.But || +|I | = |I|,
Volume: 02, October 2013, Pages: 248-250 International J ournal of Computing Algorithm
Integrated Intelligent Research (IIR) 250
|I | =|I| || >||, |I| >2|| .Then
|| <
v
2
Proposition 6: If (D) <y(V D), then there
exists at least one v D dominates two or
more vertices of I , where D is a
minimumdominating set.
Proof: Suppose no vertices of D dominates
two or more vertices of I .Then every
vertices in D dominates a vertex inI ,
which implies || =|I | .This implies
that. y() y(I ) 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
i
is a dominating set of
the supp G, then || |
i
|.
Conclusion: In this paper we define a
dominating set, minimumdominating set and
domination number in a fuzzy graph and an
algorithmis also formulated for finding a
dominating 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.