International Journal of Pure and Applied Mathematics

————————————————————————–
Volume 72 No. 4 2011, 555-564

TRANSLATES OF INTUITIONISTIC FUZZY SUBGROUPS

P.K. Sharma
Department of Mathematics
D.A.V. College
Jalandhar City, Punjab, INDIA

Abstract: As an abstraction of the geometric notion of translation, we in-

troduce two operators Tα+ and Tα− called the intuitionistic fuzzy translation
operator on the intuitionistic fuzzy set A. We investigate their properties and
also studied their action on Intuitionistic fuzzy subgroups of a group.

AMS Subject Classification: 03F55, 20M12, 08A72

Key Words: intuitionistic fuzzy set (IFS), intuitionistic fuzzy subgroup
(IFSG), intuitionistic fuzzy normal subgroup (IFNSG), translation, operator,
coset

1. Introduction

The concept of Translates in fuzzy subgroups has been discussed by Souriar

Sebastian [4]. Here we extend this study to the Intuitionistic fuzzy subgroups.
First we define the operator Tα+ and Tα− on Intuitionistic fuzzy sets and derive
some of their properties. Then we investigate their action on Intuitionistic
fuzzy subgroups of a group. We study the interaction of these operators with
intuitionistic fuzzy coset formation..

2. Preliminaries

Atanassov introduced in [1] the concept of intuitionistic fuzzy sets defined on a

non-empty set X as objects having the form
A = {<x, µA (x), νA (x)>; x ∈ X},
where the functions µA : X → [0, 1] and νA : X → [0, 1] denote the degree of

Received: August 14, 2011 c 2011 Academic Publications, Ltd.

556 P.K. Sharma

membership and the degree of non-membership of each element x ∈ X to the

set A, respectively. Here 0 ≤ µA (x), νA (x) ≤ 1, for all x ∈ X. Such defined
objects are studied by many authors and have many interesting applications in
mathematics.
Let A and B be two intuitionistic fuzzy subsets of a set X. Then the following
expressions are defined in [1], [2].
(i) A ⊆ B if and only if µA (x) ≤ µB (x) and νA (x) ≥ νB (x),
(ii) A = B if and only if A ⊆ B and B ⊆ A,
(iii) AC = { <x, νA (x), µA (x) >; x ∈ X },
(iv) A ∩ B = { <x, min{ µA (x), µB (x)}, max{ νA (x), νB (x)}>: x ∈ X},
(v) A ∪ B = { <x, max{ µA (x), µB (x)} ,min{ νA (x), νB (x)}>: x ∈ X}.
For the sake of simplicity, we shall use the symbol A = (µA , νA ) for the
intuitionistic fuzzy subset A = { <x, µA (x), νA (x) >; x ∈ X }
Definition 2.1. (see [3], [5]) An IFS A = (µA , νA ) of a group G is said to
be intuitionistic fuzzy subgroup of G ( in short IFSG) of G if

1. µA (xy) ≥ Min { µA (x), µA (y)}

2. µA (x−1 ) = µA (x)

3. νA (xy) ≤ Max { νA (x), νA (y)}

4. νA (x−1 ) = νA (x), for all x, y ∈G

In other words. An IFS A of X is IFSG of G iff µA (xy−1 ) ≥ Min { µA (x),

µA (y)}and νA (xy−1 ) ≤ Max { νA (x), νA (y)}holds for all x, y ∈G.
Definition 2.2. (see [3], [5]) An IFSG A = (µA , νA ) of a group G said to
be intuitionistic fuzzy normal subgroup of G ( in short IFNSG) of G if
1. µA (xy) = µA (yx)

2. νA (xy) = νA (yx), for all x, y ∈G

Definition 2.3. (see [3], [5]) Let G be a group and A be IFSG of group G.
Let x ∈G be a fixed element. Then for every element g ∈G, we define
1. (xA)(g) = (µxA (g), νxA (g)), where µxA (g) = µA (x −1 g) and νxA (g) =
νA (x −1 g) is called intuitionistic fuzzy left coset of G determined by A
and x
TRANSLATES OF INTUITIONISTIC FUZZY SUBGROUPS 557

2. Ax(g) = (µAx (g), νAx (g)), where µAx (g) = µA (gx −1 ) and νAx (g) = νA (gx −1 )
is called the intuitionistic fuzzy right coset of G determined by A and x.

3. The Operators Tα+ and Tα−

Definition 3.1. Let A = (µA , νA ) be an IFS of X and α ∈ [ 0, 1]. We

define
Tα + (A)(x) = (µTα + (x), ν Tα + (x))
and
Tα − (A)(x) = (µTα − (x), ν Tα − (x)) ,
where
µTα + (x) = Min{ µA (x) +α, 1}, ν Tα + (x) = Max{ νA (x) - α, 0 }
and
µTα − (x) = Max { µA (x) - α, 0}, ν Tα − (x) = Min{ νA (x) +α, 1 }
Tα+ (A) and Tα− (A) are respectively called the α- up and α- down intu-
itionistic fuzzy operators of A. We shall call Tα + and Tα − as the intuitionistic
fuzzy operator.
Results 3.2. The following results can be easily verified from our defini-
tions:

(i)T0+ (A) = T0 − (A) = A, (ii)T1 + (A) = 1∼ , (iii)T1 − (A) = 0∼ .

Remark 3.3. It can be easily checked that if A is IFS of X, then both

Tα + (A) and Tα − (A) are IFS of X. In other words 0 ≤ µTα + (x) +ν Tα + (x) ≤
1 and 0 ≤ µTα − (x) +ν Tα − (x) ≤ 1, for all x ∈X.
Example 3.4. Let X = { 1, ω, ω 2 }. Let A = { <1, 0.3, 0.4 >, <ω, 0.1,
0.25 >, <ω 2 , 0.5, 0.3 >}be an IFS of X Take α = 0.2, then:

Tα + (A) = {{<1, 0.5, 0.2>, <ω, 0.3, 0.05>, <ω 2 , 0.7, 0.1>}}

and
Tα − (A) = {{<1, 0.1, 0.6>, <ω, 0, 0.45>, <ω 2 , 0.3, 0.5>}}.

Proposition 3.5. For any IFS A of X and α ∈ [0,1], we have

Tα + (Ac ) = (Tα − (A))c , (ii)Tα − (Ac ) = (Tα + (A))c

558 P.K. Sharma

Proof. Let A = (µA , νA ) be an IFS of X and let x ∈X, α ∈ [0,1]. Then

Ac = (µcA , νA
c ) = (ν , µ ) be the complement of A.
A A

1. Let Tα + (Ac )(x) = ( µ′Tα + (x), ν′ Tα + (x)),

where µ′Tα + (x) = Min{ µcA (x) +α, 1 }= Min { νA (x) +α, 1 }= ν Tα − (x) and
ν′ Tα + (x) = Max { νA c (x) - α, 0}= Max { µ (x) - α , 0 }= µ
A Tα + (x).
Thus Tα + (A )(x) = ( ν Tα − (x), µTα + (x)) = ( Tα − (A))c (x).
c

Hence Tα + (Ac ) = ( Tα − (A))c .

(ii) Let Tα − (Ac )(x) = ( µ′′Tα − (x), ν′′ Tα − (x)), where µ′′Tα − (x) = Max{
µcA (x) - α, 0 }= Max { νA (x) - α , 0 }= ν Tα+ (x) and ν′′ Tα − (x) = Min {
c (x) +α, 1}= Min { µ (x) +α, 1 }= µ
νA A Tα + (x).
Thus Tα − (Ac )(x) = (ν Tα + (x), µTα + (x)) = ( Tα + (A))c (x).
Hence Tα − (Ac ) = ( Tα + (A))c .
Next, we show that; in general, for any given α ∈ [0,1], the operators
Tα + and Tα − donot commute each other. In other words Tα − (Tα + (A)) and
Tα + (Tα − (A)) may be different from A.
Example 3.6. Let X = { 1, ω, ω 2 }.Let A = { <1, 0.3, 0.4 >, <ω, 0.1,
0.25 >, <ω 2 , 0.5, 0.3 >}be an IFS of X Take α = 0.3, then

Tα + (A) = {{<1, 0.6, 0.1>, <ω, 0.4, 0>, <ω 2 , 0.8, 0>}

and Tα − (A) = { { <1, 0, 0.7 >, <ω, 0, 0.55 >, <ω 2 , 0.2, 0.6 >}.
Now Tα − (Tα + (A)) = { <x, µ∗Tα − (x), ν∗ Tα − (x) >; x ∈ X }, where
∗
µTα − (x) = Max { µTα + (x) - α, 0 }and ν∗ Tα − (x) = Min { ν Tα + (x) +α,
1 }.
Therefore Tα − (Tα + (A)) = { <1, 0.3, 0.4 >, <ω, 0, 0.3 >, <ω 2 , 0.5, 0.3
>}6= A and Tα + (Tα − (A)) = { <x, µ∗∗ Tα + (x), ν ∗ ∗ Tα + (x) >; x ∈ X }, where
∗∗
µTα + (x) = Min { µTα − (x) +α, 1 }and ν ∗ ∗ Tα + (x) = Max { ν Tα − (x) -
α, 0 }
Therefore Tα + (Tα − (A)) = { <1, 0.3, 0.4 >, <ω, 0.3, 0.25 >, <ω 2 , 0.5, 0.3
>}6= A
It may be checked that if we take α = 0.2, then Tα − (Tα + (A)) = A
Theorem 3.7. For any IFS A of X and α ∈ [0,1]

1. Tα − (Tα + (A)) = A ⇔ α ≤ Min { 1 - p, q }

where p = Max { µA (x) : x ∈X }and q = Min { νA (x) : x ∈X }

1. Tα + (Tα − (A)) = A ⇔ α ≤ Min { p′, 1 - q′ }

TRANSLATES OF INTUITIONISTIC FUZZY SUBGROUPS 559

Where p′ = Min { µA (x) : x ∈X }and q′ = Max { νA (x) : x ∈X }

Proof. ( i ) An easy calculation shows that, for any x ∈ X,
Tα − (Tα + (A))(x) = ( Max{ Min{ µA (x) + α,1}-α,0}, Min{ Max{ νA (x)-α,
0 }+ α, 1})
Now Tα − (Tα + (A)) = A ⇔ Max{ Min{ µA (x) +α, 1}, 0}= µA (x) and
Min{ Max{ νA (x)- α, 0 }+α, 1}= νA (x) for all x ∈X
⇔ Max{ Min{ µA (x),1- α ), 0}= µA (x) and Min{ Max{ νA (x), α), 1}=
νA (x)
⇔ µA (x) ≤ 1- α and νA (x) ≥ α for all x ∈X
⇔ Max { µA (x) : x ∈X }≤ 1- α and Min { νA (x) : x ∈X }≥ α
⇔ p ≤ 1- α and q ≥ α ⇔ α ≤ 1- p and α ≤ q
⇔ α ≤ Min { 1 - p, q }
( ii ) An easy calculation shows that, for any x ∈ X,
Tα + (Tα − (A))(x) = (Min{ Max{ µA (x) - α,0}+α,1}, Max{ Min{ νA (x) +α,
1 } - α, 0})
Tα + (Tα − (A)) = A ⇔ Min{ Max{ µA (x)- α,0}+α ,1}= µA (x) and
Max{ Min{ νA (x) +α ,1 }- α, 0}= νA (x) for all x ∈X
⇔ Min{ Max{ µA (x), α }, 1}= µA (x) and Max{ Min{ νA (x),1-α}, 0}=
νA (x)
⇔ Max{ µA (x), α }= µA (x) and Min{ νA (x),1-α}for all x ∈X
⇔ µA (x) ≥ α and νA (x) ≤ 1-α for all x ∈X
⇔ Min { µA (x) : x ∈X }≥ α and Max { νA (x) : x ∈X }≤ 1-α
⇔ p′ ≥ α and q′ ≤ 1-α ⇔ α ≤ p′ and α ≤ 1 - q′
⇔ α ≤ Min { p′, 1 - q′ }.
Proposition 3.8. For any IFS A of X and α, β ∈ [0,1]

T(α+β)+ (A) if α+β¡1
1. Tα+ (Tβ+ (A)) = Tβ+ (Tα+ (A)) =
1∼ if α+β = 1

T(α+β)− (A) if α+β¡1
2. Tα− (Tβ− (A)) = Tβ− (Tα− (A)) =
0∼ if α+β = 1

Proof. The proof is obvious.

Remark 3.9. For any IFS’s A and B of X with A ⊆ B, we have
Tα + (A) ⊆ Tα + (B) and Tα − (A) ⊆ Tα − (B), for all α ∈ [0,1]
Thus the Intuitionistic fuzzy operators are isotones.
560 P.K. Sharma

4. Translation of Intuitionistic Fuzzy Groups

Here we study the action of Tα + and Tα − on IFSG of a group G. We prove

that these operators takes on IFSG to an IFSG and preserve some properties
of Intuitionistic fuzzy group.
Theorem 4.1. If A is IFSG of a group G, then Tα + (A) and Tα − (A) are
IFSG of G, for all α ∈ [0,1].
Proof. Let A be IFSG of a group G and α ∈ [0,1].
Let x, y ∈ G be any elements, we have Tα + (A)(xy −1 ) = ( µTα + ( xy −1 ),

ν Tα + (xy −1 )).
Here
µTα + ( xy −1 ) = Min { µA ( xy −1 ) + α, 1 }
≥ Min { Min { µA ( x ), µA ( y ) }+α, 1 }
= Min { Min { µA ( x ) + α, µA ( y ) +α }, 1 }
= Min { Min { µA ( x ) + α, 1}, Min { µA ( y ) +α, 1 }}
= Min { µTα + ( x ), µTα + ( y ) }
i.e. µTα + ( xy −1 ) ≥ Min { µTα + ( x ), µTα + ( y ) }. Similarly:
νTα + ( xy −1 ) = Max { νA ( xy −1 ) − α, 0 }
≤ Max { Max { νA ( x ), νA ( y ) }- α, 0 }
= Max { Max { νA ( x ) - α, µA ( y ) - α }, 0 }
= Max { Max { µA ( x ) - α, 0}, Max { µA ( y ) - α, 0 }}
= Max { νTα + ( x ), νTα + ( y ) }
i.e. νTα + ( xy −1 ) ≤ Max { νTα + ( x ), νTα + ( y ) }.
Thus Tα + (A) is IFSG of group G (follows from Proposition 2.1).
Similarly, we can show that Tα − (A) is IFSG of group G.
Remark 4.2. If Tα + (A) or Tα − (A) is IFSG of group G, for a particular
value of α ∈ [ 0,1], then it cannot be deduced that A is IFSG of group G.
Example 4.3. Let G be the Klein 4-group { e, a, b, ab }, where a2 = b2 =
e and ab = ba. Define A = { <e, 0.9, 0.1 >, <a, 0.65, 0.3 >, <b, 0.61, 0.29 >,
<ab, 0.6, 0.31 >}be IFS in G. Take α = 0.4, then

Tα + (A) = {<e, 1, 0>, <a, 1, 0>, <b, 1, 0>, <ab, 1, 0>} = 1∼ .

Clearly, Tα + (A) is an IFSG of G, however A is not IFSG of G.

Proposition 4.4. (see [3]) Let G be a group with identity element e and
A be any IFS of G. Then set GA = { x ∈ G ; µA ( x ) = µA ( e ) and νA ( x )
= νA ( e ) } is a subgroup of G.
TRANSLATES OF INTUITIONISTIC FUZZY SUBGROUPS 561

Proposition 4.5. Let A be IFS of a group G such that Tα + (A) be IFSG

of G, for some α ∈ [0,1] with α <Min { 1- p′′ , q′′ }, then A is IFSG of G, where

p′′ = M ax{µA (x) : x ∈ G − GA }

and
q′′ = M in{νA (x) : x ∈ G − GA }.

Proof. Let Tα + (A) be IFSG of G, for some α ∈ [0,1] with α <Min { 1- p′′ ,
q′′ }
Therefore, for any x, y ∈ G, we have
Tα + (A)(xy −1 ) = ( µTα + ( xy −1 ), ν Tα + (xy −1 )), Where µTα + ( xy−1 ) ≥
Min{ µTα + (x), µTα + (y)}and νTα + ( xy−1 ) ≤ Max{ νTα + (x), νTα + ( y)}(*)
Case (i) When µTα + (x) = 1 and µTα + (y) = 1
As 0 ≤ µTα + (x) +ν Tα + (x) ≤ 1 and 0 ≤ µTα + (y) +ν Tα + (y) ≤ 1, for all
x, y ∈G
Therefore νTα + (x) = 0 and νTα + ( y) = 0
Min { µA ( x ) +α, 1 }= 1, Min { µA ( y ) + α, 1 }= 1 and
Max { νA ( x ) - α, 0 }= 0, Max { νA ( y ) - α, 0 }= 0
⇒ µA ( x ) +α ≥ 1, µA ( y ) +α ≥ 1 and
νA ( x ) - α ≤ 0, νA ( y ) - α ≤ 0
⇒ µA ( x ) ≥ 1 - α, µA ( y ) ≥ 1 - α and νA ( x ) ≤ α, νA ( y ) ≤ α -(1)
Since α <Min { 1- p′′ , q′′ }⇒ α <1- p′′ and α <q′′
⇒ p′′ <1 - α and q′′ >α
⇒ Max { µA ( x ) : x ∈G -GA }<1 - α and Min { νA ( x ) : x ∈G -GA }>α
and Max { µA ( y ) : y ∈G -GA }<1 - α and Min { νA ( y ) : y ∈G -GA }>α
Therefore from (1), we get x ∈ GA and y ∈ GA , but GA is a subgroup of G
⇒ xy −1 ∈ GA and so
µA (xy −1 ) = µA ( e ) = Min { µA ( e ), µA ( e )}= Min { µA ( x ), µA ( y )}
i.e. µA (xy −1 ) ≥ Min { µA ( y ), µA ( y )}
also νA (xy −1 ) = νA ( e ) = Max { νA ( e ), νA ( e ) }= Max { νA ( x ), νA (
y )}
i.e. νA (xy −1 ) ≤ Max { νA ( x ), νA ( y )}.
Case (ii) When µTα + (x) = 1 and µTα + (y) <1
As in case (i), we get x ∈ GA and so µA (x ) = µA ( e ) and νA ( x ) = νA ( e )
From (*), we get
µTα + ( xy−1 ) ≥ Min{ µTα + (x), µTα + (y)}= Min{ 1, µTα + (y)}= µTα + (y)}
⇒ Min{ µA (xy−1 )+ α, 1 }≥ Min{ µA (y) +α, 1 }
562 P.K. Sharma

⇒ µA (xy−1 ) + α ≥ µA (y) +α
⇒ µA (xy−1 ) ≥ µA (y) = Min { µA (e ), µA (y )}= Min { µA (x ), µA (y )}
Thus µA (xy−1 ) ≥ Min { µA (x ), µA (y )}
Also νTα + ( xy−1 ) ≤ Max{ νTα + (x), νTα + ( y)}= Max{ 0, νTα + ( y)}=
νTα + ( y)
⇒ Max { νA (xy−1 ) - α, 0 }≤ Max { νA (y) - α, 0 }
⇒ νA (xy−1 ) − α ≤ νA (y) - α
⇒ νA (xy−1 ) ≤ νA (y) = Max { νA (e), νA (y)}= Max { νA (x), νA (y)}
Thus νA (xy−1 ) ≤ Max { νA (x), νA (y)}.
Case (iii) When µTα + (x) <1 and µTα + (y) <1
Min { µA (x) +α, 1 }<1 and Min{ µA (y) +α, 1}<1
⇒ µA (x) +α <1 and µA (y) +α <1. From (*), we get
µTα + ( xy−1 ) ≥ Min{ µTα + (x), µTα + (y)}and νTα + ( xy−1 ) ≤ Max{ νTα + (x),
νTα + ( y)}
⇒ Min{ µA (xy−1 )+ α, 1}≥ Min{ Min{ µA (x) +α, 1}, Min{ µA (y) +α, 1}}
= Min { µA (x) +α, µA (y) +α }
= Min { µA (x), µA (y) }+α
Thus µA (xy−1 ) + α ≥ Min { µA (x), µA (y) }+α
i.e. µA (xy−1 ) ≥ Min { µA (x), µA (y) }
also Max{ νA (xy−1 ) − α , 0}≤ Max{ Max{ νA (x)- α, 0 }, Max { νA (y) - α,
0 }}
= Max { νA (x)- α, νA (y) - α }
= Max { νA (x), νA (y)}- α
Thus νA (xy−1 ) − α ≤ Max { νA (x), νA (y)}- α
i.e. νA (xy−1 ) ≤ Max { νA (x), νA (y)}
Hence A is IFSG of G.
Proposition 4.6. Let A be IFS of a group G such that Tα − (A) be IFSG
of G, for some α ∈ [0,1] with α <Min { 1- p∗ , q∗ }, then A is IFSG of G, where
p∗ = Max { νA ( x ) : x ∈G -GA }and q* = Min { µA ( x ) : x ∈G -GA }
Proof. Similar to the proof of Proposition (4.5)
Theorem 4.7. If A is IFNSG of a group G, if and only if Tα + (A) and
Tα − (A) are IFNSG of G, for all α ∈ [0,1].
Proof. Firstly let A be IFNSG of group G and α ∈ [0,1] be any real number.
A is IFSG of G and µA (x y) = µA (yx) , νA (x y) = νA (y x) holds for all x ,
y ∈G.
By Theorem (4.1), Tα + (A) and Tα − (A) are IFSG of G. Now for x, y ∈G.,
we have
TRANSLATES OF INTUITIONISTIC FUZZY SUBGROUPS 563

Tα + (A)(xy) = (µTα + (xy), ν Tα + (xy)) = ( Min{ µA (xy) +α ,1}, Max{

νA (xy)-α, 0})
= ( Min{ µA (yx) +α ,1}, Max{ νA (yx)-α, 0})
= (µTα + (yx), ν Tα + (yx))
= Tα + (A)(yx)
Hence Tα + (A) is IFNSG of G. Similarly we can show Tα − (A) is also IFNSG
of G.
Conversely, let Tα + (A) and Tα − (A) are IFNSG of group G for all α ∈ [0,1]
Take α = 0, we get T0 + (A) = A and T0 − (A) = A
Hence A is IFNSG of group G.
Proposition 4.8. Let A be IFS of a group G such that Tα + (A) be IFSNG
of G, for some α ∈ [0,1] with α <Min { 1- p′′ , q′′ }, then A is IFNSG of G,
where
p′′ = Max { µA ( x ) : x ∈G -GA }and q′′ = Min { νA ( x ) : x ∈G -GA }
Proof. Follows from Propositions 4.5 and 4.7.
Proposition 4.9. Let A be IFS of a group G such that Tα − (A) be IFNSG
of G, for some α ∈ [0,1] with α <Min { 1- p∗ , q∗ }, then A is IFNSG of G,
where
p∗ = Max { νA ( x ) : x ∈G -GA }and q* = Min { µA ( x ) : x ∈G -GA }
Proof. Follows from Propositions (4.6) and (4.7)
Proposition 4.10. For any IFSG of a group G and x ∈ G, α ∈ [0,1], we
have

1. (Tα + (A))x = Tα + (Ax) (ii) x(Tα + (A)) = Tα + (xA)

Proof. For any g ∈ G, we have

(i) ((Tα + (A))x)(g) = (Tα + (A))(gx−1 )
= (µTα + ( gx−1 ), ν Tα + ( gx−1 ))
= ( Min{ µA (gx−1 ) + α, 1}, Max{ νA (gx−1 )-α, 0})
= ( Min{ µAx (g) +α ,1}, Max{ νAx (g)-α, 0})
= Tα + (Ax)(g)
Thus (Tα + (A))x = Tα + (Ax)
(ii) ( x(Tα + (A)))(g) = (Tα + (A))(x−1 g)
= (µTα + ( x−1 g), ν Tα + ( x−1 g))
= ( Min{ µA (x−1 g) +α, 1}, Max{ νA (x−1 g)-α, 0})
= ( Min{ µxA (g) +α ,1}, Max{ νxA (g)-α, 0})
= (Tα + (xA))(g)
564 P.K. Sharma

Thus x(Tα + (A)) = Tα + (xA)

Proposition 4.11. For any IFSG of a group G and x ∈ G, α ∈ [0,1], we
have

1. (Tα − (A))x = Tα − (Ax) (ii) x(Tα − (A)) = Tα − (xA)

Proof. The proof is similar to Proposition 4.10.

From Propositions 4.10 and 4.11 we see that intuitionistic fuzzy translation
operators commute with intuitionistic fuzzy coset formation.

5. Conclusion

We observed that some intuitionistic fuzzy group theoretical concepts are well-
behaved with respect to the intuitionistic fuzzy translation operators, in the
sense that, they either remain invariant under the action of the operators or
commute with them. But it is yet to see those properties which donot behave
like these.

References

[1] K.T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20, No.
1 (1986), 87-96.

[2] Kul Hur, Su Youn Jang, The lattice of Intuitionistic fuzzy congruences,
International Mathematical Forum, 1, No. 5 (2006), 211-236.

[3] N. Palaniappan, S. Naganathan, K. Arjunan, A study on intuitionistic L-

fuzzy subgroups, Applied Mathematical Sciences, 3, No. 53 (2009), 2619-
2624.

[4] Souriar Sebastian, A Study of Translates of Fuzzy Subgroups, Ph.D. Thesis,

Cochin University of Sciences and Technology, Cochin (1993).

[5] P.K. Sharma, (α, β)-cut of intuitionistic fuzzy groups, International Math-
ematical Forum, 6, No. 53 (2011), 2605-2614.

[6] L.A. Zadeh, Fuzzy sets, Information and Control, 8 (1965), 338-353.