Beruflich Dokumente
Kultur Dokumente
ON
CHAPTER
III
CHAPTER
II
CHAPTER
I
BASIC
DEFINITIO
N
INTRODUTI
ON
INTRODUCTION
theory, etc.
all arcs are strong in the sense of[4]. But in fuzzy graphs it is
authors Sunil Mathew and Sunitha [13] classify strong arcs into
two types namely -strong and -strong and introduce two other
types of arcs in fuzzy graphs which are not strong and are termed
number of colors such that no two adjacent vertices should have the
DEFINITION 1.1:
GF
introduced by M.Blue[14]. Fuzzy graph is a graph satisfying
GF 1 G1 G2 G3 GF
(i) ={ , , ,, } where fuzziness is on
Gi
each graph .
GF 2 EF
(ii) = {V, } where the edge set is fuzzy.
GF 3 tF hF
(iii) = {V, E( , )} where both the vertex and
edge set are crisp, but the edges have fuzzy head h(
ei ei
) and fuzzy tail t( ).
GF 4 VF
(iv) ={ , E} where the vertex set is fuzzy.
GF 5 wF
(v) = {V, E( )} where both the vertex and edge
GF 2 GF 4 GF 2 G F 4
combination of and . So fuzzy graph G= .
We can define this fuzzy graph using the membership values of
vertices and edges. Let V be a finite non empty set. The triple
min{(u) , (v)} for all u,v V.
Fig 1.1
and ={1,1,1,0.5}.
(i,j) =1 if (i,j) E
=0 otherwise
Definition 1.2:
G V , E
The cut of fuzzy graph defined as =( ,,)
V E
where ={v V | } and ={e E }.
Definition 1.3:
u1, u2 ,u 3 .. u n ui1, ui
such that ( ) 0 ; i=1,2,3 ..n and the degree
ui1 ,ui
strength of the path is defined as min(( )).
Example 1.4:
xuv consist of two edges xu and uv are 0.1 and 1. The strength of
Definition 1.5:
Definition 1.6:
The strength of connectedness between two nodes x and
CONN G ( x , y ) .
between x and y is denoted by An x- y path P is
CONN G
called strongest x-y path if its strength equal to (x,y).
Example 1.7:
In Fig 2.1, the paths between x and u nodes are xu, xwu,
of path the xwu is the minimum value between two edges xw and
CONN G
is also 0.5 . The (xu) is maximum of the strengths of all
CONN G
paths between x and u . So the (xu) =Max(xu, xwu, xwvu)
Definition 1.8 :
CONN G ( x , y )
An arc (x,y) of G is called -strong if (xy)
(x,y) .
Definition 1.9 :
CONN G ( x , y )
An arc (x,y) of G is called -strong if (xy) =
(x,y) .
Definition 1.10 :
CONN G ( x , y )
An arc (x,y) of G is called -strong if (xy)<
(x,y) .
Definition 1.11:
Definition 1.12 :
all its arcs are -strong and is called -strong path if all its arcs
are -strong.
Example 1.13 :
Let G : (V,E,,) where V=(u,v,w,x) E = {uv,vw,uw,wx,ux}
Now we will classify all the arc as -strong, -strong and -strong.
CONN G(U , V )
After deleting the arc uv the value of is
CONN G(U , V )
= Max{min(uw,wv), min(ux,xw,wv)}
= Max{min(0.4,1),min(0.1,0.3,1)}
= Max{0.4,0.1}=0.4
CONN G(U , V )
The value of (uv) is greater then so uv is -
strong arc. Similarly, we can show that (v,w) are -strong arc. For
G is an f-bridge if and only if it is -strong.
Proof :
By theorem 4 of [19],
CONN G
(x,y) = (x,y) ____________(2.2)
CONN G(x , y)
(x,y) > (x,y)
Conversely
that (x,y) is the unique strongest path from x to y and the removal
Theorem 2.2 :
Proof :
CONN G(x , y)
(x,y) > (x,y) _________(2.3)
Assume that (x,y) is not in F. Then by definition of an f-tree,
CONN F
(x,y) > (x,y) _________(2.4)
CONN G(X ,Y )
From (2.4) and (2.5) we get (x,y) < (x,y) which
Conversely,
CONN G(x , y)
(x,y) < (x,y)
Theorem 2.3:
strong arc .
Proof:
CONN F
(x,y) < (x,y) ___________(2.6)
CONN F CONN G ( x, y )
(x,y) (x,y) ___________(2.7)
CONN G(x , y)
(x,y) < (x,y)
Conversely,
Theorem 2.4:
Proof :
Assume G is an f-tree.
Conversely,
path in G .
Assume that P is a strong x y path.
All arcs of G are -strong. Then by definition,
CONN G(x , y)
(x,y) = (x,y) = strength of P _______(2.8)
CONN G
(x,y) = (x,y) _______(2.9)
CONN G
(x,y) = strength of P ,
(ii) (i)
x y path,
model with fission of type I fuzzy set. This fission of fuzzy set
high and if the number of vehicles in any path is low then its
Fig 3.1
Since the four right turns do not interfere with the
other traffic flows, they can safely be dropped from our discussion.
The remaining traffic directions are shown in fig 5.2 and are
less than 5000 per hour than we consider the membership value of
vertex A B C D E F G H
M H M L M H M L
traffic flows.
I this problem, we represent each traffic flow using the
upon the number of the vehicle of that road. Two vertices are
high(H).
Fig 3.2
has low (L) membership value and another node has medium(M)
one adjacent vertex is high (H) and another has low (L) membership
Edges AH AG AF AC BC BD BH BE
L M H M H M M H
Edges CH DE DF DG GE FG FH CE
L L M L M H H M
Table 2 : Membership values of the edges
CONN G
and (x,y) of an arc (x,y) in a fuzzy graph G. We can
1. Obtain G-e .
CONN Ge
2. Find the value of .
CONN Ge
3. (a) If x > then e is -strong accidental zone.
CONN Ge
(b) If = x then e is -strong accidental zone.
CONN Ge
(c) If > x then e is -strong accidental zone.
4. Repeat steps 1-4 for all arcs in G.
of a city.
the least value of k for which the fuzzy graph G has k-fuzzy
defined as follows.
1, 2 k
A family ={ .. } of fuzzy sets on V is
(a) V =
1 2
(b) =0
1 2
(c) For every strong edges xy of G, min { (x), (y)}=0 (1 i
k)
1 , 2 , 3 , 4
Let = { } be a family of fuzzy sets
defined on V by
{ {
M if i= A H if i=B
1 (v i ) M if i=E 2 (v i ) H if i=F
= =
0 otherwise 0 otherwise
{
L if i=D
3 vi L if i=D 4 vi
( )= ( )=
o otherwise
{
M if i=C
M if i=C
0 otherwise
1 , 2 , 3 , 4
Here we can see that the family = { }
fuzzy graph in our example have 4-fuzzy vertex coloring and this
is the minimal vertex fuzzy coloring since any family with less
cycle time T. So the duration of the all phase will be equal and
H need T time to pass all the vehicles then B and F will need
give the duration time of the traffic light depends upon on the
flow the all vehicles. In this problem duration of the phase 2 will
x , x
is a fuzzy set (G) ={( )} where is the chromatic
G
number of which is a crisp graph for all . Then we find
G
minimum number of color needed to color the graph . In
G L VL EL
For = L =( , )
VL
where ={A,B,C,D,E,F,G,H|(v)L} and
EL = {AC,AF,AG,AH,BC,BD,BE,BH,CE,CH,DE,DF,DG,EG,FG,FH|
L}
Thus, for fuzzy graph of Fig 4.2, L= (GL ) = 4.
Fig 4.2 :
Fig 4.3 :
GM V M , EM VM
For =M, =( ) where ={A,B,C,E,F,G|(v) M}
EM
and = {AC,AF,AG,BC,BE,CE,EG,FG | M}
Thus for fuzzy graph of Fig 4.3, M = (G M ) = 3
GH V H , EH
For =H, = ( ) where
V L ={B , F (v ) H } EL
and ={ |
H}
H = ( GH ) =
Thus, for fuzzy graph of Fig 4.4 , 1.
Fig 4.4 :
The chromatic number of a fuzzy graph is a
between nodes and less colors are needed. The chromatic number
problem.
G
colors needed to color the crisp graph will be computed. In
CONCLUSION
In this concept of crisp incompatibly among the nodes
The chromatic number of G is (G)={(4,L),(3,M),
flow.