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
12

J. Jesintha Rosline1, T. Pathinathan2

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.

a symmetric fuzzy relation on . The underlying crisp

Keywords - Fuzzy graph, Intuitionistic fuzzy graph,

intuitionistic DLFG, vertex degree of IDLFG.

and 1:V [0,1] denote the degree of

membership and non - membership of the element
vi V respectively, and 0 1 (v i ) + 1 (v i ) 1

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 Atanassovs 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)

graph of G:(,) is denoted by G : ( , ) .

B. Intuitionistic Fuzzy Graph (IFG)
An IFG is of the form G: (V, E) where
(i) V = {v1, v2, v3, ,vn } such that 1:V [0,1]

for every vi V, (i = 1, 2,...n) ( 1 )

E V V where 2 :E [0,1]

(ii)

and

2 :E [0,1] are such that

2 (vi , v j ) 1 (v i ) 1 (v j )

(2)

2 (vi , v j ) 1 (vi ) 1 (v j )

(3)

and 0 2 (vi v j ) + 2 (v i v j ) 1

(4)

for every (vi , v j ) E, (i, j = 1,2,...,n).

C. Degree of a vertex in IFG
Let G = (V,E) be an IFG. Then the degree of a
vertex v is defined by d(v) = (d (v), d (v))

d (v) = 2 (u,v)

where

and

u v

d (v) = 2 (u, v) .
u v

D. Cartesian Product of two IFG

The Cartesian product of two IFGs G1 and G2 is
defined as a IFG

G = G1 G 2 : (V, E)where

V = V1 V2 and
E '' = {(u1 , u 2 )(v1 , v 2 ) / u1 = v1 & u 2 v 2 E 2 or
u 2 = v 2 & u1 v1 E1}
with

(1 '1 ),(1 '1 ) (u1,u2) =

min(1(u1),'1 (u2)),max(1(u1),'1 (u2)) ,
for every (u1,u2) V and
1374

International Conference on Computing and Intelligence Systems

Pages: 1374 1378

( 2 2' ), ( 2 '2 ) (u1 ,u 2 )(v1 , v 2 ) =

Volume: 04, Special Issue: March 2015

ISSN: 2278-2397

d G1 G2 ( u1 ,u2 ) = dG1 (u1 ) + c1d G* ( u2 ), c2 d G* ( u2 )

2

min( (u ), ' (u , v )), max( (u ), ' (u , v ))

1
1
2
2
1
1
2
2

2
2

if
u
=
v
&
(u
,
v
)

1
1
2
2 E2

'
'
min( 1 (u 2 ), 2 (u1 , v1 )), max( 1 (u 2 ), 2 (u1, v1 ))

if u 2 = v2 & (u1 , v1 ) E1

0,0
otherwise.

E. Double Layered Fuzzy Graph

.(ii) If

'

1 2 & 1 2 and 1 & 1 are

constant functions say C1 and C2 respectively. Then,

dG1 G2 ( u1 ,u2 ) = d G2 (u 2 ) + c1d G* ( u1 ), c 2 dG* ( u1 )

1

.
III.

INTUITIONISTIC DOUBLE LAYERED FUZZY

GRAPH(IDLFG)

G : (vi ,1 , 1 ), (eij , 2 , 2 ) be

Let

Let G : ( , ) be a fuzzy graph with the

'

an

intuitionistic fuzzy graph with the underlying crisp

*

underlying crisp graph G : ( , ) . The pair

graph G : ( , ) .

DL G : ( DL , DL ) is defined as follows. The

DL(G) : (vi , DL1 , DL1 ), (eij , DL 2 , DL 2 ) is

node set of

DL G be * * . The fuzzy subset

*
DL is defined as D L ( u ) if u
*
( uv ) if u v

The fuzzy relation

(uv)

(e ) (e )
j
i

(u ) (e )
DL
i
i

Bydefinition,

DL on * * is defined as
if u, v *
if the edge e and e have a node
i
j
in common between them
if u * and e * and
i
i
each e is incident with single u
i
i
either clockwise or anticlockwise.
otherwise

The

called the intuitionistic double layered fuzzy graph

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

DL1 , DL1 . The fuzzy subset

1 (u ), 1 (u) if u *
DL1 , DL1
*
2 (uv ), 2 (uv ) if uv
where 0 DL1 DL1 1 .
The fuzzy relation

DL2 , DL2 on * * is

defined as
DL2 , DL2

G 2 : (v i , '1 , '1 ), (e ij , '2 , '2 ) be two IFGs. If

DL1 , DL1 is

defined as

(uv), (u, v)
2
2

(e ) (e ), (e ) (e )
2 j 2 i
2 j
2 i
*
*
DL (u , v ) DL (u ) DL (v ) for all u,v in

1(ui ) 2 (ei ), 1(ui ) 2 (ei )

. Here DL is a fuzzy relation on the fuzzy subset

DL . Hence the pair DL G : ( DL , DL ) is

defined as double layered fuzzy graph (DLFG).

0

F. Theorem 1

Let G1 : (vi ,1 , 1 ), (e ij , 2 , 2 ) and

pair

if u, v *
if the edge e and e have a node
i
j
in common between them
if u * and e * and
i
i
each e is incident with single u
i
i
either clockwise or anticlockwise.
otherwise

Bydefinition
0 2 (uv) 2 (uv ) 1 for all u,v in * * . Here

1 '2 , 1 '2 and 1' 2 , 1' 2 ,then

DL2 , DL2

d G1 G2 (u1 , u 2 ) = d G1 (u1 ) + d G 2 (u 2 ) .

DL1 , DL1 .

is a fuzzy relation on the fuzzy subset

G. Theorem 2
IV.

Let G1 : (vi ,1 , 1 ), (e ij , 2 , 2 ) and

G 2 : (v i , '1 , '1 ), (eij , '2 , '2 ) be two IFGs.

'
2

'
2

(i) If 1 & 1 and are constant functions

say C1 and C2respectively. Then,

International Journal of Computing Algorithm (IJCOA)

Let

DEGREE OF VERTICES IN CARTESIAN

PRODUCT OF TWO IDLFG

G1 : (vi ,1 , 1 ), (e ij , 2 , 2 ) and

G 2 : (vi , '1 , '1 ), (eij , '2 , '2 )

be two IDLFGs.

Then

1375

International Conference on Computing and Intelligence Systems

Pages: 1374 1378

Then the cartesian product of two double layered

fuzzy graph is given by

( 2 '2 )(u1 , u 2 )(v1 , v2 ),

Volume: 04, Special Issue: March 2015

ISSN: 2278-2397

(u1 ,u 2 )(v1 ,v 2 ) E

( 2 2' )(u1 , u 2 )(v1 , v 2 )

(u1 ,u 2 )(v1 ,v 2 ) E

1 (u 1 ) 2' (u 2 , v 2 ),

u 1 = v 1, ( u 2 ,v 2 ) E 1

1 (u 1 ) '2 (u 2 , v 2 )

-------

u 1 = v1 , (u 2 ,v 2 ) E 2

'1 ( u 2 ) 2 (u 1 , v 1 ) ,

u 2 = v 2 , (u 1 , v1 ) E 1

'1 (u 2 ) 2 ( u 1 , v 1 )

u 2 = v 2 , (u 1 , v1 ) E 1

(1)
A. Theorem
Enlargement of u1v1 and its associated vertices and
edges are given in next figure for more clarity

Let G1 : (v i , 1 , 1 ), (eij , 2 , 2 ) and

G 2 : (v i , '1 , '1 ), (eij , '2 , '2 )

be two IDLFGs. If

1 2' , 1 2' and 1' 2 , 1' 2 ,

then

d G1 G 2 (u1 , u 2 ) = d G1 (u1 ) + d G 2 (u 2 ) .
Proof:
We can illustrate the proof of this theorem with the
following example.
(1)
Example
Consider the intuitionistic fuzzy graph G1 with
vertices u1 = (0.6,0.4), u2 = (0.8,0.2) and u3 =
(0.5,0.3); and edges u1 u2 = (0.5,0.4), u2 u3 = (0.2,0.3)
and u3 u1 = (0.4,0.5). Also G2 with vertices v1 =
(0.8,0.2), v2= (0.6,0.3),
v3= (0.5,0.4) and v4 = (0.7,0.1); and edges v1 v2 =
(0.5,0.4), v2 v3 = (0.2,0.7), v3 v4 = (0.3,0.5) and v4 v1 =
(0.4,0.4).
Then the IDLFG of G1 and G2 is as follows

Fig.4. IDL(G1 ) IDL(G2 )

Here d G1 G 2 (u1 , v 1 ) = (2.7,2.5)
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

1 '2 , 1 2' and 1' 2 , 1' 2

by
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
d G G (u1 , v 1 ) = (2.7,2.5) which is equal to
1

d G 2 (v1 ) + d G1 (u1 ) = (1.4,1.3) + (1.3,1.2)

Fig.1. IDL(G1 )

= (2.7,2.5)
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 G1 : (vi , 1 , 1 ), (e ij , 2 , 2 ) and
G 2 : (vi , '1 , '1 ), (eij , '2 , '2 ) be two IDLFGs.
'

Fig.4. IDL(G2 )

International Journal of Computing Algorithm (IJCOA)

'

(i) If 1 2 & 1 2 and 1 & 1 are constant

functions say C1 and C2 respectively. Then

1376

International Conference on Computing and Intelligence Systems

Pages: 1374 1378

d G1 G2 ( u1 ,u2 ) = dG1 (u1 ) + c1 dG* ( u2 ), c2 dG* ( u2 )

2

Volume: 04, Special Issue: March 2015

ISSN: 2278-2397

Enlargement of u1v1 and its associated vertices and

edges are given in next figure for more clarity

.
(ii)

If

'1 2 & '1 2

and

1 & 1 are

constant functions say C1 and C2 respectively. Then

dG1 G2 ( u1 ,u2 ) = d G2 (u 2 ) + c1dG* ( u1 ), c 2 dG* ( u1 )

1

.
Proof:
We can illustrate the proof of this theorem with the
following example.
(1) Example
Consider the intuitionistic fuzzy graph G1 with
vertices
u1= u2 = u3 = (0.3,0.6); and edges u1 u2 = (0.2,0.6),
u2 u3 = (0.3,0.7) and u3 u1 = (0.1,0.8). Also G2 with
vertices v1 = (0.4,0.5), v2= (0.6,0.3), v3= (0.7,0.2) and
v4 = (0.6,0.3); and edges v1 v2 = (0.4,0.6), v2 v3 =
(0.6,0.4), v3 v4 = (0.5,0.3) and v4 v1 = (0.3,0.5).
Then the IDLFG of G1 and G2 are as follows

Fig.6. IDL(G1 ) IDL(G2 )

Here d G1 G 2 (u1 , v 1 ) = (1.8,3.6)
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 1 2 & 1 2 and 1 & 1 are

constant functions say C1 and C2 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
d G G (u1 , v 1 ) = (1.8,3.6) which is equal to
1

dG1 (u1) + c1dG* (v1 ),c2dG* (v1 ) = (0.9,1.8) + (0.3(3),0.6(3))

2

Fig.5. IDL(G1 )

= (1.8,3.6)
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.

Fig.5. IDL(G2 )

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.

REFERENCES
[1]

International Journal of Computing Algorithm (IJCOA)

K. T. Atanassov, Intuitionistic fuzzy sets, fuzzy sets and

systems Vol. 20, pp. 87-96, 1986.

1377

International Conference on Computing and Intelligence Systems

Pages: 1374 1378
[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]
[11]

[12]

[13]

[14]

Volume: 04, Special Issue: March 2015

ISSN: 2278-2397

A. Naggor Gani and K. Radha, The degree of vertex in some

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 9th Fuzzy Days International
Conference on Computational Intelligence, Advances in Soft
computing: Computaional Intelligence, Theory and
Applicaions, Springer Verlag, Vol. 20, pp. 139 150,
2006.
R. Parvathi, M. G. Karunambigai and K. Atanassov,
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
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.
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.
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
graph, Annals of Pure and Applied Mathematics, Vol. 8(1),
pp.135-143, 2014.
L. A. Zadeh, Fuzzy sets, Information control, Vol. 8,
pp.338 353, 1965.
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.
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.
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.
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)

1378