ISSN 2394-3777 (Print)

ISSN 2394-3785 (Online)

Available online at www.ijartet.com

International Journal of Advanced Research Trends in Engineering and Technology (IJARTET)

Vol. 8, Issue 2, February 2021

Domination in Intuitionistic Fuzzy Graphs of

Second Type
V.Pachamuthu1, C.Praveenkumar2
Department of Mathematics, Bharathidasan College of Arts and science, Erode,
Tamil Nadu – 638116, India1,2

Abstract: In this paper, strong arc, dominating set and domination number in intuitionistic fuzzy graph of second type are
discussed. Also some properties of domination in intuitionistic fuzzy graph of second type are studied.
Keywords: Intuitionistic fuzzy graph of second type (IFGST), Strong arc, Dominating set, Domination number,
complement of IFGST.

(ii) where and

I. INTRODUCTION are such that
In 1965, the notion of fuzzy set was introduced by zadeh
[13] as a method of representing uncertainty and vagueness
in real life situation. In 1986, Attanassov [1] introduced the and , for every
concept of intuitionistic fuzzy sets as a generalization of
.
fuzzy set. Rosenfeld introduced the notion of fuzzy graphs
Here the degree of membership and degree of non-
and several fuzzy analogs of theoretic concepts such as path,
cycle and connectedness. Orge and Berge introduced the membership of the vertex is denote by the triple
study of dominating set in graphs. K.T.Attanassov[2] . The degree of membership and degree of
introduce the concept of intuitionistic fuzzy(IF) relations and non-membership of the edge relation on is
intuitionistic fuzzy graphs(IFGs). R.Parvathi and defined by the triple .
M.G.Karunambigai[7] gave a definition for IFG as a special Definition 2.2[8]
case of IFGs defined by K.T.Attanassov and A.Shanon[10]. The cardinality of an , is defined by
Yan Lue [12] defined the cardinality of an IFG. The
definitions of order, degree and size gave by A.Nagoor Gani
and Shajitha begam.R.Parvathi and G.Tamizhendhi[8] was
introduced dominating set, domination number in IFGs. S. for all and .
Sheik Dhavudh and R. Srinivasan[9] gave the definition of Definition 2.3[8]
Intuitionistic Fuzzy Graphs of Second Type[IFGST]. Based The vertex cardinality of of an , is
on the paper [8] and [9], we introduced dominating set and defined by for all
domination number in IFGST.
Definition 2.4[8]
II. PRILIMINARIES The edge cardinality of of an , is
In this section, some basic definitions relating to IFG and defined by for
IFGST are given. Also the definition of domination of IFG
are studied. all .
Definition 2.1[5] Definition 2.5[8]
An Intuitionistic Fuzzy Graph ( ) is of the form Let be an .The number of vertices
, where (i) such that the (the cardinality of ) is called the order of and is denoted
degree of membership and non - membership of the element by for all
are defined by and Definition 2.6[8]
respectively and , for every
.

All Rights Reserved © 2021 IJARTET 1

 ISSN 2394-3777 (Print)
ISSN 2394-3785 (Online)
Available online at www.ijartet.com

International Journal of Advanced Research Trends in Engineering and Technology (IJARTET)

Vol. 8, Issue 2, February 2021

Let be an . The number of edges Let be an IFGST and let be

(the cardinality of ) is called the size of and is denoted an arc in G. If and
by all . then arc is called strong arc.

Definition 2.7[8] Example 3.1.

Let be an . If are vertices
in ,then is
called the μ− strength of connectedness between and
and is
called the − strength of connectedness between and .
If the path of length connected by the vertices then
=

such that and

Figure 3.1
such that In the above figure, for edge
Definition 2.8[7] , ,
Let be an . The complement of is
an , where
(i)
(ii) and for all
(iii) and
for all is a strong arc.
. Similarly, and are strong arc.
Definition 2.9[9] Definition 3.2
An Intuitionistic Fuzzy Graph of second Let be an IFGST and let any two
type( ) is of the form , where vertices . We say that dominates in if there
(i) such that and exists a strong arc between them.
denote the degree of membership and non - Example 3.2
membership of the element respectively In figure 3.1, dominates and dominates
and , for every and vice versa.
. Definition 3.3
(ii) where and Let be an IFGST. A subset of is
are such that said to be a dominating set in if for every , there
exists such that dominates .
Example 3.3
and 0 , for every In figure 3.1, dominating sets of are
,( ). , , and
.
III. MAIN RESULTS Definition 3.4
Let be an IFGST. Let be the
In this section we defined domination in IFGST and dominating set of . The dominating set is called minimal
also some properties of domination in IFGST. dominating set, if no proper subset of is dominating set.
Definition 3.1 Example 3.4
In figure 3.1 (or in Example 3.3), the minimal

All Rights Reserved © 2021 IJARTET 2

 ISSN 2394-3777 (Print)
ISSN 2394-3785 (Online)
Available online at www.ijartet.com

International Journal of Advanced Research Trends in Engineering and Technology (IJARTET)

Vol. 8, Issue 2, February 2021

dominating set are and . Figure 3.3

Definition 3.5
Let be an IFGST. The lower
domination number of is defined as the minimum
cordinality among all minimal dominating set of and it is
denoted by .
The upper domination number of is defined as
the minimum cordinality among all minimal dominating set
of and it is denoted by .
Example 3.5
Figure 3.4
In figure 3.1 ( in Example 3.4),
Theorem 3.1.
; . A dominating set of an intuitionistic fuzzy graph
Definition 3.6
of second type is minimal if and only if for each
Let be an IFGST. A vertex is
one of the following conditions is satisfied.
called an isolated vertex if ( and (
(i) is not a strong neighbor of any vertex in .
.
(ii) There is a vertex such that
Example 3.6.
Proof :
Let be an and let a minimal
dominating set of is . Then for every vertex we
find that is not a dominating set and hence there
exists which is not dominated by any
vertex in . If , we get is not a strong
neighbor of any vertex in and , is not dominated
Figure 3.2 by but is dominated by , then the vertex is
In the above Figure 3.2, is an isolated vertex of . strong neighbor only to d in . Therefore,
Note : An isolated vertex does not dominate any other vertex
in IFGST. Conversely, assume that is a dominating set and
Definition 3.7 for each vertex one of the above conditions holds.
Let be an IFGST.The complement of Suppose is not a minimal dominating set, then there exists
is on IFGST, here a vertex is a dominating set. Hence is
(i) a strong neighbor to atleast one vertex in , the
(ii) and for all condition (i) does not hold. If is a dominating set
(iii) and then every vertex in is a strong neighbor to atleast one
vertex in , the condition(ii) does not hold, which is a
contradiction our assumption that atleast one of these
for all conditions holds. Therefore is a minimal dominating set.
Example 3.7. Theorem 3.2.
Let be an without isolated
vertices and is a minimal dominating set. Then is
a dominating set of
Proof :
Let be an and let a minimal
dominating set of is . Let be any vertex of . Given
that has no isolated vertices, there is a vertex
must be dominated by atleast one vertex
in , that is is a dominating set. By

All Rights Reserved © 2021 IJARTET 3

 ISSN 2394-3777 (Print)
ISSN 2394-3785 (Online)
Available online at www.ijartet.com

International Journal of Advanced Research Trends in Engineering and Technology (IJARTET)

Vol. 8, Issue 2, February 2021

theorem 3.1, it follows that Therefore each [3]. J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications,
American Elesevier Publishing Co., New York (1976).
vertex in is dominated by atleast one vertex in and
is a dominating set. [4]. E. J. Cockayne and S. T. Hedetnieme,Towards a Theory of
Domination in Graphs, Networks 7 (1977), 247-261.
Theorem 3.3.
For any , , where [5]. M. G. Karunambigai and R. Parvathi, Intuitionistic Fuzzy Graphs,
is the lower domination number of and equality Proceedings of 9th Fuzzy Days International Conference on
Computational Intelligence, Advances in soft computing:
holds if and only if and Computational Intelligence,Theory and Applications, Springer-
0< < for all . Verlag, 20 (2006), 139-150.
Proof : [6]. Mordeson N. John and Nair S. Premchand, Fuzzy Graphs and
When the result is Fuzzy Hypergraphs, Physica-Verlag, New York (2000).
obvious. If if and only if [7]. R. Parvathi, M. G. Karunambigai and K. Atanassov, Operations on
and < for all Intuitionistic Fuzzy Graphs, Proceedings of IEEE International
Conference on Fuzzy Systems (FUZZ-IEEE),August 2009, 1396-
. d(G) = 2 O(G) if and only 1401.
if and [8]. R. Parvathi and G. Thamizhendhi, Domination in intuitionistic
for all fuzzy graphs, Fourteenth Int. Conf. on IFSs, Sofia, 15-16 May
which implies and 2010,NIFS Vol. 16 (2010), 2, 39-49

Therefore, [9]. S. Sheik Dhavudh and R. Srinivasan, Intuitionistic Fuzzy Graphs

of Second Type, Advances in Fuzzy Mathematics. 12 ( 2) (2017),
Corollary 3.4. 197-204
Let be any with no isolated
[10]. A. Shannon and K. Atanassov,A first step to a theory of the
vertices, then intuitionistic fuzzy graphs,Proceedings of the 1st Workshop
Corollary 3.5. onFuzzy Based Expert Systems(D,Lakov,Ed.), Sofia,September
Let be an such that both and 28-30, 1994,59-61.
have no isolated vertices. Then [11]. A. Somasundram and S. Somasundaram, Domination in Fuzzy
, where is the lower Graphs-I, Pattern Recognition Letters, 19 (1998), 787-791.
domination number of . Further equality holds if and only [12]. Yan Luo and Changrui Yu, A Fuzzy Optimization Method for
if Multi-Criteria Decision Making Problem Based on the Inclusion
Theorem 3.6. Degrees of Intuitionistic Fuzzy Sets, Journal of Information and
Computing Science, 3(2) (2008), 146-152.

Proof : [13]. L. A. Zadeh, Fuzzy Sets, Information Sciences, 8 (1965), 338-353.

Let be an and let in
Assume that . Then is a
dominating set of , therefore
.

IV. CONCLUSION
Here we have defined strong arc, dominating set and
domination number in IFGST . Also some theorems related
to the concepts are discussed. In future some more theorems
and application of IFGST are studied.

REFERENCES
[1]. K. Atanassov, Intuitionistic Fuzzy Sets: Theory and Applications,
Physica-Verlag, New York (1999).
[2]. K. Atanassov and A. Shannon,On a generalisation of Intuitionistic
fuzy graph,Notes on Intuitionistic fuzy Sets, 8(2002), 73-78.

All Rights Reserved © 2021 IJARTET 4