# Certain Concepts inm-Polar Fuzzy Graph Structures

Authors: Muhammad Akram; Noura Alshehri; Rabia Akmal
Journal: Discrete Dynamics in Nature and Society
 (2016)

---

## Abstract

We apply the concept ofm-polar fuzzy sets to graph structures. We introduce certain concepts in m-polar fuzzy graph structures, including strong m-polar fuzzy graph structure, m-polar fuzzy D
i-cycle, m-polar fuzzy D
i-tree, m-polar fuzzy D
i-cut vertex, and m-polar fuzzy D
i-bridge, and we illustrate these concepts by several examples. We present the notions of ϕ-complement of an m-polar fuzzy graph structure and self-complementary, strong self-complementary, totally strong self-complementary m-polar fuzzy graph structures, and we investigate some of their properties.


---

## Body

## 1. Introduction

Graph theory has applications in many areas of computer science, including data mining, image segmentation, clustering, image capturing, and networking. A graph structure, introduced by Sampathkumar [1], is a generalization of undirected graph which is quite useful in studying some structures including graphs, signed graphs, and graphs in which every edge is labeled or colored. A graph structure helps to study the various relations and the corresponding edges simultaneously.A fuzzy set [2] is an important mathematical structure to represent a collection of objects whose boundary is vague. Fuzzy models are becoming useful because of their aim in reducing the differences between the traditional models used in engineering and science. Nowadays fuzzy sets are playing a substantial role in chemistry, economics, computer science, engineering, medicine, and decision-making problems. In 1997, Zhang [3] generalized the idea of a fuzzy set and gave the concept of bipolar fuzzy set on a given set X as a map which associates each element of X to a real number in the interval [
-
1,1
]
. In 2014, Chen et al. [4] introduced the idea of m-polar fuzzy sets as an extension of bipolar fuzzy sets and showed that bipolar fuzzy sets and 2-polar fuzzy sets are cryptomorphic mathematical notions and that we can obtain concisely one from the corresponding one in [4]. The idea behind this is that “multipolar information” (not just bipolar information which corresponds to two-valued logic) exists because data for a real world problem are sometimes from n agents (
n
≥
2
). For example, the exact degree of telecommunication safety of mankind is a point in [
0,1
]
n
(
n
≈
7
×
1
0
9
) because different person has been monitored different times. There are many examples such as truth degrees of a logic formula which are based on n logic implication operators (
n
≥
2
), similarity degrees of two logic formula which are based on n logic implication operators (
n
≥
2
), ordering results of a magazine, ordering results of a university, and inclusion degrees (accuracy measures, rough measures, approximation qualities, fuzziness measures, and decision preformation evaluations) of a rough set.Kauffman [5] gave the definition of a fuzzy graph in 1973 on the basis of Zadeh’s fuzzy relations [6]. Rosenfeld [7] discussed the idea of fuzzy graph in 1975. Further remarks on fuzzy graphs were given by Bhattacharya [8]. Several concepts on fuzzy graphs were introduced by Mordeson and Nair [9]. In 2011, Akram introduced the notion of bipolar fuzzy graphs in [10]. Alshehri and Akram [11] introduced the concept of bipolar fuzzy competition graphs. In 2015, Akram and Younas studied certain types of irregular m-polar fuzzy graphs in [12]. Akram and Adeel studied m-polar fuzzy line graphs in [13]. Akram and Waseem introduced certain metrics in m-polar fuzzy graphs in [14]. Dinesh [15] introduced the notion of a fuzzy graph structure and discussed some related properties. Akram and Akmal [16] introduced the concept of bipolar fuzzy graph structures. In this paper, we apply the concept of m-polar fuzzy sets to graph structures. We introduce certain concepts in m-polar fuzzy graph structures, including strong m-polar fuzzy graph structure, m-polar fuzzy D
i-cycle, m-polar fuzzy D
i-tree, m-polar fuzzy D
i-cut vertex, and m-polar fuzzy D
i-bridge, and we illustrate these concepts by several examples. We present the notions of ϕ-complement of an m-polar fuzzy graph structure and self-complementary, strong self-complementary, totally strong self-complementary m-polar fuzzy graph structures, and we investigate some of their properties.


## 2. Preliminaries

In this section, we review some basic concepts that are necessary for fully benefit of this paper.In1965, Zadeh [2] introduced the notion of a fuzzy set as follows.Definition 1 (see [2, 6]).
Afuzzy set
μ in a universe X is a mapping μ
:
X
→
[
0,1
]. Afuzzy relation on X is a fuzzy set ν in X
×
X. Let μ be a fuzzy set in X and ν fuzzy relation on X. We call ν a fuzzy relation on μ if ν
(
x
,
y
)
≤
m
i
n
{
μ
(
x
)
,
μ
(
y
)
}
∀
x
,
y
∈
X.Definition 2 (see [16]).
G
ˇ
b
=
(
M
,
N
1
,
N
2
,
…
,
N
n
) is called abipolar fuzzy graph structure (BFGS) of a graph structure (GS) G
∗
=
(
U
,
E
1
,
E
2
,
…
,
E
n
) if M
=
(
μ
M
P
,
μ
M
N
) is abipolar fuzzy set on
U and for each i
=
1,2
,
…
,
n
,
N
i
=
(
μ
N
i
P
,
μ
N
i
N
) is abipolar fuzzy set on
E
i such that (1)
μ
N
i
P
x
y
≤
μ
M
P
x
∧
μ
M
P
y
,
μ
N
i
N
x
y
≥
μ
M
N
x
∨
μ
M
N
y
∀
x
y
∈
E
i
⊂
U
×
U
. Note that μ
N
i
P
(
x
y
)
=
0
=
μ
N
i
N
(
x
y
) for all x
y
∈
U
×
U
-
E
i and 0
<
μ
N
i
P
(
x
y
)
≤
1, -
1
≤
μ
N
i
N
(
x
y
)
<
0
∀
x
y
∈
E
i, where U and E
i
(
i
=
1,2
,
…
,
n
) are calledunderlying vertex set andunderlying
i
-edge sets of G
ˇ
b, respectively.Definition 3 (see [16]).
LetG
ˇ
b
=
(
M
,
N
1
,
N
2
,
…
,
N
n
) be a BFGS of a GS G
∗
=
(
U
,
E
1
,
E
2
,
…
,
E
n
)
. Let ϕ be any permutation on the set {
E
1
,
E
2
,
…
,
E
n
} and the corresponding permutation on {
N
1
,
N
2
,
…
,
N
n
}
,
t
h
a
t
i
s
,
ϕ
(
N
i
)
=
N
j, if and only if ϕ
(
E
i
)
=
E
j
∀
i
.
Ifx
y
∈
N
r for some r and (2)
μ
N
i
ϕ
P
x
y
=
μ
M
P
x
∧
μ
M
P
y
-
⋁
j
≠
i
μ
ϕ
N
j
P
x
y
,
μ
N
i
ϕ
N
x
y
=
μ
M
N
x
∨
μ
M
N
y
-
⋀
j
≠
i
μ
ϕ
N
j
N
x
y
,
i
=
1,2
,
…
,
n
, then x
y
∈
B
m
ϕ, while m is chosen such that μ
N
m
ϕ
P
(
x
y
)
≥
μ
N
i
ϕ
P
(
x
y
)
a
n
d
μ
N
m
ϕ
N
(
x
y
)
≤
μ
N
i
ϕ
N
(
x
y
)
∀
i
.
And BFGS(
M
,
N
1
ϕ
,
N
2
ϕ
,
…
,
N
n
ϕ
), denoted by G
ˇ
b
ϕ
c, is called the ϕ-complement of BFGS
G
ˇ
b
.Definition 4 (see [4]).
Anm
-polar fuzzy set (or a [
0,1
]
m-set) on X is exactly a mapping A
:
X
→
[
0,1
]
m
.
Note that a[
0,1
]
m-set is an L-set. An L-set on the set X is a synonym of a mapping A
:
X
→
L, where L is a lattice. So, [
0,1
]
m is considered to be a partial order set with the point-wise order ≤, where m is an arbitrary ordinal number, ≤ is defined by x
≤
y
⇔
p
i
(
x
)
≤
p
i
(
y
) for each i
∈
m, and p
i
:
[
0,1
]
m
→
[
0,1
] is the ith projection mapping (i
∈
m). When L
=
[
0,1
], an L-set on X will be called a fuzzy set on X.Definition 5 (see [14]).
LetC be an m-polar fuzzy subset of a nonempty set V. An m
-polar fuzzy relation on C is an m-polar fuzzy subset D of V
×
V defined by the mapping D
:
V
×
V
→
[
0,1
]
m such that, for all x
,
y
∈
V,  p
i
∘
D
(
x
y
)
≤
i
n
f
{
p
i
∘
C
(
x
)
,
p
i
∘
C
(
y
)
}
,
i
=
1,2
,
…
,
m, where p
i
∘
C
(
x
) denotes the ith degree of membership of the vertex x and p
i
∘
D
(
x
y
) denotes the ith degree of membership of the edge x
y.Definition 6 (see [4, 14]).
Anm
-polar fuzzy graph is a pair G
=
(
C
,
D
), where C
:
V
→
[
0,1
]
m is an m-polar fuzzy set in V and D
:
V
×
V
→
[
0,1
]
m is an m-polar fuzzy relation on V such that (3)
p
i
∘
D
x
y
≤
i
n
f
p
i
∘
C
x
,
p
i
∘
C
y for all x
,
y
∈
V.
We note thatp
i
∘
D
(
x
y
)
=
0 for all x
y
∈
V
×
V
-
E for all i
=
1,2
,
3
,
…
,
m. C is called the m
-polar fuzzy vertex set of G and D is called the m
-polar fuzzy edge set of G, respectively. An m-polar fuzzy relation D on X is called symmetric if p
i
∘
D
(
x
y
)
=
p
i
∘
D
(
y
x
) for all x
,
y
∈
V.


## 3. Certain Concepts inm-Polar Fuzzy Graph Structures

Definition 7.
LetG
∗
=
(
U
,
E
1
,
E
2
,
…
,
E
n
) be a graph structure (GS). Let C be an m-polar fuzzy set on U and D
i an m-polar fuzzy set on E
i such that(4)
p
j
∘
D
i
x
y
≤
i
n
f
p
j
∘
C
x
,
p
j
∘
C
yfor all x
,
y
∈
U, i
∈
n
,
j
∈
m, and p
j
∘
D
i
(
x
y
)
=
0 for x
y
∈
U
×
U
∖
E
i
,
∀
j. Then G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) is called an m-polar fuzzy graph structure (m-PFGS) on G
∗ where C is the m-polar fuzzy vertex set of G
(
m
) and D
i is the m-polar fuzzy i-edge set of G
(
m
).Definition 8.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) and G
(
m
′
)
=
(
C
′
,
D
1
′
,
D
2
′
,
…
,
D
n
′
) be two m-PFGSs of a GS G
∗
=
(
U
,
E
1
,
E
2
,
…
,
E
n
). Then G
(
m
′
) is called an m-polar fuzzy subgraph structure of G
(
m
), if (5)
p
j
∘
C
′
x
≤
p
j
∘
C
x
,
p
j
∘
D
i
′
x
y
≤
p
j
∘
D
i
x
y
,
∀
x
,
y
∈
U
,
j
∈
m
,
i
∈
n
.
G
(
m
′
) is called an m-polar fuzzy induced subgraph structure of G
(
m
) by a set W
⊆
U, if(6)
p
j
∘
C
′
x
=
0
,
x
∈
U
∖
W
p
j
∘
C
x
,
x
∈
W
,
∀
j
,
p
j
∘
D
i
′
x
y
=
0
,
x
,
y
∈
U
∖
W
p
j
∘
D
i
x
y
,
x
,
y
∈
W
,
∀
j
,
∀
i
.
G
(
m
′
) is called an m-polar fuzzy spanning subgraph structure of G
(
m
), if C
′
=
C and (7)
p
j
∘
D
i
′
x
y
≤
p
j
∘
D
i
x
y
f
o
r
j
∈
m
,
i
∈
n
,
x
,
y
∈
U
.Example 9.
Consider a graph structureG
∗
=
(
U
,
E
1
,
E
2
) such that U
=
{
a
1
,
a
2
,
a
3
,
a
4
}, E
1
=
{
a
1
a
2
}, and E
2
=
{
a
3
a
2
,
a
2
a
4
}
. Let C, D
1, and D
2 be 4-polar fuzzy sets on U, E
1, and E
2, respectively, defined by Tables 1 and 2.
By simple calculations, it is easy to check thatG
(
m
)
=
(
C
,
D
1
,
D
2
) is a 4-polar fuzzy graph structure of G
∗ as shown in Figure 1. Note that we represent x
y
∈
D
i as (8)
x
y
i
=
p
1
∘
D
i
x
y
,
…
,
p
m
∘
D
i
x
y
iin all tables and the figures.
A4-polar fuzzy induced subgraph structure of G
(
m
) by U
∖
{
a
4
} and a 4-polar fuzzy spanning subgraph structure of G
(
m
) (Figure 1) are shown in Figure 2.Table 1
C
a
1
a
2
a
3
a
4
p
1
∘
C
0.1
0.3
0.4
0.2
p
2
∘
C
0.0
0.6
0.0
0.0
p
3
∘
C
0.0
0.2
0.4
0.3
p
4
∘
C
0.1
0.0
0.4
0.4Table 2
D
i
(
a
1
a
2
)
1
(
a
3
a
2
)
2
(
a
2
a
4
)
2
p
1
∘
D
i
0.1
0.2
0.2
p
2
∘
D
i
0.0
0.0
0.0
p
3
∘
D
i
0.0
0.2
0.2
p
4
∘
D
i
0.0
0.0
0.0Figure 1
Four-polar fuzzy graph structure.Figure 2
Four-polar fuzzy subgraph structures.Definition 10.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-PFGS. Then x
y
∈
E
i is called an m-polar fuzzy
D
i
-edge or simply a D
i
-edge, if p
j
∘
D
i
(
x
y
)
>
0 for at least one j and we write that x
y
∈
D
i
. Consequently,support of
D
i is defined by(9)
s
u
p
p
D
i
=
x
y
∈
E
i
:
p
j
∘
D
i
x
y
>
0
f
o
r
a
t
l
e
a
s
t
o
n
e
j
.An m-polar fuzzy
D
i
-path, in m-PFGS G
(
m
), is a sequence a
1
,
a
2
,
…
,
a
k of vertices (distinct except the choice a
k
=
a
1) in U such that each a
j
-
1
a
j is an m-polar fuzzy
D
i
-edge for 1
≤
j
≤
k
.Definition 11.
AD
i
-strong
m-PFGS is an m-polar fuzzy graph structure (10)
G
m
=
C
,
D
1
,
D
2
,
…
,
D
n that satisfies(11)
p
j
∘
D
i
x
y
=
i
n
f
p
j
∘
C
x
,
p
j
∘
C
yfor all x
y
∈
D
i
.
G
(
m
) is astrong
m-polar fuzzy graph structure, if it is D
i-strong for all i.Definition 12.
Anm-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) is calledcomplete, if the following three conditions hold:(i)
m
-polar fuzzy graph structure G
(
m
) is strong.
(ii)
s
u
p
p
(
D
i
)
≠
∅
,
∀
i.
(iii)
For each pair of verticesx
,
y
∈
U, x
y is a D
i-edge for some i.Example 13.
Consider a graph structureG
∗
=
(
U
,
E
1
,
E
2
) such that U
=
{
b
1
,
b
2
,
b
3
,
b
4
}, E
1
=
{
b
1
b
2
,
b
1
b
4
,
b
3
b
4
}, and E
2
=
{
b
3
b
2
,
b
2
b
4
,
b
1
b
3
}
. Let C, D
1, and D
2 be 4-polar fuzzy sets on U
,
E
1, and E
2, respectively, defined by Tables 3 and 4.
By simple calculations, it is easy to check thatG
(
m
)
=
(
C
,
D
1
,
D
2
) is a strong and complete 4-polar fuzzy graph structure of G
∗, as shown in Figure 3. b
2
b
1
b
4
b
3 is a 4-polar fuzzy D
1-path consisting of all D
1-edges constituting s
u
p
p
(
D
1
)
=
{
b
2
b
1
,
b
1
b
4
,
b
4
b
3
}.Table 3
C
b
1
b
2
b
3
b
4
p
1
∘
C
0.3
0.2
0.1
0.4
p
2
∘
C
0.4
0.2
0.1
0.2
p
3
∘
C
0.3
0.0
0.2
0.3
p
4
∘
C
0.5
0.1
0.1
0.1Table 4
D
i
(
b
1
b
2
)
1
(
b
1
b
4
)
1
(
b
3
b
4
)
1
(
b
1
b
3
)
2
(
b
2
b
4
)
2
(
b
3
b
2
)
2
p
1
∘
D
i
0.2
0.3
0.1
0.1
0.2
0.1
p
2
∘
D
i
0.2
0.2
0.1
0.1
0.2
0.1
p
3
∘
D
i
0.0
0.3
0.2
0.2
0.0
0.0
p
4
∘
D
i
0.1
0.1
0.1
0.1
0.1
0.1Figure 3
A strong 4-polar fuzzy graph structure.Definition 14.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-PFGS and let j
∈
m. Thej-strength orj-gain of a
D
i
-path
p
=
b
1
b
2
⋯
b
l, denoted by G
·
P
i
,
j, is defined by(12)
G
·
P
D
i
,
j
=
⋀
k
=
2
l
p
j
∘
D
i
b
k
-
1
b
k
.Example 15.
Consider the4-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
), shown in Figure 3, in which P
=
b
2
b
1
b
4
b
3 is a 4-polar fuzzy D
1-path. Then j-gain, for j
=
1,2
,
3,4, of this path P is given by G
·
P
D
1,1
=
0.1, G
·
P
D
1,2
=
0.1, G
·
P
D
1,3
=
0.0, and G
·
P
D
1,4
=
0.1.Definition 16.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure and let j
∈
m. Then D
i
,
j
-strength of connectedness between two vertices x and y is defined by p
j
,
i
∞
(
x
y
)
=
⋁
k
≥
1
{
p
j
,
i
k
(
x
y
)
}, where for k
≥
2 and p
j
,
i
1
(
x
y
)
=
p
j
∘
D
i
(
x
y
)
(13)
p
j
,
i
k
x
y
=
p
j
,
i
k
-
1
∘
p
j
,
i
1
x
y
=
⋁
z
p
j
,
i
k
-
1
x
z
∧
p
j
,
i
1
z
y
, for k
≥
2 and p
j
,
i
1
(
x
y
)
=
p
j
∘
D
i
(
x
y
)
.Example 17.
Consider the4-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
) as shown in Figure 3. All the calculated D
i
,
j-strengths of connectedness between any two vertices of G
(
m
), for i
=
1
,
j
=
1, are given in Table 5.Table 5
Connectedness between vertices.
(
b
1
b
2
)
1
(
b
1
b
3
)
2
(
b
1
b
4
)
1
(
b
2
b
4
)
2
(
b
2
b
3
)
2
(
b
3
b
4
)
1
p
1,1
1
0.2
0.0
0.3
0.0
0.0
0.1
p
1,1
2
0.2
0.1
0.0
0.2
0.0
0.0
p
1,1
3
0.0
0.0
0.1
0.2
0.1
0.1
p
1,1
4
0.1
0.1
0.0
0.1
0.1
0.0
p
1,1
5
0.0
0.0
0.1
0.1
0.1
0.1
p
1,1
6
0.1
0.1
0.0
0.1
0.1
0.0
p
1,1
∞
0.2
0.1
0.3
0.2
0.1
0.1Definition 18.
Anm
-polar fuzzy
D
i
-cycle is an m-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) such that(i)
(s
u
p
p
(
C
)
,
s
u
p
p
(
D
1
)
,
s
u
p
p
(
D
2
)
,
…
,
s
u
p
p
(
D
n
)) is an E
i-cycle (it is called a D
i
-cycle),
(ii)
There is no uniqueD
i-edge u
v in G
(
m
) such that for any j
∈
m
(14)
p
j
∘
D
i
u
v
=
m
i
n
p
j
∘
D
i
x
y
:
x
y
∈
s
u
p
p
D
i
.Example 19.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
) be the 4-PFGS, shown in Figure 4; then G
(
m
) is a 4-polar fuzzy D
2-cycle.Figure 4
A 4-polar fuzzyD
2-cycle.Definition 20.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure and let x be a vertex in G
(
m
). Let (
C
′
,
D
1
′
,
D
2
′
,
…
,
D
n
′
) be an m-polar fuzzy subgraph structure of G
(
m
) induced by U
∖
{
x
}, such that for i
∈
n
,
j
∈
m
(15)
p
j
∘
C
′
x
=
0
,
p
j
∘
D
i
′
x
v
=
0
,
f
o
r
a
l
l
e
d
g
e
s
x
v
i
n
G
m
,
(16)
p
j
∘
C
′
v
=
p
j
∘
C
v
,
p
j
∘
D
i
′
u
v
=
p
j
∘
D
i
u
v
,
f
o
r
v
≠
x
,
u
≠
x
. Then x is called an m
-polar fuzzy
D
i
,
j
-cut vertex for some i, if for some u
,
v
∈
U
∖
{
x
}
(17)
p
j
,
i
∞
u
v
>
p
j
,
i
∞
′
u
vand x is called an m
-polar fuzzy
D
i
-cut vertex for some i, if it is D
i
,
j-cut vertex for all j
.Definition 21.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure and x
y an edge in G
(
m
)
. Let (
C
,
D
1
′
,
D
2
′
,
…
,
D
n
′
) be an m-polar fuzzy spanning subgraph structure of G
(
m
) such that(18)
p
j
∘
D
i
′
x
y
=
0
,
p
j
∘
D
i
′
u
v
=
p
j
∘
D
i
u
v
,
f
o
r
e
d
g
e
s
u
v
≠
x
y
,
i
∈
n
,
j
∈
m
.Then x
y is an m
-polar fuzzy
D
i
,
j
-bridge for some i, if for some u
,
v
∈
U
(19)
p
j
,
i
∞
u
v
>
p
j
,
i
∞
′
u
v
.And x
y is called an m
-polar fuzzy
D
i
-bridge for some i, if it is D
i
,
j-bridge for all j
.Example 22.
Consider the4-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
) as shown in Figure 3. The vertex b
1 is a 4-polar fuzzy D
1,1-cut vertex since p
1,1
∞
(
b
2
b
3
)
=
0.1
>
0.0
=
p
1,1
∞
′
(
b
2
b
3
) and p
1,1
∞
(
b
2
b
4
)
=
0.2
>
0.0
=
p
1,1
∞
′
(
b
2
b
4
), where (
W
,
D
1
′
,
D
2
′
) is the 4-polar fuzzy subgraph structure of G
(
m
) induced by W
=
C
∖
{
b
1
}.
The edgeb
1
b
4 is a 4-polar fuzzy D
1,1-bridge since p
1,1
∞
(
b
1
b
4
)
=
0.3
>
0.0
=
p
1,1
∞
′
(
b
1
b
4
), p
1,1
∞
(
b
1
b
3
)
=
0.1
>
0.0
=
p
1,1
∞
′
(
b
1
b
3
), p
1,1
∞
(
b
2
b
3
)
=
0.1
>
0.0
=
p
1,1
∞
′
(
b
2
b
3
), and p
1,1
∞
(
b
2
b
4
)
=
0.2
>
0.0
=
p
1,1
∞
′
(
b
2
b
4
), where (
C
,
D
1
′
,
D
2
′
) is the 4-polar fuzzy spanning subgraph structure of G
(
m
) that excludes the D
1-edge b
1
b
4.Definition 23.
Anm-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) is a D
i
-tree if (s
u
p
p
(
C
)
,
s
u
p
p
(
D
1
)
,
s
u
p
p
(
D
2
)
,
…
,
s
u
p
p
(
D
n
)) is an E
i-tree.Definition 24.
Anm-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) is an m
-polar fuzzy
D
i
-tree if there is an m-polar fuzzy spanning subgraph structure G
(
m
)
′
=
(
C
′
,
D
1
′
,
D
2
′
,
…
,
D
n
′
) such that G
(
m
)
′ is a D
i
′-tree and for every edge x
y not belonging to G
(
m
)
′
(20)
p
j
∘
D
i
x
y
<
p
j
,
i
∞
′
x
y
∀
j
. If the above condition holds for j
∈
m, G
(
m
) is called a D
i
,
j-tree.Example 25.
Consider the4-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
) as shown in Figure 5.
ThenG
(
m
) is a 4-polar fuzzy D
1,1-tree since p
1
∘
D
1
(
b
2
b
5
)
=
0.2
<
0.3
=
p
1,1
∞
′
(
b
2
b
5
), where (
C
,
D
1
′
,
D
2
′
) is the 4-polar fuzzy spanning subgraph structure of G
(
m
) that excludes the D
1-edge b
2
b
5. Also G
(
m
) is a D
2-tree.Figure 5
A 4-polar fuzzyD
1,1-tree.Definition 26.
Anm-PFGS G
(
m
)
1
=
(
C
1
,
D
11
,
D
12
,
…
,
D
1
n
) of a graph structure G
∗
1
=
(
U
1
,
E
11
,
E
12
,
…
,
E
1
n
) is said to beisomorphic to an m-PFGS G
(
m
)
2
=
(
C
2
,
D
21
,
D
22
,
…
,
D
2
n
) of a graph structure G
∗
2
=
(
U
2
,
E
21
,
E
22
,
…
,
E
2
n
), if there exists a bijection h
:
U
1
→
U
2 and a permutation ϕ on the set {
1,2
,
…
,
n
} such that for k
∈
m
,
i
∈
n
(21)
p
k
∘
C
1
u
1
=
p
k
∘
C
2
h
u
1
,
∀
u
1
∈
U
1
,
p
k
∘
D
1
i
u
1
u
2
=
p
k
∘
D
2
ϕ
i
h
u
1
h
u
2
,
∀
u
1
u
2
∈
E
1
i
.Example 27.
Two isomorphic 4-PFGSsG
(
m
1
)
=
(
C
1
,
D
11
,
D
12
) and G
(
m
2
)
=
(
C
2
,
D
21
,
D
22
) are shown in Figure 6. This isomorphism holds under the permutation ϕ
=
(
12
) and the mapping h
:
U
1
→
U
2, defined by h
(
a
1
)
=
b
3
,
h
(
a
2
)
=
b
4
,
h
(
a
3
)
=
b
1, and h
(
a
4
)
=
b
2
.Figure 6
Two isomorphic 4-polar fuzzy graph structures.Definition 28.
Anm-PFGS G
(
m
)
1
=
(
C
1
,
D
11
,
D
12
,
…
,
D
1
n
) is said to beidentical to an m-PFGS G
(
m
)
2
=
(
C
2
,
D
21
,
D
22
,
…
,
D
2
n
) if there exists a bijection h
:
U
→
U, such that for j
∈
m
,
i
∈
n
(22)
p
j
∘
C
1
u
=
p
j
∘
C
2
h
u
,
∀
u
∈
U
,
p
j
∘
D
1
i
u
1
u
2
=
p
j
∘
D
2
i
h
u
1
h
u
2
,
∀
u
1
u
2
∈
E
1
i
.Example 29.
Two 4-PFGSsG
(
m
1
)
=
(
C
1
,
D
11
,
D
12
) and G
(
m
2
)
=
(
C
2
,
D
21
,
D
22
), identical under the mapping h
:
U
1
→
U
2, defined by h
(
a
1
)
=
b
3
,
h
(
a
2
)
=
b
4
,
h
(
a
3
)
=
b
1, and h
(
a
4
)
=
b
2, are shown in Figure 7.Figure 7
Identical 4-polar fuzzy graph structures.Definition 30.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure. Let ϕ be any permutation on the set {
1,2
,
…
,
n
} and ϕ
(
D
i
)
=
D
j
⇔
ϕ
(
i
)
=
j
. If x
y
∈
D
r for some r
∈
n and (23)
p
j
∘
D
i
ϕ
x
y
=
i
n
f
p
j
∘
C
x
,
p
j
∘
C
y
-
⋁
k
≠
i
p
j
∘
D
ϕ
k
x
y for j
∈
m
,
i
∈
n then x
y
∈
D
s
ϕ, where s is chosen such that, for each j, (24)
p
j
∘
D
s
ϕ
x
y
=
m
a
x
p
j
∘
D
i
ϕ
x
y
:
i
∈
n
.Then an m-PFGS constructed with C and n
m-polar fuzzy relations (D
s
ϕ
,
s
=
1,2
,
…
,
n) on C, denoted by G
(
m
)
ϕ
c
=
(
C
,
D
1
ϕ
,
D
2
ϕ
,
…
,
D
n
ϕ
), is called the ϕ
-complement of m-polar fuzzy graph structure G
(
m
).Proposition 31.
Aϕ-complement of an m-polar fuzzy graph structure is always a strong m-PFGS. Moreover, if ϕ
-
1
(
r
)
=
i for r
,
i
∈
n, then all D
r-edges in m-PFGS G
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) become D
i
ϕ-edges in G
(
m
)
ϕ
c
=
(
C
,
D
1
ϕ
,
D
2
ϕ
,
…
,
D
n
ϕ
)
.Proof.
From the definition ofϕ-complement G
(
m
)
ϕ
c of an m-PFGS G
(
m
), (25)
p
j
∘
D
i
ϕ
x
y
=
i
n
f
p
j
∘
C
x
,
p
j
∘
C
y
-
⋁
k
≠
i
p
j
∘
D
ϕ
k
x
y
,
j
∈
m
,
i
∈
n
.We can see that i
n
f
(
p
j
∘
C
(
x
)
,
p
j
∘
C
(
y
)
)
≥
0
,
⋁
k
≠
i
p
j
∘
D
ϕ
(
k
)
(
x
y
)
≥
0, and p
j
∘
D
k
(
x
y
)
≤
i
n
f
(
p
j
∘
C
(
x
)
,
p
j
∘
C
(
y
)
)
,
∀
D
k
. So(26)
⋁
k
≠
i
p
j
∘
D
ϕ
k
x
y
≤
i
n
f
p
j
∘
C
x
,
p
j
∘
C
y
⟹
p
j
∘
D
i
ϕ
x
y
=
i
n
f
p
j
∘
C
x
,
p
j
∘
C
y
-
⋁
k
≠
i
p
j
∘
D
ϕ
k
x
y
≥
0
∀
i
,
j
.Moreover, the maximum value of p
j
∘
D
i
ϕ
(
x
y
) occurs when its negative part (-
⋁
k
≠
i
p
j
∘
D
ϕ
(
k
)
(
x
y
)) becomes zero, and it is zero when ϕ
(
i
)
=
r and x
y is a D
r-edge in G
(
m
). Therefore, p
j
∘
D
i
ϕ
(
x
y
)
=
i
n
f
(
p
j
∘
C
(
x
)
,
p
j
∘
C
(
y
)
) for x
y
∈
D
r
,
ϕ
(
i
)
=
r
.
HenceG
(
m
)
ϕ
c
=
(
C
,
D
1
ϕ
,
D
2
ϕ
,
…
,
D
n
ϕ
) is a strong m-PFGS and every D
r-edge in G
(
m
) becomes D
i
ϕ-edge for ϕ
-
1
(
r
)
=
i
.Remark 32.
IfG
(
m
) is an m-polar fuzzy graph structure of a GS G
∗ then ϕ-complement of G
(
m
) is a strong m-polar fuzzy graph structure of ϕ
-
1-complement of G
∗.Definition 33.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure and ϕ be any permutation on the set {
1,2
,
…
,
n
}. Then(i)
G
(
m
) is calledself-complementary if G
(
m
) is isomorphic to G
(
m
)
ϕ
c,
(ii)
G
(
m
) is calledstrong self-complementary if G
(
m
) is identical to G
(
m
)
ϕ
c.Definition 34.
LetG
(
m
)
=
(
C
,
D
1
,
D
2
,
…
,
D
n
) be an m-polar fuzzy graph structure. Then(i)
G
(
m
) is calledtotally self-complementary if G
(
m
) is isomorphic to G
(
m
)
ϕ
c for every permutation ϕ on the set 1,2
,
…
,
n,
(ii)
G
(
m
) is calledtotally strong self-complementary if G
(
m
) is identical to G
(
m
)
ϕ
c for every permutation ϕ on the set {
1,2
,
…
,
n
}
.Theorem 35.
Anm-PFGS G
(
m
) is strong if and only if it is totally self-complementary.Proof.
We suppose thatG
(
m
) is a strong m-PFGS of a GS G
∗
=
(
U
,
E
1
,
E
2
,
…
,
E
n
) and ϕ is any permutation on the set {
1,2
,
…
,
n
}
.
By Proposition31, G
(
m
)
ϕ
c is strong and all D
i-edges in G
(
m
) become D
j
ϕ-edges for ϕ
-
1
(
i
)
=
j
. So (27)
p
k
∘
D
i
a
1
a
2
=
i
n
f
p
k
∘
C
a
1
,
p
k
∘
C
a
2
=
p
k
∘
D
j
ϕ
a
1
a
2
,
∀
k
. Using the identity mapping h
:
U
→
U, we get p
k
∘
C
(
a
)
=
p
k
∘
C
(
h
(
a
)
)
,
∀
k
∈
m
,
a
∈
U, and (28)
p
k
∘
D
i
a
1
a
2
=
i
n
f
p
k
∘
C
a
1
,
p
k
∘
C
a
2
=
i
n
f
p
k
∘
C
h
a
1
,
p
k
∘
C
h
a
2
=
p
k
∘
D
j
ϕ
h
a
1
h
a
2
,
∀
k
.That is,(29)
p
k
∘
D
i
a
1
a
2
=
p
k
∘
D
j
ϕ
h
a
1
h
a
2
,
∀
k
.Hence G
(
m
) is isomorphic to G
(
m
)
ϕ
c under the identity mapping h
:
U
→
U and a permutation ϕ. Since ϕ was an arbitrary permutation on {
1,2
,
…
,
n
}, G
(
m
) is totally self-complementary.
Conversely suppose thatG
(
m
) is a totally self-complementary m-PFGS and we have to prove that G
(
m
) is strong m-PFGS.
SinceG
(
m
) and G
(
m
)
ϕ
c are isomorphic for all permutations on {
1,2
,
…
,
n
}, therefore by definition of isomorphism p
k
∘
D
i
(
a
1
a
2
)
=
p
k
∘
D
j
ϕ
(
h
(
a
1
)
h
(
a
2
)
)
=
i
n
f
(
p
k
∘
C
(
h
(
a
1
)
)
,
p
k
∘
C
(
h
(
a
2
)
)
)
=
i
n
f
(
p
k
∘
C
(
a
1
)
,
p
k
∘
C
(
a
2
)
), for all a
1
a
2
∈
E
i
,
i
∈
n
,
k
∈
m
. Hence G
(
m
) is a strong m-PFGS.
This completes the proof.Theorem 36.
LetG
(
m
) be a strong m-PFGS on a GS G
∗
=
(
U
1
,
E
11
,
E
12
,
…
,
E
1
n
). If G
∗ is totally strong self-complementary and C is an m-polar fuzzy set on U such that for each j
∈
m
,
p
j
∘
C assigns a constant value c
j
∈
[
0,1
] to every u
∈
U, then G
(
m
) is totally strong self-complementary.Proof.
We assume thatG
∗ is totally strong self-complementary and p
j
∘
C
(
u
)
=
c
j for all u
∈
U, where c
j
∈
[
0,1
] is a constant for each j
∈
m
.
SinceG
∗ is totally strong self-complementary, for any permutation ϕ
-
1 with ϕ
-
1
(
k
)
=
i, there exists a bijection h
:
U
→
U, such that, for every E
i-edge a
1
a
2 in G
∗, h
(
a
1
)
h
(
a
2
) (an E
k-edge in G
∗) is an E
i-edge in (
G
∗
)
ϕ
-
1
c. Consequently, for every D
i-edge a
1
a
2 in G
(
m
),  h
(
a
1
)
h
(
a
2
) (a D
k-edge in G
(
m
)) is a D
i
ϕ-edge in G
(
m
)
ϕ
c. Moreover, (30)
p
j
∘
C
h
a
=
c
j
=
p
j
∘
C
a
,
∀
a
,
h
a
∈
U
,
j
∈
m and G
(
m
) is a strong m-PFGS, so we get (31)
p
j
∘
D
i
a
1
a
2
=
i
n
f
p
j
∘
C
a
1
,
p
j
∘
C
a
2
=
i
n
f
p
j
∘
C
h
a
1
,
p
j
∘
C
h
a
2
=
p
j
∘
D
i
ϕ
h
a
1
h
a
2
,
∀
a
1
a
2
∈
E
i
,
i
∈
n
,
j
∈
m
.This shows that G
(
m
) is identical to G
(
m
)
ϕ
c. Hence G
(
m
) is totally strong self-complementary, since ϕ was an arbitrary permutation. This completes the proof.Converse of Theorem36 does not hold because every strong and totally strong self-complementary m-PFGS does not necessarily include an m-polar fuzzy vertex set C such that for each j
∈
m
,
p
j
∘
C assigns a constant value c
j
∈
[
0,1
] to every u
∈
U
. This can be observed in m-PFGS shown in Figure 9.Example 37.
There are no other totally self-complementarym-PFGSs than strong m-polar fuzzy graph structures. So all strong m-PFGSs are the examples of totally self-complementary m-PFGSs.Example 38.
Anm-PFGS, shown in Figure 8, is strong self-complementary but not totally strong self-complementary because this m-PFGS is identical to its ϕ-complement only when ϕ
=
(
12
)
(
34
).
Anm-PFGS, shown in Figure 9, is totally strong self-complementary.Figure 8
A strong self-complementary 4-PFGS.Figure 9
A totally strong self-complementary 4-PFGS.


## 4. Conclusions

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. It helps to study various relations and the corresponding edges simultaneously. Sometimes information in a network model is based on multiagent, multiattribute, multiobject, multipolar information or uncertainty rather than a single bit. Anm
-polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy, and bipolar fuzzy models. We have introduced certain concepts in m-polar fuzzy graph structures. We are extending our work to (1) neutrosophic graph structures, (2) intuitionistic neutrosophic soft graph structures, (3) roughness in graph structures, and (4) intuitionistic fuzzy soft graph structures.



---

*Source: 6301693-2016-09-22.xml*