mathematics

Article
Fuzzy Graph Structures with Application
Muzzamal Sitara 1 , Muhammad Akram 1, * and Muhammad Yousaf Bhatti 2
1 Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan;
muzzamalsitara@[Link]
2 Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan;
mybhatti@[Link]
* Correspondence: [Link]@[Link]

Received: 23 November 2018; Accepted: 3 January 2019; Published: 8 January 2019

Abstract: In this article, we introduce the notions of maximal products of fuzzy graph structures,
regular fuzzy graph structures, and describe these notions with examples and properties. Further,
we present the degree and total degree of a vertex in maximal product of fuzzy graph structures
and explain some of their properties. Furthermore, we develop a flowchart to show general
procedure of application of fuzzy graph structure, regarding identification of most controversial
issues among countries.

Keywords: graph structure; maximal product; degree of vertex; total degree of vertex;
controversial issues

1. Introduction
A fuzzy set, as a superset of a crisp set, owes its origin to the work of Zadeh [1] in 1965 that
has been introduced to deal with the notion of partial truth between absolute true and absolute false.
Zadeh’s remarkable idea has found many applications in several fields, including chemical industry,
telecommunication, decision making, networking, computer science, and discrete mathematics.
Rosenfeld [2] used the concept of a fuzzy subset of a set to introduce the notion of a fuzzy subgroup of
a group. Rosenfeld’s paper spearheaded the development of fuzzy abstract algebra.
A graph is a mathematical representation of a network and it describes the relationship between
vertices and edges. Graph theory is used to represent real-life phenomena, but sometimes graphs
are not able to properly represent many phenomena because uncertainty of different attributes of the
systems exists naturally. Many real-world phenomena provided motivation to define the fuzzy graphs.
Kauffman [3] introduced fuzzy graphs using Zadeh’s fuzzy relation [4]. Fuzzy-graph theory is growing
rapidly, with numerous applications in many domains, including networking, communication, data
mining, clustering, image capturing, image segmentation, planning, and scheduling.
Rosenfeld [5] described fuzzy analogue of some graph theoretical notions. Later on,
Bhattacharya [6] provided remarks on fuzzy graphs. Sunitha and Vijayakumar [7,8] defined the
complement of fuzzy graph and some characterization of fuzzy trees. Mordeson and Nair [9] defined
some fuzzy graphs. Bhutani and Battou [10] introduced the concept of M-strong fuzzy graphs with
some properties. Mathew and Sunitha defined types of arcs in a fuzzy graph [11]. Mordeson and
Chang-Shyh [12] defined operations on fuzzy graphs. Nagoor Gani and Radha [13–16] described some
properties of conjunction of fuzzy graphs, regular fuzzy graphs, some sequences in fuzzy graphs, and
the degree of vertex in some fuzzy graphs. Akram et al. [17–20] defined certain notions of soft graphs,
bipolar fuzzy graphs, and hypergraphs.
Sampathkumar [21] introduced the notion of graph structures. Graph structures are the
generalization of graphs and widely useful in the study of some structures, like graphs, signed graphs,
semigraphs, edge-colored graphs, and edge-labeled graphs. Graph structures are very useful in the

Mathematics 2019, 7, 63; doi:10.3390/math7010063 [Link]/journal/mathematics

 Mathematics 2019, 7, 63 2 of 22

study of different domains of computer science and computational intelligence. Dinesh [22] introduced
the concept of fuzzy-graph structures and described some related concepts. Fuzzy-graph structures
are more useful than graph structures because they deal with the uncertainty and ambiguity of many
real-world phenomena. Ramakrishnan and Dinesh [23–25] worked on generalized fuzzy-graph
structures. Harinath and Lavanya discussed fuzzy graph structures for wheel, helm, and star
graphs [26].
In this article, we present a new framework to handle fuzzy information by combining
fuzzy sets with graph structures. We introduce many basic notions concerning fuzzy-graph
structures and investigate a few related properties. We also consider an application of fuzzy-graph
structures. In particular, a flowchart is developed to show general procedure of application,
regarding identification of most controversial issues among countries.

2. Maximal Product of Fuzzy Graph Structures

Definition 1. [21] A graph structure(GS) G = (V, R1 , . . . , Rn ) consists of a nonempty set V with relations
R1 , R2 , . . . , Rn on set V which are mutually disjoint such that each relation Ri , 1 ≤ i ≤ n is symmetric
and irreflexive.

Graph structure G ∗ = (V, R1 , . . . , Rn ) can be represented just like a graph where each edge is
labeled as Ri , 1 ≤ i ≤ n.

Example 1. Consider a set V = {v1 , v2 , v3 , v4 }, define two relations on set V, i.e., R1 = {v1 v3 , v1 v2 , v3 v4 }
and R2 = {v1 v4 , v2 v3 , v2 v4 } such that these relations are disjoint. Moreover, they do not have elements of
same vertices, like v1 v1 , v2 v2 , v3 v3 , v4 v4 ; hence, these two relations R1 and R2 are irreflexive. Furthermore,
these relations are symmetric, since graph structure is nondirected, so each element vi v j is also considered as
v j vi . Relations R1 and R2 are disjoint, irreflexive and symmetric. Hence, vertex set V with relations R1 and R2
is a graph structure G ∗ = (V, R1 , R2 ) and is shown in Figure 1.
In this graph structure, each edge is labeled as R1 or R2 .

R1

v3
v1 b
b

R
2 R1

b
v4
R1

2
R

R
2

b
v2

Figure 1. Graph Structure G ∗ = (V, R1 , R2 ).

Figure 1: Graph Structure G∗ = (V, R1 , R2 )
Definition 2. [22] Let σ be the fuzzy set on set V and µ1 , µ2 , . . . , µn be fuzzy sets on R1 , R2 , . . . , Rn ,
64 Inrespectively.
this graphIfstructure
0 ≤ µi (vu each
) ≤ edge
σ (v) is
∧ σlabeled
(u) ∀u,as
v ∈ R1V,ori R
=2 .1, 2, . . . , n, then G = (σ, µ1 , µ2 , . . . , µn ) is
called fuzzy graph structure(FGS) of graph structure G ∗ .
65 Definition 2.3. [22] Let σ be the fuzzy set on set V and µ1 , µ2 , . . . , µn be fuzzy sets on
If vu ∈ supp(µi ), then vu is named as µi -edge of FGS G.
66 R1 , R2 , . . . , Rn , respectively. If 0 ≤ µi (vu) ≤ σ(v) ∧ σ(u) ∀u, v ∈ V , i = 1, 2, . . . , n, then G
67 = (σ, µ1 , µ2 , . . . , µn ) is called fuzzy graph structure(FGS) of graph structure G∗ .
Example 2. Consider a graph structure G ∗ = (V, R1 , R2 ) as shown in Figure 1. We define fuzzy set
68 If vu ∈ supp(µi ), then vu is named as µi -edge of FGS G.
σ : V → [0, 1] by
69 Example 2.4. Considerσ(av1graph ) = 0.3,structure G∗σ=
σ (v2 ) = 0.3, (v3(V,
) =R0.4,
1, Rσ (2v)4 )as=shown
0.4. in Fig. 1. We define
70 fuzzy set σ : V → [0, 1] by
σ(v1 ) = 0.3, σ(v2 ) = 0.3, σ(v3 ) = 0.4, σ(v4 ) = 0.4.
71 We fuzzy sets µ1 , µ2 on relations R1 , R2 , respectively, as follow:
µ1 (v1 v3 ) = 0.3, µ1 (v1 v2 ) = 0.3, µ1 (v3 v4 ) = 0.4,
 64 In this graph structure each edge is labeled as R1 or R2 .
65 Definition 2.3. [22] Let σ be the fuzzy set on set V and µ1 , µ2 , . . . , µn be fuzzy sets on
66 R1 , R2 , . . . , Rn , respectively. If 0 ≤ µi (vu) ≤ σ(v) ∧ σ(u) ∀u, v ∈ V , i = 1, 2, . . . , n, then G
67 = (σ, µ1 , µ2 , . . . , µn ) is called fuzzy graph structure(FGS) of graph structure G∗ .
68 If vu ∈ supp(µi ), then vu is named as µi -edge of FGS G.
Mathematics 2019, 7, 63 3 of 22
69 Example 2.4. Consider a graph structure G∗ = (V, R1 , R2 ) as shown in Fig. 1. We define
70 fuzzy set σ : V → [0, 1] by
We define fuzzy sets µ1 , µ2 on relations R1 , R2 , respectively, as follows:
σ(v1 ) = 0.3, σ(v2 ) = 0.3, σ(v3 ) = 0.4, σ(v4 ) = 0.4.
71 We fuzzy sets µ1 , µ2 onµ1relations
(v1 v3 ) =R0.3,
1 , Rµ
21, (respectively,
v1 v2 ) = 0.3,as
µ1follow:
(v3 v4 ) = 0.4,
µ1 (v1 v3 ) = 0.3, µ1 (v1 v2 ) = 0.3, µ1 (v3 v4 ) = 0.4,
72 µ2 (v1 v4 ) = 0.3, µ2 (v2 v3 ) = 0.3, µ2 (v2 v4 ) = 0.3.
µ2 (v1 v4 ) = 0.3, µ2 (v2 v3 ) = 0.3, µ2 (v2 v4 ) = 0.3.
73
By routine calculations,
By routine it is iteasy
calculations, to see
is easy to that G =G (=
see that µ1 ,µµ2, )µ is) is
σ,(σ, a fuzzy-graph
a fuzzy graphstructure
structureasasshown
1 2
in Figure
74
2. in Fig. 2.
shown

µ1 (0.3)

b v3 (0.4)
v1 (0.3) b

µ
2( .4)
0.
3) (0
µ1

.3)
µ 1(

(0
v4 (0.4)
0.3)

µ2
µ2
(0.
3)

v2 (0.3)

Figure 2. Fuzzy graph structure G = (σ, µ1 , µ2 ).

Figure 2: Fuzzy graph structure G = (σ, µ1 , µ2 )
Definition 3. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures
with underlying crisp graph structures G1∗ = (V1 , R10 , R230 , . . . , R0n ) and G2∗ = (V2 , R100 , R200 , . . . , R00n ), respectively.
G1 ∗ G = (σ, µ1 , 2.5.
75 2 Definition
. µnG)1 is
µ2 , . .Let called
= (σ ′ maximal
′ ′ fuzzy graph structure ′′ ′′ with′′ underlying crisp graph
1 , µ1 , µ2 , . . . , µn ) and G2 = (σ2 , µ1 , µ2 , . . . , µn ) be two fuzzy graph
∗
G = (V, with V1 × V2 Gand {( )/u1 = u2 , v1 v2 ∈ Ri00
2 , . . . , Rn ),crisp V = Ri = u12, ,v.1.)(
structure structures R1 , Runderlying where,graph structures ∗ ′ ′ . ,uR2n′, )v2and
76
1 = (V 1, R 1, R
∗ ′′ 0
u22 ,∈R1R,iR
or v177 =Gv22 ,=u1(V ′′
}.2 , . Fuzzy ′′
. . , Rn ), respectively.
vertex set G σ1 ∗and
G2 =fuzzy
(σ, µ1 , µ 2 , . . . µn ) is
relations µi calledin maximal
maximal fuzzyproduct
graph structure with underlying crisp graph structure G ∗ = (V, R , R , . . . , R ), where,
G1 ∗ G2 = (σ, µ1 , µ2 , . . . µn ) are defined as: σ = σ1 ∗ σ2 ,
78 1 2 n
79 V = V1 × V2 and Ri = {(u1 , v1 )(u2 , v2 )/u1 = u2 , v1 v2 ∈ Ri′′ or v1 = v2 , u1 u2 ∈ Ri′ }.
80 Fuzzy vertex set σσ (and
u, v)fuzzy
= σ1relations
(u) ∨ σ2 (µvi)in maximal
, for all (u, vproduct
) ∈ V =GV 1 1∗×
G2V2=, (σ, µ1 , µ2 , . . . µn ) are
81 defined as: σ = σ1 ∗ σ2 ,
and µi = µi0 ∗ µi00 ,
82 σ(u, v) = σ1 (u) ∨ σ2 (v), for all (u, v) ∈ V = V1 × V2 ,
(
µ′i((
and µi = µ ∗ µ′′ , σ1 (u1 ) ∨ µi00 (v1 v2 ), u1 = u2 , v1 v2 ∈ Ri00 ,
i u1i , v1 )( u2 , v2 )) =
83

2 (v1 ) ∨ µi0 (u′′ 1 u2 ), v1 = v2 , u1 u2 ∈ R′′i0 ,

σ
σ1 (u1 ) ∨ µi (v1 v2 ), u1 = u2 , v1 v2 ∈ Ri ,
84 µi ((u1 , v1 )(u2 , v2 )) =
i = 1, 2, . . . , n. σ2 (v1 ) ∨ µ′i (u1 u2 ), v1 = v2 , u1 u2 ∈ Ri′ ,
85 i = 1, 2, . . . , n.
Example 3. Consider two fuzzy-graph structures G1 = (σ1 , µ10 , µ20 , µ30 ) and G2 = (σ2 , µ100 ), which are shown
86 Example 2.6. Consider two fuzzy graph structures G1 = (σ1 , µ′1 , µ′2 , µ′3 ) and G2 = (σ2 , µ′′1 ),
in Figure 3.
87 which are shown in Fig. 3.
u1 (0.5) v1 (0.4)
b
b
µ3
.4)

′ (0

µ′′1 (0.4)
1 (0

.3)
µ′

b b b

u2 (0.6) µ′2 (0.5) u3 (0.7) v2 (0.5)

G1 = (σ1 , µ′1 , µ′2 , µ′3 ) G2 = (σ2 , µ′′1 )

Figure 3: Two Fuzzy Graph Structures G1 and G2
Figure 3. Two fuzzy-graph structures G1 and G2 .
88 Maximal product of G and G is shown in Fig.4
Maximal product of G1 and G21 is shown
2
in Figure 4.
(u1 , v1 )(0.5) µ1 (0.5) (u1 , v2 )(0.5)
b b
µ
1(
µ3 (0.5)

0.
5)
(u2 , v2 )(0.6)
µ1
(0
.4)

µ1 (0.6)
µ3 (0.4)

b b

(u2 , v1 )(0.6)
.5)
(0

)
 b b b

u2 (0.6) µ′2 (0.5) u3 (0.7) v2 (0.5)

G1 = (σ1 , µ′1 , µ′2 , µ′3 ) G2 = (σ2 , µ′′1 )

Figure 3: Two Fuzzy Graph Structures G1 and G2
Mathematics 2019, 7, 63 4 of 22
88 Maximal product of G1 and G2 is shown in Fig.4

(u1 , v1 )(0.5) µ1 (0.5) (u1 , v2 )(0.5)

b b
µ
1(

µ3 (0.5)
0.
5)

(u2 , v2 )(0.6)
µ1
(0
.4)
µ1 (0.6)

µ3 (0.4)
b b

(u2 , v1 )(0.6)

)
0.5

5)
2(

0.
µ

2(
µ
b b

(u3 , v1 )(0.7) µ1 (0.7) (u3 , v2 )(0.7)

G1 ∗ G4:2 =G(σ,
Figure [Link] µ , µ2 , µ3 ) (maximal product).
1 ∗ G12 = (σ, µ1 , µ2 , µ3 )
(Maximal Product)
Definition 4. A fuzzy-graph structure G = (σ, µ1 , µ2 , . . . µn ) is µi -strong if
91 If G is µi -strong ∀ i ∈ {1, 2, . . . , n}, then G is called strong fuzzy graph structure.
89 Definition 2.7. µAi (v
fuzzy
1 v2 ) graph 1 ) ∧ σ ( v2G),=
= σ(vstructure for(σ,allµ1v, 1µv22, .∈ Rni ,) iis∈µ{i -strong
..µ 1, 2, . . .if, n}.
92 Theorem 2.8. Maximal
90 If G is µ -strong ∀ iµi∈
(v{1v1,Product . , n1 )of
2 )2,=. .σ(v
two
σ(v2strong
}∧, then ),
G for allfuzzy
is called graphi structures
2 ∈ Ri ,fuzzy-graph
v1 vstrong , is
n}.also a strong fuzzy graph
∈ {1, 2, . . . structure.
i
93 structure.
Theorem 1. Maximal product of two strong fuzzy-graph4 structures is also a strong fuzzy-graph structure.
94 Proof. Let G1 = (σ1 , µ′1 , µ′2 , . . . , µ′n ) and G2 = (σ2 , µ′′1 , µ′′2 , . . . , µ′′n ) be two strong fuzzy graph
95 structures. Then µ′ (v1 v2 ) = σ1 (v1 ) ∧ σ1 (v2 ) for any v1 v2 ∈ R′ and µ′′i (u1 u2 ) = σ2 (u1 ) ∧ σ2 (u2 )
Proof. Let G1 = (σ1 , µ′′i10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) bei two strong fuzzy-graph structures.
96 for any u1 u2 ∈ R , i = 1, 2, . . . , n. Then proceeding according to the definition of maximal
Then, µi0 (v1 v2 ) = σ1 (vi1 ) ∧ σ1 (v2 ) for any v1 v2 ∈ Ri0 and µi00 (u1 u2 ) = σ2 (u1 ) ∧ σ2 (u2 ) for any u1 u2 ∈ Ri00 ,
97 product,
i = 1, 2, . . . , n. Then, proceeding according to the definition of maximal product,
98 Case
Case (i): (i):
u =u1u=and u2 and
v v v∈1 vR Ri′′ . Then,
2 00∈. Then,
1 2 1 2 i
µ ((u , v )(u , v )) = σ (u ) ∨ µ′′ (v v ) = σ (u ) ∨ [σ (v ) ∧ σ (v2 )]
µii((u11, v11)(u22, v22)) = σ11(u11) ∨ µi00i(v11v22) = σ11(u11) ∨ [σ22(v11) ∧ σ2 (2v2 )]
= [σ1 (u1 ) ∨ σ2 (v1 )] ∧ [σ1 (u1 ) ∧ σ2 (v2 )]
= [σ1 (u1 ) ∨ σ2 (v1 )] ∧ [σ1 (u1 ) ∨ σ2 (v2 )]
= [σ(u1 , v1 ) ∧ σ(u2 , v2 )].
= [σ(u1 , v1 ) ∧ σ(u2 , v2 )].
99 Case(ii):(ii):
v1 =v1v2=and
v2 and
u1 u2u∈ 2 0∈
1 uR Ri′ . Then
Case i . Then,
′
µµii((
((uu11,,vv11)(
)(uu22,,vv22))
)) =
= σσ2((v 1 ) ∨ µ0i (u1 u2 ) = σ2 (v1 ) ∨ [σ1 (u1 ) ∧ σ1 (u2 )]
2 v1 ) ∨ µi ( u1 u2 ) = σ2 ( v1 ) ∨ [ σ1 ( u1 ) ∧ σ1 ( u2 )]
= [σ (u ) ∨ σ (v )] ∧ [σ (u ) ∧ σ (v )]
= [σ11(u11) ∨ σ22(v11)] ∧ [σ11(u22) ∨ σ2 2(v11)]
= [σ(u , v ) ∧ σ(u , v )].
= [σ(u11, v11) ∧ σ(u22, v22)].
100 Thus µi ((u1 , v1 )(u2 , v2 )) = σ(u1 , v1 ) ∧ σ(u2 , v2 ) for all edges of maximal product.
Thus, µi ((u1 , v1 )(u2 , v2 )) = σ (u1 , v1 ) ∧ σ(u2 , v2 ) for all edges of maximal product.
101 Hence G = G1 ∗ G2 = (σ, µ1 , µ2 , . . . µn ) is a strong fuzzy graph structure.
Hence G = G1 ∗ G2 = (σ, µ1 , µ2 , . . . µn ) is a strong fuzzy graph structure.
102

103 Remark
Remark 2.9. Converse
1. Converse of above
of Theorem 1 abovetheorem 2.8true.
may not be mayThat
notis,be true. product
maximal That is,
G maximal
= G1 ∗ G2 product
may be a
104 G = G1 ∗ G2 may be strong fuzzy graph structure, when G1 and G2 are not strong fuzzy graph
strong fuzzy-graph structure, when G1 and G2 are not strong fuzzy-graph structures.
105 structures.
0 ) and G = (′σ , µ00 ), which are not′′ strong as
106
Example
Example 4. Consider two fuzzy-graph
2.10. Consider structures
two fuzzy 1 = ( σ1 , µ1G
graph Gstructures 1 = (σ
2 1 , µ )2 and
1 G2 = (σ2 , µ1 ) which
1
107 shown in Figure
are not [Link] shown in Fig.5.
u1 (0.6) v1 (0.5)
b b

µ′1 (0.4) µ′′1 (0.3)

b b

u2 (0.5) v2 (0.7)

G1 = (σ1 , µ′1 ) G2 = (σ2 , µ′′1 )

Figure 5. Not strong fuzzy-graph structures.

Figure 5: Not Strong Fuzzy Graph Structures

108 Maximal product G1 ∗ G2 = (σ, µ1 ) of G1 and G2 is shown in Fig. 6.

Mathematics 2019, 7, 63 5 of 22

Maximal product G1 ∗ G2 = (σ, µ1 ) of G1 and G2 is shown in Figure 6.

(u1 , v1) (0.6) (u1 , v2) (0.7)

b b

µ1 (0.6)

µ1 (0.5) µ1 (0.7)

µ1 (0.5) b
b

(u2 , v1) (0.5) (u2 , v2) (0.7)

G = G1 ∗ G2 = (σ, µ1 )

Figure 6. Strong fuzzy-graph structure.

Figure 6: Strong Fuzzy Graph Structure
In Figure 6, we can see that,
109 In Fig. 6, we can see that,
1 (( uµ1 ,((u
µ110 v1 )(, uv1 ,)(u
v2 )), v=))σ=
1 (u v1 ), v∧ )σ∧
σ11,(u 2 (σ , v2 ), µ1 ((
u1(u 1 , v1, )(
µ1u((u u2 , v1 )) = σ1 (u1 , v1 ) ∧ σ2 (u2 , v1 ),
1 1 1 1 2 1 1 2 1 , v2 ), 1 v1 )(u2 , v1 )) = σ1 (u1 , v1 ) ∧ σ2 (u2 , v1 ),
µ111(( u
1 µ21 ((u, v )( u , v )) = σ ( u , v ) ∧
1 σ21 (u12 , v1 ) ∧
1 2 , v21 )(u22 , v2 )) = σ ( u , v ) , µ (( u
2 σ22(u22, v2 ), 1 µ1 ((u , v )( u
1 12, v2 )(u 2 , 2v,2v)) = σ (u1 ,1v, v2 )2 )∧∧σσ2 2((u
2 )) = 1σ1 (u
u22, ,vv22))..
112 Hence G G11 ∗∗ G G22 = (σ,
(σ, µµ11)) is
is a strong
strong fuzzy-graph
fuzzy graphstructure.
structure.
113 Theorem 2.11. The maximal product of two connected fuzzy graph structures is a connected
Theorem 2. The maximal product of two connected fuzzy-graph structures is a connected fuzzy graph structure.
114 fuzzy graph structure.

Proof.
115 [Link] Let G1 =G1(σ=1 , µ
′ ) and G = (σ 00, µ′′00, µ′′ , . . . 00
(σ0 1, ,µµ0 ′1, ,. µ. ′2. ,, .µ.0n.), µand
n G2 =2 (σ2 , µ21 , µ12 , .2. . , µn, µ
′′ ) be two strong fuzzy graph
) nbe two connected fuzzy-graph
1 2 ∗ ′ ′ , . . . , 0R′ )0
116 structures with
structures ∗ with underlying underlying crisp graph structures G 1 = (V 1 , R
crisp graph structures G1 = (V1 , R1 , nR2 , . . . , R0n ) and G2∗ =
∗ 1 , R 2
117 and00 G00 = (V200, R1′′ , R2′′ , . . . , Rn′′ ), respectively.
(V2 , R1 , R2 , . . . , Rn ), respectively. Let V1 = {u1 , u2 , . . . , um } and V2 = {v1 , v2 , . . . , vn }. Then
2
Let V1 = {u1 , u2 , . . . , um } and V2 =00{v 1 , v2 , . . . , vn }.
µi0∞ (ui u j ) >′∞ 0 for all ui , u j ∈ V1 and µi ∞ (vi v j ) > 0 for all vi , v j ∈ V2 . The maximal product of G1 =
118

119 Then µ i (u i u j ) > 0 for all u i , u j ∈ V 1 and

σ1 , µµ10 ′′∞
(120 , µ0 , . . . , µ0n ) and G2 = (σ2 , µ00 ,µ00 , . . . , µ00n ) is written as G = (σ, µ1 , µ2 , . . . , µn ). Now consider ’m’
i 2(vi vj ) > 0 for all vi , vj ∈ V12 . 2
subgraphs
121 The maximal of G with productthe vertex of G1 sets = (σ{1u, iµv′11,,µu′2i ,v.2., .. ,. µ. ,′nu) iand
vn } for i = 1, 2, . . . , m. Each of these subgraphs
′′ ′′ , ′′
122G G
of is2 connected
= (σ2 , µ1 , µsince 2 , . . . ,uµi sn )are the same
is written as Gand =G (σ, 2 µ µ2 , . . . , µn ).each vi is adjacent to at least one of
is1 ,connected,
the Now consider
123 vertices in V2 .’m’ Sincesubgraphs
G1 is connected, of G with the each vertex ui issets also{uadjacent
i v1 , ui v2 , to. . .at i vn } for
, uleast onei =of1,the
2, . vertices
. . , m. in
,
V124
1 . Each
Therefore, of these
there subgraphs
exists one of G
edge is connected
between since
any u
pair i s are
of thesame above and G
‘m’ 2 is connected,
subgraphs. each
Thus, vi ishave
we
µi ((ui v j )(uk vl )) > 0 for all (ui , v j )(uk , vl ) ∈ Ri . Hence, G is a connected fuzzy-graph [Link]
∞
125 adjacent to at least one of the vertices in V 2 . Also since G 1 is connected, each u i is adjacent
126 at least one of the vertices in V1 . Therefore there exists one edge between any pair of the above
127 ‘m’ subgraphs. Thus we have µ∞ ((ui vj )(uk vl )) > 0 for all (ui , vj )(uk , vl ) ∈ R.
i complete
Remark 2. The maximal product of two fuzzy-graph structures is not a complete fuzzy-graph structure
128 Hence G is connected fuzzy graph structure.
due to the absence of case u1 u2 ∈ Ri0 and v1 v2 ∈ Ri00 in the maximal-product definition. Since every complete
Remark
fuzzy-graph
129 2.12. The
structure maximal
is strong, producttoofTheorem
according two complete fuzzy graph
1, the maximal productstructuresof twoiscomplete
not a complete
fuzzy-graph
fuzzy isgraph
structures
130 a strong structure
fuzzy-graph due tostructure. the absence of case u1 u2 ∈ Ri′ and v1 v2 ∈ Ri′′ in maximal product
131 definition. Since every complete fuzzy graph structure is strong, according to Theorem 2.8,
132 [Link]
Definition The degree of twoofcomplete a vertexfuzzy graph structures
in maximal product isGa strong ∗ G of fuzzy twograph [Link]
fuzzy-graph
1 2
(σ1 , µ10 , µ20 , . 2.13.
G1331 = Definition . . , µ0n )Degree
and G2of=a(σvertex 00 00 , . . . , µ00 ) is given by:
2 , µ1 , µin2 maximal n product G1 ∗ G2 of two fuzzy graph structures
134 G1 = (σ1 , µ1 , µ2 , . . . , µn ) and G2 = (σ2 , µ′′1 , µ′′2 , . . . , µ′′n ) is given by:
′ ′ ′

dG1 ∗G2 (ui , v j ) = ∑ µi0 (ui uk ) ∨ σ2 (v j ) + X

X ∑ µ00j (v j vl ) ∨ σ1 (ui ).
dG1 ∗G2 (ui , vj ) = u u ∈ R0 ,v =v µ′i (ui uk ) ∨ σ2 (vj ) + v v ∈ R00 ,u =u µ′′j (vj vl ) ∨ σ1 (ui ).
i k j l i j l i k j
ui uk ∈R′i ,vj =vl vj vl ∈R′′
j ,ui =uk

i −degree
µ135 of a vertex
µi − degree of a of maximal
vertex of maximal G1 ∗ G2 is
product product G1given
∗ G2 by:
is given by:
X X
∑ µµi0i((uuiiukk) ∨∨ σσ22((vvjj ) +
′
µµi i−−ddGG1 ∗1 ∗G
G2 2((u
ui ,i ,vvj j)) == + ∑ µi′′i00(v
µ (vjjvvll))∨∨σσ11(u
(ui ).
i ).
∈R
uiiukk∈ Ri0′i,v
,vjj=
=vvll ∈ R′′ii00,uii =
vvjj vll ∈R =uukk

Example 5. Consider two fuzzy-graph structures G1 6= (σ1 , µ10 , µ20 , µ30 ) and G2 = (σ2 , µ100 ), which are shown
in Figure 7.
Mathematics 2019, 7, 63 6 of 22
136136 Example2.14.
Example [Link]
Consider twotwo fuzzy
fuzzy graph
graph structures
structures G1 G µ′11, µ
=1 ,(σ
=1 (σ ′ ) and G = (σ
µ′2′1,,µµ′3′2), µand ′′ ′′
3 G2 = 2(σ2 , µ1 2),, µ1 ),
whichare
137137 which areshown
shownin in Fig.
Fig. 7. 7.

u2 (0.6)
u2 (0.6)

b
v2 v
(0 2 (0 µ′ µ′
b .5b .5
) ) 1 (0 1 (
.4 0.4
) )

µ ′′ 0.4)
4)

µ2′ (0.5)
0.

µ2′ (0.5)
1(
µ ′′

1(
u1 (0.5)
u1 (0.5)

b
v1 v b b
(0 1 (
.4 0.
) 4)
′ (0
.3) .3)
G2 (σ2 , µ′′1 ) ′′ µ 3 µ′ 3(0
G2 (σ2 , µ1 )

b
u3 (0.7)
u3 (0.7)
G1 = (σ1 , µ′1 , µ′2′, µ′3′) ′
G1 = (σ1 , µ1 , µ2 , µ3 )

Figure
Figure 7. Two
7: Two fuzzy-graph
Fuzzy Graph Structures G Gand
structures G2G2 .
and
Figure 7: Two Fuzzy Graph Structures1 G1 1 and G2
The maximal
138 Maximalproduct
productofofGG11 and
and G
G22 is
is shown inFig.8
shown in Figure 8.
138 Maximal product of G1 and G2 is shown in Fig.8
(u2 , v2 )(0.6)
(u2 , v2 )(0.6)
b

) µ
b

0.5 2(
0. µ
(1 .5) 5)2 (0

(u3 , v2 )(0.7)
µ 0
(u1 , v2 )(0.5)

( .5
1 )

(u3 , v2 )(0.7)
µ
(u1 , v2 )(0.5)

µ3 (0.5)
µ3 (0.5)
b

b
b

b
µ1 (0.6)
1 )(0.6)
(u2µ,1v(0.6)
(u2 , v1 )(0.6)
µ1 (0.5)

µ1 (0.7)
µ1 (0.5)

µ1 (0.7)
b

µ2
.4) (0
(0
b

) .5µ)
µ1 .4 2(
0.5
(0
µ1 )
b

(u1 , v1 )(0.5) µ3 (0.4) (u3 , v1 )(0.7)

b

(u1 , v1 )(0.5) µ3 (0.4) (u3 , v1 )(0.7)

Figure 8: G1 ∗ G2 = (σ, µ1 , µ2 , µ3 )
Figure 8. G 1 ∗ (Maximal
Figure G28:= G (σ, ∗µProduct)
, µ2 , µ3 ) (maximal product).
1 1G2 = (σ, µ1 , µ2 , µ3 )
(Maximal Product)
139Degree of vertex
Degree in maximal
of vertex product
in maximal product is givenis given by: by:
139 Degree of vertex in maximal X product is given by: X
dG1d∗GG1 ∗G
2
2 (u
(u ,v ) =
i , iv j )j = ∑ ′
X
µ′iµ(u0 (i u
i ′
) ∨)σ∨
uki u (v ) +
k 2 σj2 ( v j ) +
′′
X ∑ µ′′j (vj vµl )00∨ σ1 (ui ).
j ( v j vl ) ∨ σ1 ( ui ).
00k,u =uµ′′ (vj vl ) ∨ σ1 (ui ).
dG1 ∗G2 (ui , vj ) =uuiiuukk∈R∈ Ri ,v
i j
j =v
0 ,v =lv
l µ i (u i u k ) ∨ σ 2 (v j ) vl ∈R
vj+ v jv
j l
,u∈
i =u
R j i kj
ui uk ∈R′i ,vj =vl vj vl ∈R′′
j ,ui =uk

Using this formula, we calculate degree of vertices in maximal product as:

dG1 ∗G2 (u1 , v1 ) = (µ10 (u1 u2 ) ∨ σ2 (v1 )) + (µ30 (u1 u3 ) ∨ σ2 (v1 )) + (µ100 (v1 v2 ) ∨ σ1 (u1 ))
= (0.4 ∨ 0.4) + (0.3 ∨ 70.4) + (0.4 ∨ 0.5)
= 0.4 + 0.4 + 0.5 7
= 1.3,

dG1 ∗G2 (u1 , v2 ) = (µ10 (u1 u2 ) ∨ σ2 (v2 )) + (µ30 (u1 u3 ) ∨ σ2 (v2 )) + (µ100 (v1 v2 ) ∨ σ1 (u1 ))
= (0.4 ∨ 0.5) + (0.3 ∨ 0.5) + (0.4 ∨ 0.5)
= 0.5 + 0.5 + 0.5
= 1.5,
Mathematics 2019, 7, 63 7 of 22

dG1 ∗G2 (u2 , v1 ) = (µ10 (u2 u1 ) ∨ σ2 (v1 )) + (µ20 (u2 u3 ) ∨ σ2 (v1 )) + (µ100 (v1 v2 ) ∨ σ1 (u2 ))
= (0.4 ∨ 0.4) + (0.5 ∨ 0.4) + (0.4 ∨ 0.6)
= 0.4 + 0.5 + 0.6
= 1.5,

dG1 ∗G2 (u2 , v2 ) = (µ10 (u2 u1 ) ∨ σ2 (v2 )) + (µ20 (u2 u3 ) ∨ σ2 (v2 )) + (µ100 (v2 v1 ) ∨ σ1 (u2 ))
= (0.4 ∨ 0.5) + (0.5 ∨ 0.5) + (0.4 ∨ 0.6)
= 0.5 + 0.5 + 0.6
= 1.6,

dG1 ∗G2 (u3 , v1 ) = (µ30 (u3 u1 ) ∨ σ2 (v1 )) + (µ20 (u3 u2 ) ∨ σ2 (v1 )) + (µ100 (v1 v2 ) ∨ σ1 (u3 ))
= (0.3 ∨ 0.4) + (0.5 ∨ 0.4) + (0.4 ∨ 0.7)
= 0.4 + 0.5 + 0.7
= 1.6,

dG1 ∗G2 (u3 , v2 ) = (µ20 (u3 u2 ) ∨ σ2 (v2 )) + (µ30 (u3 u1 ) ∨ σ2 (v2 )) + (µ100 (v1 v2 ) ∨ σ1 (u3 ))
= (0.5 ∨ 0.5) + (0.3 ∨ 0.5) + (0.4 ∨ 0.7)
= 0.5 + 0.5 + 0.7
= 1.7.

µi −degree of a vertex of maximal product G1 ∗ G2 is given by:

µi − dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µi00 (v j vl ) ∨ σ1 (ui ).

ui uk ∈ Ri ,v j =vl v j vl ∈ Ri ,ui =uk

Using this formula, we calculate µi −degree of vertices in maximal product as:

µ1 − dG1 ∗G2 (u1 , v1 ) = (µ10 (u1 u2 ) ∨ σ2 (v1 )) + (µ100 (v1 v2 ) ∨ σ1 (u1 ))

= (0.4 ∨ 0.4) + (0.4 ∨ 0.5)
= 0.4 + 0.5
= 0.9,

µ1 − dG1 ∗G2 (u1 , v2 ) = (µ10 (u1 u2 ) ∨ σ2 (v2 )) + (µ100 (v1 v2 ) ∨ σ1 (u1 ))

= (0.4 ∨ 0.5) + (0.4 ∨ 0.5)
= 0.5 + 0.5
= 1.0,

µ1 − dG1 ∗G2 (u2 , v1 ) = (µ10 (u2 u1 ) ∨ σ2 (v1 )) + (µ100 (v1 v2 ) ∨ σ1 (u2 ))

= (0.4 ∨ 0.4) + (0.4 ∨ 0.6)
= 0.4 + 0.6
= 1.0,
Mathematics 2019, 7, 63 8 of 22

µ1 − dG1 ∗G2 (u2 , v2 ) = (µ10 (u2 u1 ) ∨ σ2 (v2 )) + (µ100 (v2 v1 ) ∨ σ1 (u2 ))

= (0.4 ∨ 0.5) + (0.4 ∨ 0.6)
= 0.5 + 0.6
= 1.1,

µ1 − dG1 ∗G2 (u3 , v1 ) = µ100 (v1 v2 ) ∨ σ1 (u3 ) = 0.4 ∨ 0.7 = 0.7,

µ1 − dG1 ∗G2 (u3 , v2 ) = µ100 (v1 v2 ) ∨ σ1 (u3 ) = 0.4 ∨ 0.7 = 0.7,
µ2 − dG1 ∗G2 (u2 , v1 ) = µ20 (u2 u3 ) ∨ σ2 (v1 ) = 0.5 ∨ 0.4 = 0.5,
µ2 − dG1 ∗G2 (u2 , v2 ) = µ20 (u2 u3 ) ∨ σ2 (v2 ) = 0.5 ∨ 0.5 = 0.5,
µ2 − dG1 ∗G2 (u3 , v1 ) = µ20 (u3 u2 ) ∨ σ2 (v1 ) = 0.5 ∨ 0.4 = 0.5,
µ2 − dG1 ∗G2 (u3 , v2 ) = µ20 (u3 u2 ) ∨ σ2 (v2 ) = 0.5 ∨ 0.5 = 0.5,
µ3 − dG1 ∗G2 (u1 , v1 ) = µ30 (u1 u3 ) ∨ σ2 (v1 ) = 0.3 ∨ 0.4 = 0.4,
µ3 − dG1 ∗G2 (u1 , v2 ) = µ30 (u1 u3 ) ∨ σ2 (v2 ) = 0.3 ∨ 0.5 = 0.5,
µ3 − dG1 ∗G2 (u3 , v1 ) = µ30 (u3 u1 ) ∨ σ2 (v1 ) = 0.3 ∨ 0.4 = 0.4,
µ3 − dG1 ∗G2 (u3 , v2 ) = µ30 (u3 u1 ) ∨ σ2 (v2 ) = 0.3 ∨ 0.5 = 0.5.

Theorem 3. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures, such
that σ1 ≤ µi00 , i = 1, 2, . . . , n, then degree of any vertex in maximal product G1 ∗ G2 is given by dG1 ∗G2 (ui , v j ) =
dG1∗ (ui )σ2 (v j ) + dG2 (v j ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
that σ1 ≤ µi00 , then µi0 ≤ σ2 , i = 1, 2, . . . , n. Then, degree of any vertex in G1 ∗ G2 (maximal product) is
given by:

dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑0 σ2 (v j ) + ∑00 µ00j (v j vl )
ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= dG1∗ (ui )σ2 (v j ) + dG2 (v j ).

Theorem 4. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy graph structures such
that σ1 ≤ µi00 , i = 1, 2, . . . , n and σ2 is a constant function of value ‘c’, then degree of any vertex in G1 ∗ G2
(maximal product) is given by: dG1 ∗G2 (ui , v j ) = dG1∗ (ui )c + dG2 (v j ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures, such
that σ1 ≤ µi00 , i = 1, 2, . . . , n and σ2 is a constant function of value ‘c’. Moreover, σ1 ≤ µi00 implies
µi0 ≤ σ2 , i = 1, 2, . . . , n. Then degree of any vertex in G1 ∗ G2 (maximal product) is given by:

dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑0 σ2 (v j ) + ∑00 µ00j (v j vl )
ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= dG1∗ (ui )c + dG2 (v j ).

Mathematics 2019, 7, 63 9 of 22

Theorem 5. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures
such that σ2 ≤ µi0 , i = 1, 2, . . . , n, then degree of any vertex in maximal product G1 ∗ G2 is given by:
dG1 ∗G2 (ui , v j ) = dG2∗ (v j )σ1 (ui ) + dG1 (ui ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
that σ2 ≤ µi0 , then µi00 ≤ σ1 , i = 1, 2, . . . , n. Then, degree of any vertex in G1 ∗ G2 (maximal product) is
given by:

dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑ µi0 (ui uk ) + ∑ σ1 (ui )

ui uk ∈ Ri0 ,v j =vl v j vl ∈ R00j ,ui =uk

= dG1 (ui ) + dG2∗ (v j )σ1 (ui ).

Theorem 6. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures such
that σ2 ≤ µi0 , i = 1, 2, . . . , n and σ1 is a constant function of value ‘c’, then degree of any vertex in G1 ∗ G2
(maximal product) is given by: dG1 ∗G2 (ui , v j ) = dG1 (ui ) + dG2∗ (v j )c.

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
that σ2 ≤ µi0 ,i = 1, 2, . . . , n and σ1 is a constant function of value ‘c’. Moreover, σ2 ≤ µi0 implies µi00 ≤ σ1 ,
i = 1, 2, . . . , n. Then, degree of any vertex in G1 ∗ G2 (maximal product) is given by:

dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑0 µi0 (ui uk ) + ∑ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R00j ,ui =uk

= dG1 (ui ) + dG2∗ (v j )c.

Theorem 7. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures such
that µi00 ≤ σ1 and µi0 ≤ σ2 , i = 1, 2, . . . , n, then degree of any vertex in G1 ∗ G2 (maximal product) is given by:
dG1 ∗G2 (ui , v j ) = dG1∗ (ui )σ2 (v j ) + dG2∗ (v j )σ1 (ui ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
that µi00 ≤ σ1 and µi0 ≤ σ2 , i = 1, 2, . . . , n, then degree of any vertex in G1 ∗ G2 (maximal product) is
given by:

dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑ σ2 (v j ) + ∑ σ1 (ui )
ui uk ∈ Ri0 ,v j =vl v j vl ∈ R00j ,ui =uk

= dG1∗ (ui )σ2 (v j ) + dG2∗ (v j )σ1 (ui ).

Example 6. Consider two fuzzy-graph structures G1 = (σ1 , µ10 , µ20 , µ30 ) and G2 = (σ2 , µ100 ), which are shown
in Figure 9.
 ui uk ∈Ri ,vj =vl vj vl ∈Rj ,ui =uk

= dG∗1 (ui )σ2 (vj ) + dG∗2 (vj )σ1 (ui ).

197

198 Example 2.20. Consider two fuzzy graph structures G1 = (σ1 , µ′1 , µ′2 , µ′3 ) and G2 = (σ2 , µ′′1 ),
199
Mathematics which7, are
2019, 63 shown in Fig. 9. 10 of 22

µ3′ (0.6)

u1 (0.7)
b

v2
(0
b b .8
)
u4 (0.7)

µ3
.4)

′ (0
1 (0

7)
.3)
µ′

1(
0.
µ ′′
b
b b v1
(0
u2 (0.7) µ′2 (0.5) u3 (0.7) .7
)
G1 = (σ1 , µ′1 , µ′2 , µ′3 ) G2 (σ2 , µ′′1 )

Figure 9. Two
Figure 9: fuzzy-graph
Two Fuzzy structuresGG1 1and
Graph Structures andGG
22
.

The200maximal product
Maximal of Gof1 and
product G2 Gis2 shown
G1 and ininFigure
is shown Fig.10 10.

(u1 , v1 )(0.7) µ1 (0.7) (u1 , v2 )(0.8)

b b

µ
1(
0.
8)
µ1
(0

(u2 , v2 )(0.8)
µ3 (0.7)

.7)

µ1 (0.7)

µ3 (0.8)
b b

(u2 , v1 )(0.7)
)
0.7

8)
2(

0.
µ

2(
µ
µ3 (0.7)

b b

(u3 , v1 )(0.7) µ1 (0.7) (u3 , v2 )(0.8)

µ3 (0.8)

µ1 (0.7)

b b

(u4 , v1 )(0.7) (u4 , v2 )(0.8)

∗ 11
10. G110:
FigureFigure GG2 1=∗ (Gσ,2 µ=1 ,(σ,
µ2µ, µ ).
1 ,3µ2 , µ3 )

µ100Fig.
In Figure2019. In = σ9.1 and 0
µ′′1 =µσi1 < σ2µ,′ii<=σ21,, i2,=3.1, Then,
and 2, 3. the degree of vertex in maximal product is calculated
Then
by using following formula:
202 degree of vertex in maximal product is calculated by using following formula:

203 dG ∗G (ui , vj ) = dG∗ (ui )σ2 (vj ) + dG∗ (vj )σ1 (ui ).
dG1 ∗G2 (ui , v1 j ) 2= dG1∗ (ui )σ12 (v j ) + dG2∗ (v2j )σ1 (ui ).

dG1 ∗G2 (u1 d, Gv11∗G

) 2 (u=1 , v1d) G1= d 1 (u1 )σ2 (v1 ) + d
)σ2 (v1 ) + dG2∗ G(v2 (v 1 )σ1 (u1 ) ∗ ∗
∗ ( u1G 1 ) σ1 ( u1 )
= (2)(0.7) + 1(0.7)
= (2)(
= 0.7 )+
1.4 1(0.7)
+ 0.7
= 1.4=+ 0.7
2.1,
204
= 2.1,
dG1 ∗G2 (u1 , v2 ) = dG∗1 (u1 )σ2 (v2 ) + dG∗2 (v2 )σ1 (u1 )
= (2)(0.8) + 1(0.7)
dG1 ∗G2 (u1 , v2 ) = dG1=
∗ ( u1.6
1 ) σ+
2 (0.7
v2 ) + dG2∗ (v2 )σ1 (u1 )
= 2.3,
205
= (2)( 0.8) + 1(0.7)
= 1.6 + 0.7
dG1 ∗G2 (u2 , v1 ) = dG∗1 (u2 )σ2 (v1 ) + dG∗2 (v1 )σ1 (u2 )
= 2.3,= (3)(0.7) + 1(0.7)
= 2.1 + 0.7
= 2.8,
206 dG1 ∗G2 (u2 , v1 ) = dG1∗ (u2 )σ2 (v1 ) + dG2∗ (v1 )σ1 (u2 )
dG1 ∗G2 (u=
2 , v2 (
) 3)( dG)∗1+
= 0.7 (0.7
(u21)σ 2 (v2)) + dG∗2 (v2 )σ1 (u2 )

= 2.1=+ 0.7
(3)(0.8) + 1(0.7)
= 2.4 + 0.7
= 2.8,= 3.1,

12
Mathematics 2019, 7, 63 11 of 22

dG1 ∗G2 (u2 , v2 ) = dG1∗ (u2 )σ2 (v2 ) + dG2∗ (v2 )σ1 (u2 )
= (3)(0.8) + 1(0.7)
= 2.4 + 0.7
= 3.1,

dG1 ∗G2 (u3 , v1 ) = dG1∗ (u3 )σ2 (v1 ) + dG2∗ (v1 )σ1 (u3 )
= (2)(0.7) + 1(0.7)
= 1.4 + 0.7
= 2.1,

dG1 ∗G2 (u3 , v2 ) = dG1∗ (u3 )σ2 (v2 ) + dG2∗ (v2 )σ1 (u3 )
= (2)(0.8) + 1(0.7)
= 1.6 + 0.7
= 2.3,

dG1 ∗G2 (u4 , v1 ) = dG1∗ (u4 )σ2 (v1 ) + dG2∗ (v1 )σ1 (u4 )
= (1)(0.7) + 1(0.7)
= 0.7 + 0.7
= 1.4,

dG1 ∗G2 (u4 , v2 ) = dG1∗ (u4 )σ2 (v2 ) + dG2∗ (v2 )σ1 (u4 )
= (1)(0.8) + 1(0.7)
= 0.8 + 0.7
= 1.5.

By direct calculations:
dG1 ∗G2 (u4 , v1 ) = 0.7 + 0.7 = 1.4,

dG1 ∗G2 (u4 , v2 ) = 0.8 + 0.7 = 1.5,

dG1 ∗G2 (u1 , v1 ) = 0.7 + 0.7 + 0.7 = 2.1,

dG1 ∗G2 (u3 , v1 ) = 0.7 + 0.7 + 0.7 = 2.1,

dG1 ∗G2 (u1 , v2 ) = 0.8 + 0.8 + 0.7 = 2.3,

dG1 ∗G2 (u3 , v2 ) = 0.8 + 0.8 + 0.7 = 2.3,

dG1 ∗G2 (u2 , v1 ) = 0.7 + 0.7 + 0.7 + 0.7 = 2.8,

dG1 ∗G2 (u2 , v2 ) = 0.8 + 0.8 + 0.8 + 0.7 = 3.1.

It is clear from the above calculations that degrees of vertices calculated by using the formula of
the above theorem and by direct method are same.

Theorem 8. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures, such
that µi00 ≥ σ1 , i = 1, 2, . . . , n, then total degree of any vertex in G1 ∗ G2 (maximal product) is given by:
tdG1 ∗G2 (ui , v j ) = dG1∗ (ui )σ2 (v j ) + tdG2 (v j ).
Mathematics 2019, 7, 63 12 of 22

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
that µi00 ≥ σ1 , then µi0 ≤ σ2 , σ1 ≤ σ2 , i = 1, 2, . . . , n. Then, total degree of any vertex in G1 ∗ G2 (maximal
product) is given by:

tdG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui ) + σ (ui , v j )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑0 σ2 (v j ) + ∑00 µ00j (v j vl ) + [σ1 (ui ) ∨ σ2 (v j )]

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= dG1∗ (ui )σ2 (v j ) + [dG2 (v j ) + σ2 (v j )]

= dG1∗ (ui )σ2 (v j ) + tdG2 (v j ).

Example 7. Consider two fuzzy-graph structures G1 = (σ1 , µ10 , µ20 , µ30 ) and G2 = (σ2 , µ100 ), which are shown
in Figure 11.
In Figure 11. µ100 ≥ σ1 . Then, the total degree of vertex in maximal product is calculated by using the
following formula:

tdG1 ∗G2 (ui , v j ) = dG1∗ (ui )σ2 (v j ) + tdG2 (v j ).

tdG1 ∗G2 (u1 , v1 ) = dG1∗ (u1 )σ2 (v1 ) + tdG2∗ (v1 )

= 2(0.7) + (0.7 + 0.7)
= 1.4 + 1.4
= 2.8,

tdG1 ∗G2 (u1 , v2 ) = dG1∗ (u1 )σ2 (v2 ) + tdG2∗ (v2 )

= (2)(0.8) + (0.7 + 0.8)
= 1.6 + 1.5
= 3.1,

tdG1 ∗G2 (u2 , v1 ) = dG1∗ (u2 )σ2 (v1 ) + tdG2∗ (v1 )

= (3)(0.7) + (0.7 + 0.7)
= 2.1 + 1.4
= 3.5,

tdG1 ∗G2 (u2 , v2 ) = dG1∗ (u2 )σ2 (v2 ) + tdG2∗ (v2 )

= (3)(0.8) + (0.7 + 0.8)
= 2.4 + 1.5
= 3.9,

tdG1 ∗G2 (u3 , v1 ) = dG1∗ (u3 )σ2 (v1 ) + tdG2∗ (v1 )

= (2)(0.7) + (0.7 + 0.7)
= 1.4 + 1.4
= 2.8,
Mathematics 2019, 7, 63 13 of 22

tdG1 ∗G2 (u3 , v2 ) = dG1∗ (u3 )σ2 (v2 ) + tdG2∗ (v2 )

= (2)(0.8) + (0.7 + 0.8)
= 1.6 + 1.5
= 3.1,

tdG1 ∗G2 (u4 , v1 ) = dG1∗ (u4 )σ2 (v1 ) + tdG2∗ (v1 )

= (1)(0.7) + (0.7 + 0.7)
= 0.7 + 1.4
= 2.1,

tdG1 ∗G2 (u4 , v2 ) = dG1∗ (u4 )σ2 (v2 ) + tdG2∗ (v2 )

= (1)(0.8) + (0.7 + 0.8)
= 0.8 + 1.5
= 2.3.

By direct calculations:

tdG1 ∗G2 (u4 , v1 ) = 0.7 + 0.7 + 0.7 = 2.1,

225 Proof. Let G1 = (σ1 , µ′1 , µ′2 , . . . , µ′n ) and G2 = (σ2 , µ′′1 , µ′′2 , . . . , µ′′n ) be two fuzzy graph structures
226 such that µ′′i ≥ σ1 , then µtd′i G≤1 ∗σG22,(σu14 ,≤v2σ)2 ,=i =
0.81,+2,0.7
...+, n.0.8 = 2.3,
227 Then total degree of any vertex in G1 ∗ G2 (maximal product) is given by:
tdG1X ∗ G2 ( u1 , v1 ) = 0.7 + 0.7 + 0.7 +X 0.7 = 2.8,
tdG1 ∗G2 (ui , vj ) = µ′i (ui uk ) ∨ σ2 (vj ) + µ′′j (vj vl ) ∨ σ1 (ui ) + σ(ui , vj )
′ ( =v
u ,v ) = 0.7 + 0.7 + 0.7
vj vl+
utd ∈R0.7 i = k2.8,
′′ ,u =u
k ∈R
i uG
1 ∗ Gi ,v
2 j 3l 1 j
X X
= σ2 (vj ) + j l µ′′ (v v ) + [σ (ui ) ∨ σ2 (vj )]
tdG1 ∗G′ 2 (u3 , v2 ) = 0.8 + 0.8
′′
j 0.8
+ 0.7 + = 3.1,1
ui uk ∈Ri ,vj =vl vj vl ∈Rj ,ui =uk

= dtd
GG∗ (ui )σ (v ) + [d 2 (vj+
1 1 ∗ G2 (2u1 ,j v2 ) =G0.8
)+ σ2+
0.8 (vj0.7
)] + 0.8 = 3.1,
= dG∗1 (ui )σ2 (vj ) + tdG2 (vj ).
tdG1 ∗G2 (u2 , v1 ) = 0.7 + 0.7 + 0.7 + 0.7 + 0.7 = 3.5,
228

1
tdG ∗ G2 ( u2 , v2 ) = 0.8 + 0.8 + 0.8 + 0.7 + 0.8 = 3.9.
229 Example 2.22. Consider two fuzzy graph structures G1 = (σ1 , µ′1 , µ′2 , µ′3 ) and G2 = (σ2 , µ′′1 ),
It iswhich
230 are shown
clear from in Fig.
the above 11.
calculations that the total degrees of vertices calculated by using the formula of the
above theorem and by direct method are the same.

u1 (0.5)
b

u4 (0.7)
µ3
.4)

′ (0

b
1 (0
µ′

µ3′ (0.6)
.3)

v2 (0.8)
b

b b
µ1′′ (0.7)

u2 (0.7) µ′2 (0.5) u3 (0.7)

G1 = (σ1 , µ′1 , µ′2 , µ′3 )

v1 (0.7)

G2 (σ2 , µ′′1 )

Figure Two
11.11:
Figure fuzzy-graph
Two structures.
fuzzy graph structures
 Mathematics 2019, 7, 63 14 of 22

Theorem 9. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures, such
that µi00 ≥ σ1 , i = 1, 2, . . . , n and σ2 is a constant function of value ‘c’, then the total degree of any vertex in
G1 ∗ G2 (maximal product) (Figure 12) is given by: tdG1 ∗G2 (ui , v j ) = tdG2 (v j ) + dG1∗ (ui )c.

(u
1 ,v

7)
2)

0.
µ1 (0.7) (0

)(
.8

v1
b b )

1,
µ

µ3 (0.8)
(u
1(

µ1
0.

(u2 , v2 )(0.8)
8)

(0
.7)
µ1 (0.7)
µ3 (0.7) b b

(u2 , v1 )(0.7)

)
0.7

8)
2(

0.
µ

2(
µ
(u 3

b b
,v1

µ1 (0.7)

8)
)(0

0.
)(
µ3 (0.7)
.7)

v2

µ3 (0.8)
3,
µ1 (0.7)
(u
b b

(u4 , v1 )(0.7) (u4 , v2 )(0.8)

G1 ∗ G2 = (σ, µ1 , µ2 , µ3 )

Figure 12. Maximal product of two fuzzy-graph structures (FGSs).

Figure 12: Maximal product of two FGSs
Proof. Let G1 = ′′(σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures such
231 In Fig. 11. µ ≥ σ .
that µi00 ≥ σ1 ,i = 11, 2, . .1. , n and σ2 is a constant function of value ‘c’. Moreover, µi00 ≥ σ1 implies σ2 ≥ σ1 ,
232 0 Then total degree of vertex in maximal product is calculated by using following formula:
µi ≤ σ2 , i = 1, 2, . . . , n. Then, the total degree of any vertex in G1 ∗ G2 (maximal product) is given by:
233 tdG1 ∗G2 (ui , vj ) = dG∗1 (ui )σ2 (vj ) + tdG2 (vj ).
dG1 ∗G2 (ui , v j ) = ∑ µi0 (ui uk ) ∨ σ2 (v j ) + ∑ µ00j (v j vl ) ∨ σ1 (ui ) + σ (ui , v j )
ui uk ∈ Ri0 ,v j =vl v j vl ∈ R00j ,ui =uk
tdG1 ∗G2 (u σ21(,vvj )1 )+ = d∑ G∗1 (u1 )σ µ00j2((v
v1j v)l+
) +td[Gσ1∗2 ((vu1i )) ∨ σ2 (v j )]
= ∑0 00
ui uk ∈ Ri ,v j =vl v= 2(0.7)
j vl ∈ R j ,ui = uk+ (0.7 + 0.7)

= dG2 (v j ) + dG1∗ (ui )c +=

σ2 (v1.4
j ) + 1.4
= tdG (v j ) + dG∗ (ui )c. = 2.8,
2 1
234

tdG1 ∗G2 (u1 , v2 ) = dG∗1 (u1 )σ2 (v2 ) + tdG∗2 (v2 )

= (2)(0.8) + (0.7 + 0.8)
Theorem 10. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures such
= 1.6 + 1.5
that µi0 ≥ σ2 , i = 1, 2, . . . , n, then the total degree of any vertex in G1 ∗ G2 (maximal product) is given by:
= 3.1,
td
235 G1 ∗ G2
(ui , v j ) = dG2∗ (v j )σ1 (ui ) + tdG1 (ui ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . .td (u2 ,Gv1 )= (=

σ2 , µd100G, 1µ(u
∗ 00 2 )σ2 (v001 ) + tdG∗ (v1 )
. ,Gµ10n∗G
) 2and 2 2 , . . . , µn ) be two2 fuzzy-graph structures, such

that µi0 ≥ σ2 , then σ1 ≥ σ2 , µi00 ≤ σ1 , i = 1, 2, . .= . , n.(3)(0.7)

The total + degree
(0.7 + 0.7)
of any vertex in G1 ∗ G2 (maximal
product) is given by: = 2.1 + 1.4
= 3.5,
236 dG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui ) + σ(ui , v j )
ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk
tdG1 ∗G2 (u2 , v2 ) = dG∗1 (u2 )σ 2 (v2 ) + tdG∗2 (v2 )
= ∑ 0
µi ( ui u k ) +
= (3)(0.8) ∑ [σ1 (ui ) ∨ σ2 (v j )]
1 ( ui )++0.8)
+σ(0.7
ui uk ∈ Ri0 ,v j =vl v j vl ∈ R00j ,ui =uk
= 2.4 + 1.5
= dG1 (ui ) + dG2∗ (v j )σ1 (ui ) + σ1 (ui )
= 3.9,
= tdG1 (ui ) + dG2∗ (v j )σ1 (ui ).
15
 Mathematics 2019, 7, 63 15 of 22

Theorem 11. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two fuzzy-graph structures, such
that µi0 ≥ σ2 , i = 1, 2, . . . , n and σ1 is a constant function of value ‘c’, then the total degree of any vertex in
G1 ∗ G2 (maximal product) is given by: td G1 ∗G2 (ui , v j ) = dG2∗ (v j )c + tdG1 (ui ).

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be two fuzzy-graph structures, such
that µi0 ≥ σ2 ,i = 1, 2, . . . , n and σ1 is a constant function of value ‘c’. Moreover, µi0 ≥ σ2 implies σ1 ≥ σ2 ,
µi00 ≤ σ1 , i = 1, 2, . . . , n. Then, the total degree of any vertex in G1 ∗ G2 (maximal product) is given by:

tdG1 ∗G2 (ui , v j ) = ∑0 µi0 (ui uk ) ∨ σ2 (v j ) + ∑00 µ00j (v j vl ) ∨ σ1 (ui ) + σ (ui , v j )

ui uk ∈ Ri ,v j =vl v j vl ∈ R j ,ui =uk

= ∑0 µi0 (ui uk ) + ∑ σ1 (ui ) + [σ1 (ui ) ∨ σ2 (v j )]

ui uk ∈ Ri ,v j =vl v j vl ∈ R00j ,ui =uk

= dG1 (ui ) + dG2∗ (v j )c + σ1 (ui )

= tdG1 (ui ) + dG2∗ (v j )c.

277 3. The Maximal

Remark 2.26.
Remark maximal product
product ofof two
two regular
regular fuzzy-graph
fuzzy graphstructures maymay
structures notnot
be be
a regular
a regular
278 fuzzy-graph structure.
fuzzy graph structure.

Example
Example 2.27. Consider two fuzzy structures
graph structures
G1 = (σG 0 , µ′ ,G
0 , µ(σ ′
, µ2100 =
, µ200(σ ′′ , µ′′ ) as
279 8. Consider two fuzzy-graph 1 ,1µ1= 1 µ22 )=and
2 )1and (σ2G ) 2as, µshown
1 2
280 shown in Fig.13.
in Figure 13.

u6 (0.4) v1 (0.4)
u2 (0.4) u4 (0.4)

b
b b b
′′ 0.3
)
µ 1(

v2 (0.3)
b

µ2′′(
µ 2(

0.4)
4)

0.3)
′ 0.4
µ 2(0

.4)
′
1 0.

µ1′ (
µ ′(

µ1′ (0
.4)

v3 (0.4)
b

′′ .3)
b b b µ 1(0
b

u1 (0.5) u3 (0.6) u5 (0.4) v4 (0.3)

G1 = (σ1 , µ′1 , µ′2 ) G2 = (σ2 , µ′′1 , µ′′2 )

Figure 13. µ0 -regular and µ00 -regular FGSs.

Figure 13: µ′11-regular and1 µ′′1 -regular FGSs
It can easily be seen from Figure 13, that each vertex in G1 = (σ1 , µ10 , µ20 ) has one µ10 edge with same
It membership
can be easily value thatfrom
seen is 0.4,Fig.13,
hence G1that µ10 -regular
is 0.4each vertexFGS in Gand
1 = each ′ µ′ G
(σvertex
1 , µ1 , in = (σ2 , µµ100′, µedge
00 ) has one µ00
281 2 ) 2has one 1 2 with same1
00
282 membership value that is 0.4, hence G1 is 0.4 µ1 -regular1 FGS and each vertex in G2 = (σ2 , µ1 , µ′′2 )
edge with same membership value that is 0.3; hence, G′ 2 is 0.3 µ -regular FGS. ′′

has one µ′′1 edge

It can easily with
be seen from membership
same Figure 14, thatvalue
each vertex
that inis maximal
0.4, hence product
G2 isG10.4 ∗ Gµ2 ′′does not have same
283
1 -regular FGS.
number of edges of any type with same membership value. Hence, e G1 ∗ G2 is not a regular FGS. This example
shows that the maximal product of two regular FGSs is not a regular FGS.
(u1 , 4) (u
v (0.
1) b
1 )(0 v1 ) b 4,
.5 , v
Theorem b
G1 = 12. ) If (σ1 , µ10 , µ20 , . . . , µ0n )
is partially regular (0. (u 6
4) fuzzy-graph structure and
00 00 00 (u 6) 00 µ )
G2 = (σ2 , µ1 , µ2 ,µ. . . , µn ) is2 , vfuzzy-graph structure such 0. that µi ≥ 2 (0σ.1 , i = 1, 2, . . . ,(n0.4and σ2 is a
1 (0.4 1 )(0 )( 4)
) is regular if and µ1
µ1 (0.4)

) ‘c’, then .4maximal

µ1 (0.4)

constant function of value b ) 1

product3, vG ∗
1 (0 2G
.4 only if b G2 is regular.
µ1 (0.5)

µ2 (0 (u µ 1 (u5 , v1 )(0.4)
.4) b
Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) be partially regular fuzzy-graph structure such that G1∗ is r1 -regular
µ1 (0.4)

µ1 (0.4)

and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be fuzzy-graph structures(usuch that µi00 ≥ σ1 ,i = 1, 2, . . . ,(u
4 , v2 )(0.4)
n and σ2 is a
, v )(0.4)
b µ1 (0 b
6 2
µ1 (0.6)

(u1 , v ) .4) µ2 ( b
2 (0.5) 0.4) .4)
4) µ 1(0
(u2 , v b µ2 (0 (0.
.4) µ1
µ2 (0.4)

b
2 )(0.4
µ2 (0.5)

µ2 (0.4)

) (u5 , v2 )(0.4)
b
(u3 , v2 )(0.6)
0.4)

4)

(u , v )(0.4)
 Mathematics 2019, 7, 63 16 of 22

constant function of value ‘c’. Moreover, suppose that G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) is k-regular fuzzy-graph
structure. Then, dG1 ∗G2 (ui , v j ) = dG2 (v j ) + dG1∗ (ui )σ2 (v j ) = k + r1 c. This holds for all vertices of V1 × V2 .
Hence, maximal product (G1 ∗ G2 ) is regular fuzzy-graph structure. Conversely, suppose that maximal
product (G1 ∗ G2 ) is a regular fuzzy-graph structure. Then, for any two vertices of V1 × V2 ,
dG1 ∗G2 (u1 , v1 ) = dG1 ∗G2 (u2 , v2 )
⇒ dG2 (v1 ) + dG1∗ (u1 )σ2 (v1 ) = dG2 (v2 ) + dG1∗ (u2 )σ2 (v2 )
⇒ dG2 (v1 ) + r1 c = dG2 (v2 ) + r1 c
⇒ dRemark
277 2.26. Maximal product of two regular fuzzy graph structures may not be a regular
G2 ( v1 ) = d G2 ( v2 ).
278 fuzzy graph structure.
This holds for all vertices of G2 . Thus, G2 is regular fuzzy-graph structure.
279 Example 2.27. Consider two fuzzy graph structures G1 = (σ1 , µ′1 , µ′2 ) and G2 = (σ2 , µ′′1 , µ′′2 ) as
280 shown in13.
Theorem Fig.13.
If G = (σ , µ00 , µ00 , . . . , µ00 ) is partially regular fuzzy-graph structure and
2 2 1 2 n
G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) is fuzzy-graph structure, such that µi0 ≥ σ2 , i = 1, v2,1 (0.4) . . . , n and σ1 is a
u2 (0.4) u4 (0.4) u6 (0.4)
constant function of value ‘c’, then maximal product G1b ∗ G2 is regular if and only if G is regular.

b
b b 1
3) ′′ 0.
µ 1(
Proof. Let G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be partially regular fuzzy-graph
v2 (0.3)
structure such that G2∗ is r2 -regular

b
and G1 = (σ1 , µ1 , µ2 , . . . , µn ) be fuzzy-graph structure such that µi0 ≥ µσ22′(,i
0 0 0 ′
µ 2(

0.4)

0.3)= 1, 2, . . . , n and σ1 is a
4)

′ 0.4
µ 2(0

.4)
′
1 0.

constant function of value ‘c’. Moreover, suppose that G1 = (σ1 , µ1 , µ2 , . . . , µ0n ) is k−regular fuzzy-graph
0 0
µ1′ (
µ ′(

µ1′ (0
.4)

v (0.4)
structure. Then, dG1 ∗G2 (ui , v j ) = dG1 (ui ) + dG2∗ (v j )σ1 (ui ) = k + r2 c. This holds for3 all vertices of

b
V1 × V2 . Hence, maximal product ′′ .3)
(G1 ∗ G2 )b is a regular fuzzy-graph structure. Conversely, suppose
b b µ 1(0 b
that maximal product (G1u3∗(0.6)
u1 (0.5) G2 ) is a regular fuzzy-graph
u5 (0.4) structure.
v4 (0.3) Then, for any two vertices of
V1 × V2 ,
G1 = (σ1 , µ′1 , µ′2 ) G2 = (σ2 , µ′′1 , µ′′2 )
dG1 ∗G2 (u1 , v1 ) = dG1 ∗G2 (u2 , v2 )
⇒ dG1 (u1 ) + dG2∗ (v1 )σ1 (u1 ) =Figure ) + dµG′1 2-regular
dG1 (u213: and
∗ ( v2 ) σ1 ( u
′′
2 ) µ1 -regular FGSs
⇒ dG1 (u1 ) + r2 c = dG1 (u2 ) + r2 c
′ ′ ′
⇒ dItG1can
281 (u1be
) =easily 2 ). from Fig.13, that each vertex in G1 = (σ1 , µ1 , µ2 ) has one µ1 edge with same
dG1 (useen
282 membership value that is 0.4, hence G1 is 0.4 µ′1 -regular FGS and each vertex in G2 = (σ2 , µ′′1 , µ′′2 )
283 hasThis
oneholds for all
µ′′1 edge vertices
with same of G1 . Thus, G
membership 1 is athat
value regular fuzzy-graph
is 0.4, structure.
hence G2 is 0.4 µ′′1 -regular FGS.

(u1 , (u .4)
v 1 )(0 b 4, v1 ) v )(0 b
b .5) (0. , 1
4) (u 6
(u2 ) µ2
.6 (0. 4)
µ1 (0
.4)
, v1 )(
0.4) )(0 4) (0.
) µ1
µ1 (0.4)
µ1 (0.4)

b , v 1 (0.4
µ1 (0.5)

3 b
µ2 (0 (u µ1 (u5 , v1 )(0.4)
.4) b
µ1 (0.4)

µ1 (0.4)

(u4 , v2 )(0.4) (u6 , v2 )(0.4)

b µ1 (0 b
µ1 (0.6)

(u1 , v ) .4) µ2 ( 4 ) b
2 (0.5) 0.4) .
4) µ 1(0
(u2 , v µ2 (0 b (0.
.4) µ1
µ2 (0.4)

b
2 )(0.4
µ2 (0.5)

µ2 (0.4)

) (u5 , v2 )(0.4)
b
(u3 , v2 )(0.6)
µ2 (0.4)

µ2 (0.4)

(u4 , v3 )(0.4)
µ2 (0.6)

b b
µ1 (0 µ2 (u6 , v3 )(0.4)
(u1 , v ) .4) ) (0. b
3 (0.5)
0.4 4) 0.4)
µ2 (0.4 µ 1( µ 1(
µ1 (0.4)

(u2 , v b )
µ1 (0.5)

µ1 (0.4)

3 )(0.4 b
) b
(u3 , v3 )(0.6) (u5 , v3 )(0.4)
µ1 (0.4)

µ1 (0.4)
µ1 (0.6)

(u1 , b µ1 (0
.4) b b
v µ2 ( )
4 )(0
.5) 0.4
) 0.4 0.4) (0.4
µ 1( (u4 , v4 )(0.4) ) µ 1( , v 4)
µ2 (0.4 (u 6
(u2 , b )
v 4 )(0. b
4) b

(u3 , v4 )(0.6) (u5 , v4 )(0.4)

Figure 14. Maximal Product of G1 and G2 .

Figure 14: Maximal Product of G1 and G2

18
Mathematics 2019, 7, 63 17 of 22

Theorem 14. If G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) are two partially regular fuzzy-graph
structures such that µi00 ≤ σ1 , µi00 ≤ σ2 , i = 1, 2, . . . , n and σ2 is a constant function of value ‘c’, then maximal
product G1 ∗ G2 is regular if and only if σ1 is a constant function.

Proof. Let G1 = (σ1 , µ10 , µ20 , . . . , µ0n ) and G2 = (σ2 , µ100 , µ200 , . . . , µ00n ) be partially regular fuzzy-graph
structures such that µi00 ≤ σ1 , µi00 ≤ σ2 , i = 1, 2, . . . , n and σ2 is a constant function of value ‘c’.
Moreover, G1∗ is r1 −regular and G2∗ is r2 −regular. Furthermore, suppose that σ1 is a constant function
of value k. Then, dG1 ∗G2 (ui , v j ) = dG2∗ (v j )σ1 (ui ) + dG1∗ (ui )σ2 (v j ) = r2 k + r1 c. This holds for all vertices of
V1 × V2 . Hence, maximal product (G1 ∗ G2 ) is a regular fuzzy-graph structure. Conversely, suppose that
maximal product (G1 ∗ G2 ) is a regular fuzzy-graph structure. Then, for any two vertices of V1 × V2 ,
dG1 ∗G2 (u1 , v1 ) = dG1 ∗G2 (u2 , v2 )
⇒ dG2∗ (v1 )σ1 (u1 ) + dG1∗ (u1 )σ2 (v1 ) = dG2∗ (v2 )σ1 (u2 ) + dG1∗ (u2 )σ2 (v2 )
⇒ r2 σ1 (u1 ) + r1 c = r2 σ1 (u2 ) + r1 c
⇒ σ1 (u1 ) = σ1 (u2 ).
This holds for all vertices of G1 . Thus, σ1 is a constant function.

Remark 4. G1 ∗ G2 (maximal product) of two full regular fuzzy-graph structures G1 and G2 is not always full
regular. Moreover, if G1 and G2 are two regular fuzzy-graph structures on complete graph structures G1∗ and
G2∗ , respectively, then G1 ∗ G2 (maximal product) is a partially regular fuzzy-graph structure on a complete
underlying graph structure G1∗ ∗ G2∗ .

3. Application
Identification of most controversial issues among countries: Nowadays , the world has become
a global village, due to which all countries are related to each other. Relationships among different
countries are not of the same nature. Some countries have good relationships with each other; for
example, Pakistan and China have a very good relationship for many years. However, some countries
do not have good relationships due to which global peace is at stake. The reasons for bad relationships
are some controversial issues between those countries. There are many controversial issues that are
permanently dangerous to global peace, including line of control issues, counterterrorism activities,
proliferation of nuclear weapons, power struggles, religious issues, and occupations of other countries.
Different countries have many issues with each other, but, in particular time period, one issue
is the most controversial that needs the attention of peace-loving organizations to be solved, so that
warfare activities among those countries can be contained. For example, India and Pakistan have many
issues with each other, including the issue of Kashmir, water issues, religious issues, terrorism, power
struggles, and line of control issues. In different time periods, the India–Pakistan relationship has been
disturbed due to different issues. Nowadays, the most controversial issue between Pakistan and India
is the line of control issue, which needs to be promptly solved.
We can use a fuzzy-graph structure to highlight the most controversial issue between any two
countries in a particular time period, and can also tell the severity level of the issue at that time with
the help of the membership function. The fuzzy-graph structure of the most controversial issues can
be very helpful for peace-keeping organizations and the United Nations to maintain global peace.
Consider a set S of eight powerful countries:

S = { NorthKorea, America, SouthKorea, Pakistan, Iran, Russia, India, A f ghanistan}.

Let σ be a fuzzy set on S, defined in Table 1.

Mathematics 2019, 7, 63 18 of 22

Table 1. Fuzzy set σ of countries.

Country Degree of Membership

North Korea 0.8
America 0.9
South Korea 0.7
Pakistan 0.8
Iran 0.7
Russia 0.9
India 0.8
Afghanistan 0.5

In Table 1, we describe the degrees of membership in a set of powerful countries. In Tables 2–10,
we have mentioned the membership values of controversial issues between each pair of countries.
Membership value of each pair of countries is according to µ(v1 v2 ) ≤ σ (v1 ) ∧ σ (v2 ), for all v1 , v2 ∈ S.
By using these membership values, we show the severity level of each controversial issue between
each pair of countries.

Table 2. Fuzzy set of controversial issues between America and other countries.

Type of Controversial Issues (America, North Korea) (America, South Korea) (America, Pakistan) (America, Iran)
Proliferation of nuclear weapons 0.8 0.5 0.7 0.7
Counter terrorism activities 0.6 0.4 0.8 0.6
Line of control issues 0.1 0.1 0.3 0.2
To be more powerful 0.7 0.2 0.4 0.6
Religious issues 0.5 0.3 0.6 0.5
To occupy other country 0.3 0.5 0.6 0.5

Table 3. Fuzzy set of controversial issues between Russia and other countries.

Type of Controversial Issues (Russia, North Korea) (Russia, India) (Russia, Afghanistan) (Russia, America)
Proliferation of nuclear weapons 0.8 0.5 0.2 0.3
Counter terrorism activities 0.6 0.6 0.2 0.4
Line of control issues 0.2 0.6 0.1 0.5
To be more powerful 0.6 0.5 0.2 0.9
Religious issues 0.5 0.5 0.4 0.3
To occupy other country 0.6 0.5 0.5 0.4

Table 4. Fuzzy set of controversial issues between North Korea and other countries.

Type of Controversial Issues (North Korea, America) (North Korea, South Korea) (North Korea, Pakistan)
Proliferation of nuclear weapons 0.8 0.5 0.8
Counter terrorism activities 0.6 0.2 0.4
Line of control issues 0.1 0.6 0.3
To be more powerful 0.7 0.7 0.4
Religious issues 0.5 0.5 0.6
To occupy other country 0.3 0.6 0.4

Table 5. Fuzzy set of controversial issues between India and other countries.

Type of Controversial Issues (India, North Korea) (India, America) (India, South Korea) (India, Russia)
Proliferation of nuclear weapons 0.8 0.2 0.5 0.7
Counter terrorism activities 0.6 0.3 0.4 0.6
Line of control issues 0.1 0.2 0.3 0.4
To be more powerful 0.6 0.8 0.6 0.6
Religious issues 0.2 0.5 0.3 0.5
To occupy other country 0.3 0.3 0.4 0.4
Mathematics 2019, 7, 63 19 of 22

Table 6. Fuzzy set of controversial issues between Pakistan and other countries.

Type of Controversial Issues (Pakistan, Iran) (Pakistan, Russia) (Pakistan, India) (Pakistan, Afghanistan)
Proliferation of nuclear weapons 0.3 0.8 0.5 0.3
Counter terrorism activities 0.2 0.6 0.4 0.2
Line of control issues 0.5 0.5 0.8 0.5
To be more powerful 0.6 0.4 0.7 0.1
Religious issues 0.7 0.5 0.6 0.1
To occupy other country 0.3 0.3 0.6 0.1

Table 7. Fuzzy set of controversial issues between Afghanistan and other countries.

Type of Controversial Issues (Afghanistan, South Korea) (Afghanistan, Pakistan) (Afghanistan, America)
Proliferation of nuclear weapons 0.1 0.1 0.1
Counter terrorism activities 0.1 0.2 0.1
Line of control issues 0.2 0.5 0.0
To be more powerful 0.1 0.2 0.0
Religious issues 0.5 0.2 0.4
To occupy other country 0.0 0.1 0.5

Table 8. Fuzzy set of controversial issues between Iran and other countries.

Type of Controversial Issues (Iran, Russia) (Iran, India) (Iran, Afghanistan) (Iran, North Korea)
Proliferation of nuclear weapons 0.7 0.6 0.4 0.1
Counter terrorism activities 0.2 0.1 0.0 0.1
Line of control issues 0.1 0.4 0.2 0.0
To be more powerful 0.1 0.1 0.0 0.0
Religious issues 0.2 0.7 0.3 0.5
To occupy other country 0.0 0.2 0.0 0.0

Table 9. Fuzzy set of controversial issues between South Korea and other countries.

Type of Controversial Issues (South Korea, Iran) (South Korea, Russia) (South Korea, North Korea )
Proliferation of nuclear weapons 0.1 0.2 0.6
Counter terrorism activities 0.0 0.3 0.4
Line of control issues 0.0 0.2 0.6
To be more powerful 0.1 0.2 0.7
Religious issues 0.5 0.1 0.4
To occupy other country 0.3 0.5 0.6

Table 10. Fuzzy set of controversial issues between some countries.

Type of Controversial Issues (North Korea, Iran) (Afghanistan, India) (South Korea, Pakistan)
Proliferation of nuclear weapons 0.1 0.1 0.5
Counter terrorism activities 0.0 0.2 0.4
Line of control issues 0.0 0.5 0.0
To be more powerful 0.4 0.1 0.4
Religious issues 0.5 0.3 0.6
To occupy other country 0.3 0.0 0.2

On set S, many relations can be defined. Let us define following relations on S: R1 = Proliferation
of nuclear weapons, R2 = Counter terrorism activities, R3 = Line of control issues, R4 = To be more
powerful , R5 = Religious issues, R6 = To occupy other country, such that (S, R1 , R2 , R3 , R4 , R5 , R6 ) is a
graph structure. Each element in the relation depicts a particular kind of most controversial issues
among those two countries. As (S, R1 , R2 , R3 , R4 , R5 , R6 ) is the graph structure, therefore a pair of
countries can appear in just one relation. Hence, it would be considered an element of that relation,
for which its membership value is comparatively high than those of other relations. Using the given
data above, elements in relations are paired with their membership values, resulting sets are the fuzzy
sets on R1 , R2 , R3 , R4 , R5 , R6 , respectively. These fuzzy sets are µ1 , µ2 , µ3 , µ4 , µ5 , µ6 , respectively.
Mathematics 2019, 7, 63 20 of 22

Let
R1 = {( America, NorthKorea), ( America, Iran),
( NorthKorea, Russia), ( Pakistan, NorthKorea)},
R2 ={( Pakistan, America)},
R3 ={( Pakistan, India), ( A f ghanistan, India)},
R4 ={( America, Russia), (SouthKorea, NorthKorea)},
R5 = {( Iran, India), ( A f ghanistan, SouthKorea)},
R6 = {( America, A f ghanistan)}.
And the corresponding fuzzy sets are:
µ1 ={(( America, NorthKorea), 0.8), (( America, Iran), 0.7),
(( NorthKorea, Russia), 0.8), (( Pakistan, NorthKorea), 0.8)},
µ2 ={(( Pakistan, America), 0.8)}
µ3 ={(( Pakistan, India), 0.8), (( A f ghanistan, India), 0.5)},
µ4 ={( America, Russia), 0.9),((SouthKorea, NorthKorea), 0.7)},
µ5 ={(( Iran, India), 0.7), (( A f ghanistan, SouthKorea), 0.5)},
µ6 = {(( America, A f ghanistan), 0.5)}.
Clearly, (σ, µ1 , µ2 , µ3 , µ4 , µ5 , µ6 ) is a fuzzy-graph structure and is shown in Figure 15.

In the FGS shown in Figure 15, each edge depicts the most controversial issue in the corresponding
countries. For example: the most controversial issue between America and North Korea is the
proliferation of nuclear weapons, and its membership value is 0.8. It can be noted that vertex America
has the highest vertex degree for the relation proliferation of nuclear weapons. This means that America
has the proliferation of nuclear weapons as a controversial issue with other countries. Moreover,
according to this fuzzy-graph structure, Pakistan and India have the line of control issue as the
most controversial issue at this time with membership value 0.8. A FGS of all countries can be very
helpful for United Nations and other organizations to maintain global peace. It would highlight those
controversial issues that needed to be promptly solved.

Proliferation of Nuclear Weapons

To be more Powerful

North Korea
Line of Control Issues
Pakistan

Counter Terrorism Activities

Proliferation of Nuclear Weapons

Iran

America
Proliferation of Nuclear Weapons
ns
po
ea
s

To W
sue

be ar
cle
l Is

m u
To

or
tro

eP N
of
O

on

ow
cc

n
tio
C

erf
up

ul ra
of
yO

fe
li
ne

ro
the

Li

Russia P
rC

South Korea s
ue
ou

Iss
ntr

us
y

io
lig
India Re
Religious Issues Afghanistan

Line of Control Issues

Figure 15. Fuzzy-graph structure depicting most controversial issues among different countries.

Figure 15: Fuzzy graph structure depicting most controversial issues among different countries

381 In FGS shown in Fig. 15 each edge depicts most controversial issue among corresponding coun-
382 tries. For example: most controversial issue among America and North Korea is proliferation of
383 nuclear weapons, its membership value is 0.8. It can be noted that vertex America has highest
 Mathematics 2019, 7, 63 21 of 22

The general procedure used in this application is shown in the following flowchart (Figure 16).

Input

Set of countries Some controversial issues

Define Fuzzy set of countries

Membership value of each country denotes its political, economic and military strength

Find severity level of each controversial issue among each pair of countries

Develop mutually disjoint, irreflexive and symmetric relations on set of countries

Give the name each relation as a controversial issue

Construct a graph structure on set of countries with relations

Select those pairs of countries having same kind of controversial issue as elements of same relation

Assign severity level defined above to elements of all relations as membership value

Develop fuzzy relations on fuzzy set of countries

Construct a fuzzy graph structure on fuzzy set of countries with fuzzy relations

Draw fuzzy graph structure

Each edge of FGS shows most controversial issue among corresponding countries

Figure 16. Flowchart.

Figure 16: Flowchart
4. Conclusions
391 4 Conclusions
Graph theory has many applications in solving various problems of several domains, including
networking, communication, data mining, clustering, image capturing, image segmentation,
392 Graph theory has many applications in solving various problems of several domains, includ-
planning, and scheduling. However, in some situations, certain aspects of a graph-theoretical system
393 ing, networking, communication, data mining, clustering, image capturing, image segmentation,
may be uncertain. Use of fuzzy-graphical methods in dealing with ambiguity and vague notions is
394 planning and scheduling. However, in some situations, certain aspects of graph-theoretical sys-
very natural. Fuzzy-graph theory has a large number of applications in modeling various real-time
395 tem may be uncertain. Use of fuzzy graphical methods in dealing ambiguity and vague notions is
systems where the level of information inherent in the system varies with different levels of precision.
396 very natural. Fuzzy graph theory has large number of applications in modeling various real time
In this article, we have presented a new framework to handle fuzzy information by combining fuzzy
397 systems where level of information inherent in system varies with different levels of precision.
sets with graph structures. We have introduced many basic notions concerning fuzzy-graph structures
398 In this article, we have presented a new frame work to handle fuzzy information by combining
including maximal product of two fuzzy-graph structures and regular fuzzy-graph structures, and
399 fuzzy sets with graph structures. We have introduced many basic notions concerning fuzzy
investigated a few related properties. We have also defined the degree and total degree of vertex
400 graph structures including maximal product of two fuzzy graph structures and regular fuzzy
401
in the maximal
graph structuresproduct of fuzzy-graph
and investigate structures,
few related and discussed
properties. We havesome
also properties with and
defined degree examples.
total
402
Furthermore, we have considered an application of fuzzy-graph structures. In particular,
degree of vertex in maximal product of fuzzy graph structures and discussed some properties a flowchart
403
was
withdeveloped
[Link],
show the general procedure
we have of thean
considered application regarding
application of fuzzythe identification
graph [Link] the
In
404
most controversial issues among countries. In the future, we will extend our fuzzification
particular, a flowchart is developed to show general procedure of application, regarding identi- to the
maximal product of (1) soft fuzzy-graph structures; (2) fuzzy soft graph structures; (3) rough fuzzy
soft graph structures; and (4) rough fuzzy graph structures.
25
Mathematics 2019, 7, 63 22 of 22

Author Contributions: M.S., M.A. and M.Y.B. conceived of the presented idea. M.S. and M.Y.B. developed the
theory and performed the computations. M.A verified the analytical methods.
Funding: This research received no external funding.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [CrossRef]
2. Rosenfeld, A. Fuzzy groups. J. Math. Anal. Appl. 1971, 35, 512–517. [CrossRef]
3. Kauffman, A. Introduction a la Theorie des Sous-Emsembles Flous; Masson et Cie: Paris, French, 1973.
4. Zadeh, L.A. Similarity relations and fuzzy orderings. Inf. Sci. 1971, 3, 177–200. [CrossRef]
5. Rosenfeld, A. Fuzzy graphs. In Fuzzy Sets and their Applications; Zadeh, L.A., Fu, K.S., Shimur, M., Eds.;
Academic Press: New York, NY, USA, 1975; pp. 77–95.
6. Bhattacharya, P. Some remarks on fuzzy graphs. Pattern Recognit. Lett. 1987, 6, 297–302. [CrossRef]
7. Sunitha, M.S.; Vijayakumar, A. Complement of a fuzzy graph. Indian J. Pure Appl. Math. 2002, 33, 1451–1464.
8. Sunitha, M.S.; Vijayakumar, A. A characterization of fuzzy trees. Inf. Sci. 1999, 113, 293–300. [CrossRef]
9. Mordeson, J.N.; Nair, P.S. Fuzzy Graphs and Fuzzy Hypergraphs; Springer: Heidelberg, Germany, 2000;
ISBN 978-3-7908-1854-3.
10. Bhutani, K.R.; Battou, A. On M-strong fuzzy graphs. Inf. Sci. 2003, 155, 103–109. [CrossRef]
11. Mathew, S.; Sunitha, M.S. Types of arcs in a fuzzy graph. Inf. Sci. 2009, 179, 1760–1768. [CrossRef]
12. Mordeson, J.N.; Chang-Shyh, P. Operations on fuzzy graphs. Inf. Sci. 1994, 79, 159–170. [CrossRef]
13. Nagoor Gani, A.; Radha, K. On regular fuzzy graphs. J. Phys. Sci. 2008, 12, 33–44.
14. Nagoor Gani, A.; Radha, K. Conjunction of two fuzzy graphs. Int. Rev. Fuzzy Math. 2008, 3, 61–71.
15. Nagoor Gani, A.; Radha, K. Some sequences in fuzzy graphs. Far East J. Appl. Math. 2008, 31, 321–335.
16. Nagoor Gani, A.; Radha, K. The degree of a vertex in some fuzzy graphs. Int. J. Algorithms Comput. Math.
2009, 2, 107–116.
17. Akram, M.; Dudek, W.A. Regular bipolar fuzzy graphs. Neural Comput. Appl. 2012, 21, 197–205. [CrossRef]
18. Akram, M.; Nawaz, S. Operations on soft graphs. Fuzzy Inf. Eng. 2015, 7, 423–449. [CrossRef]
19. Akram, M.; Luqman, A. Certain concepts of bipolar fuzzy directed hypergraphs. Mathematics 2017, 5, 17.
[CrossRef]
20. Sarwar, M.; Akram, M.; Alshehri, N.O. A new method to decision-making with fuzzy competition
hypergraphs. Symmetry 2018, 10, 404. [CrossRef]
21. Sampathkumar, E. Generalized graph structures. Bull. Kerala Math. Assoc. 2006, 3, 65–123.
22. Dinesh, T. A Study on Graph Structures, Incidence Algebras and Their Fuzzy Analogues. Ph.D. Thesis,
Kannur University, Kannur, India, 2011.
23. Ramakrishnan, R.V.; Dinesh, T. On generalised fuzzy graph structures. Appl. Math. Sci. 2011, 5, 173–180.
24. Ramakrishnan, R.V.; Dinesh, T. On generalised fuzzy graph structures II. Adv. Fuzzy Math. 2011, 6, 5–12.
25. Ramakrishnan, R.V.; Dinesh, T. On generalised fuzzy graph structures III. Bull. Kerala Math. Assoc. 2011, 8,
57–66.
26. Harinath, P.; Lavanya, S. Fuzzy graph structures. Int. J. Appl. Eng. Res. 2015, 10, 80.

c 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license ([Link]