International Journal of Trend in Scientific Research and Development (IJTSRD)

International Open Access Journal | www.ijtsrd.com

ISSN No: 2456 - 6470 | Volume - 2 | Issue – 6 | Sep – Oct 2018

Nil Complementary Domination in Intutionistic Fuzzy Graph

R. Buvaneswari1, K. Jeyadurga2
1
Assistant Professor, 2Research Scholar
KG College of Arts and Science, Coimbatore, Tamil Nadu
Nadu,, India

ABSTRACT
The author defines the complementary dominating set membership of the element v i ∈ V
and non-membership
and its number in intutionistic fuzzy graph. The respectively and 0 ≤ µ 1 (v i ) + ν 1 (v i ) ≤ 1 for every
author discussed the order and enclave is obtained for
some standard intutionistic fuzzy graph is derived. v i ∈ V , (i=1,2,......n).
(ii) E ⊆ V × V where µ 2 : V ×V → [0,1] and
Keyword: Intutionistic fuzzy graph, de degree, ν 2 : V × V → [0,1] are such that
µ 2 (vi , v j ) ≤ µ1 (v i ) ∧ µ1 (v j )
complementary nil dominating set, effective degree.
and
1. INTRODUCTION ν 2 (vi , v j ) ≤ ν 1 (v i ) ∧ ν 1 (v j ) respectively and
In 1999, Atanassov[1] introduced the concept of 0 ≤ µ 2 (vi , v j ) + ν 2 (vi , v j ) ≤ 1
intutionistic fuzzy relation and intutionistic fuzzy
graphs. Parvathi and Karunambigai [5] introduced the
Definition 2.3
concept of intutionistic fuzzy graph and analyzed its
components. Nagoor Gani and Sajitha Begum [11] Let G = (V , E ) , be an intutionistic fuzzy graph. The
define degree, order and size in intutionistic fuzzy cardinality
ality of G is defined to be
graph and derive its some of their properties. 1 + µ 1 (v i ) − ν 1 (v i ) 1 + µ 2 (e ij ) − ν 2 (e ij )
G = ∑ + ∑
Somasundaram [9] introduced the concept of v i ∈V 2 v i ∈V 2
domination in intutionistic fuzzy graph. PParvathi and
Thamizhendhi [6] introduced the concept of The vertex cardinality is defined as
domination number in intutionistic fuzzy graph. 1 + µ 1 (v i ) − ν 1 (v i )
Tamizh Chelvam [10] introduced and analyzed the V = ∑
v i ∈V 2
complementary nil dominating set in the crisp graph.
The properties of nil complementary dominating The edge cardinality is defined as
graph in intutionistic fuzzy graph is discussed in this 1 + µ 2 (e ij ) − ν 2 (eij )
paper. E = ∑
eij ∈V 2
2. Preliminaries
Definition 2.1 Definition 2.4
A fuzzy graph G = (σ , µ ) is a pair of functions Let G = (V , E ) be an intutionistic fuzzy graph. The
σ : V → [0,1] and µ : V ×V → [0,1] , where for all u, v ∈ V degree of a vertex vi is defined by
µ (u, v ) = σ (u ) ∧ σ (v ) . d (v i ) = (d µ (v i ), dν (v i )) where d µ (v ) = ∑ µ ij and
i≠ j

Definition 2.2 dν (v ) = ∑ν ij
Let G = (V , E ) be an intutionistic fuzzy graph, such i≠ j

that
(i) V = {v1 , v 2 ...... v n } such that µ 1 : V → [0 ,1],
ν 1 : V → [0 ,1] denote the degree of membership
Definition 2.5
The effective degree of a vertex v in intutionistic
fuzzy graph, G = (V,E) is defined to be the sum of the

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct

Oct 2018 Page: 1473
 International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
2456
strong edge incident at v. It is denoted by δ E (G ) and 3. Nil complementary in IFG
∆ E (G ) . Theorem 3.1
A dominating set S is a nil complementary
dominating set if and only if it contains at least one
The minimum degree of G is
enclave.
δ E (G ) = min (d E (v ) v ∈ V ) .
Proof
The maximum degree of G is Let S be a nil complementary dominating set of a
∆ E (G ) = max(d E (v ) v ∈ V ) intutionistic fuzzy graph G = (V , E ) . The V-S is not a
dominating set which implies that there exit a vertex
Two vertices vi and v j are said to be neighbourhood u ∈ S such that µ2 (u, v) < max[µ1 (u), µ1 (v)] and
in intutionistic fuzzy graph if there is a strong edges ν 2 (u, v) < min[ν1 (u),ν1 (v)] for all v ∈ V − S . Therefore
between vi and v j .
u is an enclave of S. Hence S contain atleast one
enclave.
Definition 2.6
An intutionistic fuzzy graph H ′ = (V ′, E ′) is said to Conversely, suppose the dominating set S contains
be an intutionistic fuzzy subgraph of G = (V , E ) if enclaves. Without loss of generality let us take u be
V ′ ⊆ V and E ′ ⊆ E . That is µ1′i ≤ µ1i ; ν 1′i ≤ ν 1i and the enclave of S. (i.e) µ2 (u, v) < max[µ1 (u), µ1 (v)] and
µ 2′ ij ≤ µ 2ij ; γ 2′ij ≤ γ 2ij for every i,j=1,2,.....n ν 2 (u, v) < min[ν1(u),ν1(v)] for all v ∈V − S . Hence V-S
is not a dominating set. Hence dominating set S is nil
Definition 2.7 complementary dominating set.
Let G = (V , E ) ,be an intutionistic fuzzy graph. The
Theorem 3.2
complement of an intutionistic fuzzy graph is, denoted
( )
If S is a nil complementary dominating set of an
by G = V , E , to be satisfied the following conditions. intutionistic fuzzy graph G = (V , E ) , then there is a
(i) V = v vertex u ∈ S such that S − {u} is a dominating set.
µ = µ1i and ν 1i = ν 1i for all i=1,2,.....n
(ii) 1i
µ = min (µ1i , µ1 j ) − µ 2ij ν = min (ν 1i ,ν 1 j ) − ν 2ij Proof
(iii) 2ij and 2ij Let S be a nil complementary dominating set. since by
for all i,j=1,2,...n theorem 3.1, every nil complementary dominating set
if and only if it contains atleast one enclave. Let u ∈ S
Definition 2.8 be an enclave of s. Then µ 2 (u, v ) < max[µ1 (u ), µ1 (v )] and
Let G = (V , E ) be an intutionistic fuzzy graph. A set ν 2 (u, v ) < min [ν 1 (u ),ν 1 (v )] for all v ∈ V − S . Since G is
S ⊂ V is said to be a nil complementary dominating set connected intutionistic fuzzy graph, there exist atleast
of an intutionistic fuzzy graph of G, if S is a a vertex w ∈ S such that µ 2 (u, v ) = max[µ1 (u ), µ1 (v )] and
dominating set and its complement V V-S is not a
ν 2 (u, v ) = min [ν 1 (u ),ν 1 (v )] hence S − {u} is a dominating
dominating set. The minimum scalar cardinality ove over
all nil complementary dominating set is called a nil set.
complementary domination number and it is denoted
by γ ncd , the corresponding minimum nil Theorem 3.3
A nil complementary dominating set in an
complementary dominating set is denote by γ ncd -set.
intutionistic fuzzy graph G = (V , E ) is not a singleton.
Definition 2.9
Proof
Let S ⊂ V in the connected intutionistic fuzzy graph
Let S be a nil complementary dominating set. Since
G = (V , E ) . A vertex u ∈ S is said to be an enclave of by theorem 3.1, every nil complementary dominating
S if µ2 (u, v) < max[µ1 (u), µ1 (v)] and set if and only if it contains atleast one enclave. Let
ν 2 (u , v ) < min[ν 1 (u ),ν 1 (v )] for all v∈ ∈V − S . (i.e) u ∈ S be an enclave of s. Then
µ 2 (u , v ) < max [µ1 (u ), µ1 (v )]
N (u ) ⊆ S .
and

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct

Oct 2018 Page: 1474
 International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
ν 2 (u , v ) < min [ν 1 (u ), ν 1 (v )] for all v ∈ V − S . Suppose S
contains only one vertex u , then it must be isolated in
G. This is contradiction to connectedness. Hence nil
complementary dominating set contains more than
one vertex.
Conclusion
The nil complementary dominating set and its number
in intutionistic fuzzy graph is defined. Some of the
properties are derived in this paper. The future work
will be carried on its application in social network.
References
1. Atanassov. K. T. Intutionistic fuzzy se
sets: Theory
and its Applications. Physica, New York, 1999.
2. Bhattacharya, P. Some remarks on fuzzy graphs,
Pattern Recognition Letter 5: 297-302
302, 1987.
3. Harary, F., Graph Theory, Addition Wesley, Third
Printing, October 1972.
4. C. V. R. Harinarayanan and P. Muthuraj
huraj and P. J.
Jayalakshmi, “Total strong (weak) domination
intutionistic fuzzy graph”, Advances in theoretical
and applied mathematics,, 11 (2016), 203
203-212.
5. M. G. Karunambigai and R. Parvathi,
“Intuitionisitc Fuzzy Graph”, Proceedings of 9th
Fuzzy Days International Conference Intelligence,
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct
2456
Advances in soft computing: Computatinal
intelligence; Theory and Applications, Springer-
Verlag, 20 (2006), 139-150
150
6. M. G. Karunambigai and R. Parvathi and R.
Buvaneswari, “Constant intutionistic fuzzy
graphs”, Notes on n Intuitionistic Fuzzy system, 17
(2011), 1, 37-47.
7. M. G. Karunambigai and R. Parvathi and R.
Buvaneswari, “Arcs in intutionistic fuzzy graph”,
Notes on Intuitionistic Fuzzy system,
system 17 (2011).
8. M. G. Karunambigai and Muhammad Akram and
R. Buvaneswari, “Strong and super strong vertices
in intutionistic fuzzy graphs”, Journals on
intuitionistic fuzzy system, 30 (2016), 671-678.
9. Somasundaram, A and Somasundaram, S.,
Domination in Fuzzy graph-I,
graph Patter Recognition
Letter 19(9), 1998, 787-791.
791.
10. Tamizh Chelvam. T and Robinson Chelladuari. S,
Complementary nil domination number of a
graph, Tamkang Journal of Mathematics, Vol.40,
No.2 (2009), 165-172. Received: June
11. Nagoor Gani. A and Shajitha Begum. S, Degree,
Order and Size in Intuitionistic Fuzzy Graphs,
International Journal of Algorithms, Computing
and Mathematics, (3) 3 (2010).
Oct 2018 Page: 1475