Вы находитесь на странице: 1из 5

International Conference on Computing and Intelligence Systems Pages: 1374 – 1378

Volume: 04, Special Issue: March 2015 ISSN: 2278-2397

Intuitionistic Double Layered Fuzzy Graph and its Cartesian Product Vertex Degree

J. Jesintha Rosline 1 , T. Pathinathan 2

1 2 PG & Research Department of Mathematics, Loyola College, Chennai, India Email: jesi.simple@gmail.com, pathimathsloyola@gmail.com

Abstract - The intuitionistic double layered fuzzy graph gives a 3-D structural view to a fuzzy graph. To find the cartesian product of two intuitionistic double layered fuzzy graphsis a challenging one. In this paper under some condition,a simple method to find the vertex degree of cartesian product of two IDLFG without the cartesianproduct structure is given.

Keywords - Fuzzy graph, Intuitionistic fuzzy graph, intuitionistic DLFG, vertex degree of IDLFG.

I.

INTRODUCTION

The concept of a fuzzy relation was defined by Zadeh in 1965[10] and it has found applications in the analysis of cluster patterns. In 1975 Rosenfeld considered fuzzy relations on fuzzy sets and developed the structure of fuzzy graphs[12]. In 1983, Atanassov[1] introduced the concept of intuitionistic fuzzy sets as a generalization of fuzzy sets[10]. Fuzzy set gives the degree of membership of an element in given set, while intuitionistic fuzzy set gives both the degree of membership and non membership which are more or less independent from each other. The only condition is that the sum of these two degrees should not exceed 1. In [3] Karunambigai M. G. and Parvathi R. introduced intuitionistic fuzzy graph as a special case of Atanassov’s IFG. The operations on IFG was introduces by R. Parvathi, M. G. Karunambigai and K. Atanassov [4]. Degree, Order and Size in IFG was introduced by A. NaggorGani and S. ShajithaBegum[5]. The degree of a vertex in some fuzzy graphs was introduced by A. NagooorGani and K. Radha[2]. The double layered fuzzy graph was introduced by T. Pathinathan and J. Jesintharosline, they have examined some of the properties of DLFG[9]. The vertex degree of cartesian product of intuitionistic fuzzy graph is given by T. Pathinathan and J. Jesintharosline[14]. In this paper the intuitionistic double layered fuzzy graph is defined. The relationship between the vertex degrees of two IDLFG with the caresian product vertex degree were found under some condition. This relationship is illustrated with examples. First we go through some of the basic definitions.

II.

PRELIMINARIES

A. Fuzzy Graph

A fuzzy graph G is a pair of functions G:(σ,µ) where σ is a fuzzy subset of a non empty set S and µ is

International Journal of Computing Algorithm (IJCOA)

a symmetric fuzzy relation on σ . The underlying crisp

graph of G:(σ,µ) is denoted by

B. Intuitionistic Fuzzy Graph (IFG)

An IFG is of the form G: (V, E) where

(i) V = {v 1 , v 2 , v 3 , … ,v n } such that

and

membership and non - membership of the element

of

G

*

:(

, ) .

μ :V

1

the

®

*

*

[0,1]

γ

1

:V

®

[0,1]

denote

degree

v

i

Î

V

respectively, and

0 £ μ (v )+ γ (v ) £ 1

1

i

1

i

for every

(ii)

v

i

Î

E Í

V,(i = 1, 2,

V´ V where

n)

2

( 1 )

®

μ :E

®

(v ,v ) £ μ (v )Ùμ (v

[0,1]

γ

2

:E

μ

γ

[0,1] are such that

i

j

j

) ³

μ

(v

2

i

1

i

1

γ (v )Úγ (v

1

i

1

(v v ) + γ

i

j

, v ) Î

j

2

j

j

)

)

( 2 ) ( 3 )

( 4 )

2

2

(v ,v

i

and

for every

0 £

(v v ) £ 1

i

j

E,(i, j = 1,2,

,n).

and

C. Degree of a vertex in IFG

Let G = (V,E) be an IFG. Then the degree of a

vertex

v

where

d (v) =

γ

is

å

u

¹

v

defined

by

d (v) =

μ

γ (u,v)

2

.

d(v) = (d

μ

å

u

¹

v

μ (u,v)

2

(v), d (v))

γ

and

D. Cartesian Product of two IFG

The Cartesian product of two IFGs G 1 and G 2 is

defined as a IFG

G

=

V

''

E

=

=

V ´

1

{(u , u

1

V and

2

2

)(v , v

1

2

G ´

1

) / u

1

u

=

2

G

=

v

2

1

v

:

(

V, E” where

)

& u

2

v

2

2

& u v

1

Î

1

Î

E

2

or

E }

1

with

(μ

1

´

'

μ ),(γ

1

1

´

min(μ (u ),μ (u )),max(γ (u ), γ (u ))

γ ) (u ,u ) =

1

1

2

1

1

'

1

2

'

'

1

2

1

1

for every (u ,u )

1

2

Î V and

,

1374

International Conference on Computing and Intelligence Systems Pages: 1374 – 1378

Volume: 04, Special Issue: March 2015 ISSN: 2278-2397

(μ

2

´

μ ),(γ

2

2

´

γ

'

2

)

'

'

2

(u ,u

1

2

)(v ,v

1

2

) =

ï

ï

ï ï

ï

ï

í

ï ï

ï

ï ï

ï

ï

ï

ïî

min(μ (u ),μ

1

1

'
min(μ
1
0,0

(u ,v )),max(γ (u ), γ

2

2

1

1

(u

2

, v ))

2

if u = v

1

'

1

& (u

), γ

2

, v )

2

Î E

2

(u , v ))

1

1

& (u , v )

1

1

Î E

'

2

(u

2

),μ (u ,v )),max(γ (u

2

1

1

1

2

if u

otherwise.

2 = v

2

2

1

d G

1

´ G

2

( u ,u

1

2

)

= d

G

1

(u ) +

1

d

c

1

*

2

G

( u

2

),

c

2

d

*

2

G

( u

2

)

'

'

.(ii) If

constant functions say C 1 and C 2 respectively. Then,

μ £ μ

1

2

& γ

1

³

γ

2

and

μ 1

&

γ are

1

d

G

1

´

G

2

( u ,u

1

2

) = d

G

2

(u

2

) +

c
d
( u
),
c
d
( u
)
1
*
G
1
2
*
G
1
1
1

.

III. INTUITIONISTIC DOUBLE LAYERED FUZZY GRAPH(IDLFG)

E. Double Layered Fuzzy Graph

Let

underlying

G : ( , )

be

crisp

graph

DL

,

DL

)

is

 a fuzzy graph with the G * : ( * ,  * ) . The pair defined as follows. The

DL G

 :(

G

: (

(v , μ , γ ),(e ,μ

i

1

1

ij

2

, γ

*

*

,

) .

The

2

)

be

an

intuitionistic fuzzy graph with the underlying crisp

pair

Let

graph G

*

DL(G) :

(v , μ

i

DL

1

, γ

DL

1

),(e ,μ

ij

DL

2

, γ

DL

2

)

is

node set of

DL G be

*

*

. The fuzzy subset

DL

is defined as

DL  

The fuzzy relation

DL

) if

(

(

u

uv

u

) if

*

*

uv

is

on

*

*

defined as

DL

 

0

( uv

(

e i

)

)

(

u i

)

(

e

j

if

u v

,

*

) if the edge e

i

and e

j

have

a node

in common between them

(

e

i

)

if

each e

u

i

*

and e

i

*

and

i is incident with single u

i

either clockwise or anticlockwise.

otherwise

Bydefinition,

DL

(

u v

,

)

DL

(

u

)

DL

(

v

) for all u,v in

*

. Here

DL

.

is a fuzzy relation on the fuzzy subset

is

DL

Hence

the

pair

DL G

 :(

DL

,

DL

)

*

defined as double layered fuzzy graph (DLFG).

F. Theorem 1

called the intuitionistic double layered fuzzy graph

and is defined as follows. The node set of IDL G

be

defined as

. The fuzzy subset

DL

1

,

is

 

1

2

DL

1

u ),

uv

1

(

.

(
uv
)

1

(u)

),

2

DL

2

,

DL

2

on

(

if u

*

DL

1

,

 if uv   * * *    is

where

0

DL

1

The

defined as

fuzzy

relation

DL

2

,

DL

2

 ( ) if * , u v u , v  

2

(

uv

),

2

2

(

(

e i

)

)

2

 ( e

(

j

),

2

(

e i

),

1

(

u i

)

1

u i

2

0

e i

)

2

(

e

j

)

2

(

e i

)

if the edge e i and e

j

u i

*

have a node

and

i

in common betw een them *

and e

each e i is incident with single u

i

if

either clockwise or anticlockwise.

otherwise

,μ , γ ),(e

(v

Let

G

(v

1

'

1

G

μ

1

d G

2

³

μ

'

2

i

1

´ G

2

(u , u

1

i

'

1

'

1

1

ij

'

2

, γ

ij

'

)

2

2

be

, γ

³

'

1

2

μ

2

+ d

G

2

, γ

(u

)

, μ , γ ),(e ,μ

, γ

γ

1

£

)

2

2

and μ

= d

G

1

(u )

1

two

and

'

1

2

£

)

Bydefinition

0 (uv)

2

DL

2

2
.
1

,

DL

,

DL

IFGs.

γ ,then

2

If

.

DL

1

2

(uv) 1 for all u,v in

*

. Here

is a fuzzy relation on the fuzzy subset

*

G. Theorem 2

G

Let

2

G

(v

1

i

,μ , γ ),(e

(v

i

1

1

, μ , γ ),(e ,μ

1

1

ij

'

'

'

2

)

ij

, γ

'

2

2

, γ

2

)

and

be two IFGs.

'

'

(i) If

say C 1 and C 2 respectively. Then,

μ £ μ

1

2

&

γ

1

³

γ and

2

are constant functions

IV. DEGREE OF VERTICES IN CARTESIAN

G

Let

2

Then

(v

i

PRODUCT OF TWO IDLFG

G

1

, μ , γ ),(e

1

1

'

'

ij

(v

i

'

2

,μ , γ ),(e

1

'

, γ

2

)

1

ij

2

, γ

2

)

and

be two IDLFGs.

International Journal of Computing Algorithm (IJCOA)

1375

International Conference on Computing and Intelligence Systems Pages: 1374 – 1378

Volume: 04, Special Issue: March 2015 ISSN: 2278-2397

'
å
´
μ
)(u ,u
)(v , v
),
2
2
1
2
1
2
(u
,u
)(v ,v
)
Î
E
1 2
1
2
=
'
å
´
γ
)(u ,u
)(v , v
)
2
2
1
2
1
2
(u
,u
)(v ,v
)
Î
E
1 2
1
2
'
å
μ
(u
)
Ù
μ
(u
, v
),
1
1
2
2
2
u
=
v
( u
,v
)
Î
E
1
1,
2
2
1
=
+
'
å
γ
(u
)
Ú
γ
(u
, v
)
-------
1
1
2
2
2
u
= v
, (u
,v
)
Î
E
1
1
2
2
2
å
μ (u
1
'
)
Ù
μ
(u
, v
)
,
2
2
1
1
u
= v
, (u
,v
)
Î
E
2
2
1
1
1
.
å
γ (u
1
'
)
Ù
γ
(u
, v
)
2
2
1
1
u
= v
, (u
,v
)
Î
E
2
2
1
1
1
(1)
A. Theorem
Let
and
G
:
(v
, μ , γ
),(e
, γ
)
1
i
1
1
ij
2
2
'
'
'
'
G
:
(v
, γ
),(e ,μ
, γ
)
be
two
IDLFGs.
If
2
i
ij
1
1
2
2
'
'
'
'
μ
³
μ
, γ
£
γ
and μ
³
μ
, γ
£
γ
,
then
1
2
1
2
1
2
1
2
d
(u , u
)
=
d
(u ) + d
(u
)
.
G
´ G
1
2
G
1
G
2
1
2
1
2

Proof:

We can illustrate the proof of this theorem with the following example.

(1)

G with

vertices

=

Consider the intuitionistic fuzzy graph

Example

1

and

u 1 = (0.6,0.4),

u 2 = (0.8,0.2)

u 3

(0.5,0.3); and edges u 1 u 2 = (0.5,0.4), u 2 u 3 = (0.2,0.3)

2 with vertices v 1 =

(0.8,0.2), v 2 = (0.6,0.3),

and u 3 u 1 = (0.4,0.5). Also

G

Then the cartesian product of two double layered

fuzzy graph is given by

Enlargement of u 1 v 1 and its associated vertices and edges are given in next figure for more clarity

Fig.4.

IDL(G ) IDL(G )

1

2

v 3 = (0.5,0.4) and v 4 = (0.7,0.1); and edges v 1 v 2 =
(0.5,0.4), v 2 v 3 = (0.2,0.7), v 3 v 4 = (0.3,0.5) and v 4 v 1 =
Here
(u , v )
= (2.7,2.5)
d G
´ G
1
1
1
2
(0.4,0.4).
It is verified from the above graph that finding the
vertex degree of cartesian product of two DLFG is a
complicated one. Since the two DLFG satisfies the
Then the IDLFG of
G 1 and
G
is as follows
conditions
2
'
'
'
'
μ
³
μ
, γ
£
γ
and μ
³
μ
, γ
£
γ
by
1
2
1
2
1
2
1
2
theorem F, we can find the cartesian product vertex
degree
without
finding
the
product
of
two
intuitionistic double layered fuzzy graph.
By
theorem
F,
it
is
verified
that
(u , v ) = (2.7,2.5)
which is equal to
d G
´ G
1
1
1
2
(v ) + d
(u )
= (1.4,1.3) + (1.3,1.2)
d G
1
G
1
2
1
= (2.7,2.5)
Fig.1.
IDL(G )
1
Thus for the cartesian product vertex degree of any
two intuitionistic DLFG, if the product structure is a
complicated one we can use theorem F to get the
result easily.
B. Theorem
Let
G
:
(v i
,μ , γ ),(e
, γ
)
and
1
1
1
ij
2
2
'
'
'
'
be two IDLFGs.
G
:
(v
, μ , γ ),(e
, γ
)
2
i
ij
1
1
2
2
'
'
(i) If
μ £ μ
& γ
³
γ
and
μ
& γ
are constant
1
2
1
2
1
1
functions
say
C 1
and
C 2
respectively.
Then
Fig.4.
IDL(G )
2
International Journal of Computing Algorithm (IJCOA)
1376

International Conference on Computing and Intelligence Systems Pages: 1374 – 1378

Volume: 04, Special Issue: March 2015 ISSN: 2278-2397

d

G

1

´

G

2

( u ,u

1

2

) = d

G

1

(u ) +

1

d

c

1

*

2

G

( u

2

),

c

2

d

*

2

G

( u

2

Enlargement of u 1 v 1 and its associated vertices and

edges are given in next figure for more clarity

.

(ii)

constant functions say C 1 and C 2 respectively. Then

If

'

μ £ μ

1

2

&

γ

'

1

³

γ

2

and

μ

1

&

γ are

1

d

G

1

´

G

2

( u ,u

1

2

) = d

G

2

(u

2

) +

d

c

1

G

*

1

( u

1

),

c

2

d

G

*

1

( u

)
1

.

Proof:

We can illustrate the proof of this theorem with the

following example.

(1) Example Consider the intuitionistic fuzzy graph

with

vertices u 1 = u 2 = u 3 = (0.3,0.6); and edges u 1 u 2 = (0.2,0.6),

with

vertices v 1 = (0.4,0.5), v 2 = (0.6,0.3), v 3 = (0.7,0.2) and v 4 = (0.6,0.3); and edges v 1 v 2 = (0.4,0.6), v 2 v 3 = (0.6,0.4), v 3 v 4 = (0.5,0.3) and v 4 v 1 = (0.3,0.5).

G

1

G

2

u 2 u 3 = (0.3,0.7) and u 3 u 1 = (0.1,0.8). Also

Then the IDLFG of

G

1

and

G

2

are as follows

Fig.5.
IDL(G )
1

Fig.6.

IDL(G ) IDL(G )

1

2

Here

d

G

1

´

G

2

(u , v ) = (1.8,3.6)

1

1

It is verified from the above graph that finding the vertex degree of cartesian product of two DLFG is a complicated one. Since the two DLFG satisfies the

conditions

constant functions say C 1 and C 2 by theorem G, we can find the cartesian product vertex degree without finding the product of two intuitionistic double layered fuzzy graph. By theorem G, it is verified that

are

μ £ μ

1

'

2

&

γ

1

³

γ

'

2

and

μ

1

&

γ

1

d G

1

´ G

d

G

1

2

(u

1

, v ) = (1.8,3.6)

1

which is equal to

(u ) +

1

c

1

d

*

G

2

(v ),

1

c

2

d

*

G

2

= (0.9,1.8) + (0.3(3),0.6(3)) = (1.8,3.6)

(v )

1

Fig.5.
IDL(G )
2

Thus for the cartesian product vertex degree of any two intuitionistic DLFG, if the product structure is a complicated one we can use theorem G to get the result easily.

V.

CONCLUSION

In the cartesian product of two IDLFG, finding the vertex degree at each vertex is a complicated one. In this paper the Intuitionistic double layered fuzzy graph is defined and its cartesian product vertex degree is found under certain conditions, which will be useful to

find any cartesian product vertex degrees of two

IDLFGs structure. Further work can be done to apply these concepts in the practical problems.

ACKNOWLEDGMENT

I thank MANF for their support to do my research work. The authors are very grateful to the chief editors for their comments and suggestions,which will be helpful in improving the paper.

[1]

REFERENCES

K. T. Atanassov, “Intuitionistic fuzzy sets”, fuzzy sets and systems Vol. 20, pp. 87-96, 1986.

International Journal of Computing Algorithm (IJCOA)

1377

International Conference on Computing and Intelligence Systems Pages: 1374 – 1378

 [2] A. Naggor Gani and K. Radha, “The degree of vertex in some 2006. [3] fuzzy graphs”, International Journal of Algorithms, Computing and Mathematics, Vol. 2(3), pp 107 -116, 2009. M. G. Karunambigai and R. Parvathi, “Intuitionistic Fuzzy graphs”, Proceedings of 9 th Fuzzy Days International Conference on Computational Intelligence, Advances in Soft computing: Computaional Intelligence, Theory and Applicaions, Springer – Verlag, Vol. 20, pp. 139 – 150, [4] R. Parvathi, M. G. Karunambigai and K. Atanassov, [5] “Operations on Intuitionistic Fuzzy Graphs”, Proceedings of IEEE International Conference on Fuzzy Systems (FUZZ – IEEE), pp. 1396 – 1401, 2009. A. Naggor Gani and S. Shajitha Begum, “Degree, Order and [6] Size in Intuitionistic fuzzy graphs”, International Journal of Algorithms, Computing and Mathematics Vol. 3(3), pp.11 - 16, 2010. A.Nagoorgani and M. Basheed Ahamed, “Order and size in fuzzy graphs”, Bulletin of Pure and Applied Sciences, Vol. 22E(1),pp. 145 – 148, 2003.

[7] T.Pathinathan and J.Jesintha Rosline, “Characterization of fuzzy graphs into different categories using arcs in fuzzy graph”, Journal of Fuzzy set valued analysis 2014, pp. 1-6,

2014.

[8] J.N.Mordeson and P.S.Nair, “Fuzzy Graphs and Fuzzy

Hypergraphs”, Physica verlag Publication, Heidelberg 1998, second edition 2001. T.Pathinathan and J.Jesintha Rosline, “Double layered fuzzy

[9]

graph”, Annals of Pure and Applied Mathematics, Vol. 8(1), pp.135-143, 2014. [10] L. A. Zadeh, “Fuzzy sets”, Information control, Vol. 8, pp.338 – 353, 1965. [11] R.T. Yeh and S. Y. Bang, “Fuzzy relations, fuzzy graphs and their application to clustering analysis, In fuzzy sets and their Application to cognitive and decision processes”, L. A. Zadeh, Fu. K. S. Shimura M.Eds, Academic Press, New York, 1975, pp. 125- 149. [12] A. Rosenfeld, Fuzzy Graphs, in: L. A. Zadeh, Fu. K. S. Shimura(Eds), “Fuzzy sets and their application to cognitive and decision processes”, Academic Press, New York, 1975,pp. 77 – 95. [13] T.Pathinathan and J.Jesintha Rosline, “Matrix Representation of Double layered fuzzy graph”, Annals of Pure and Applied Mathematics, Vol. 8(2),pp. 51 – 58, 2014. [14] T.Pathinathan and J.Jesintha Rosline, “Vertex degree of Cartesian product of intuitionistic fuzzy graph”, Proceedings of Seventh National Conference on Mathematical Techniques and its Applications, pp. 340 – 344, 2015.

International Journal of Computing Algorithm (IJCOA)

Volume: 04, Special Issue: March 2015 ISSN: 2278-2397

1378