Next Article in Journal
(Quantum) Time-Memory-Data Tradeoff Attacks on the SNOW-V Stream Cipher
Next Article in Special Issue
Compressed-Encoding Particle Swarm Optimization with Fuzzy Learning for Large-Scale Feature Selection
Previous Article in Journal
Lagrange-Based Hypergeometric Bernoulli Polynomials
Previous Article in Special Issue
ZL-Completions for ZL-Semigroups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Maximal Product and Symmetric Difference of Complex Fuzzy Graph with Application

1
Department of Mathematics, Quaid-I-Azam University, Islamabad 45320, Pakistan
2
Faculty of Sciences and Technology, University of the Faroe Islands, Vestarabryggja 15, FO 100 Torshavn, Faroe Islands
3
Department of Mathematics, King Saud University, P.O. Box 22452, Riyadh 11495, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(6), 1126; https://doi.org/10.3390/sym14061126
Submission received: 29 April 2022 / Revised: 20 May 2022 / Accepted: 21 May 2022 / Published: 30 May 2022
(This article belongs to the Special Issue Symmetry/Asymmetry and Fuzzy Systems)

Abstract

:
A complex fuzzy set (CFS) is described by a complex-valued truth membership function, which is a combination of a standard true membership function plus a phase term. In this paper, we extend the idea of a fuzzy graph (FG) to a complex fuzzy graph (CFG). The CFS complexity arises from the variety of values that its membership function can attain. In contrast to a standard fuzzy membership function, its range is expanded to the complex plane’s unit circle rather than [0,1]. As a result, the CFS provides a mathematical structure for representing membership in a set in terms of complex numbers. In recent times, a mathematical technique has been a popular way to combine several features. Using the preceding mathematical technique, we introduce strong approaches that are properties of CFG. We define the order and size of CFG. We discuss the degree of vertex and the total degree of vertex of CFG. We describe basic operations, including union, join, and the complement of CFG. We show new maximal product and symmetric difference operations on CFG, along with examples and theorems that go along with them. Lastly, at the base of a complex fuzzy graph, we show the application that would be important for measuring the symmetry or asymmetry of acquaintanceship levels of social disease: COVID-19.

1. Introduction

It is frequently recognized that graphs are basically representations of relations. A graph is a useful means of describing information concerning object relationships. Vertices represent objects, while edges describe relationships.
It can be used to look at combinatorial problems in a lot of different fields, such as algebra, topology, zoology, number theory, geometry, and image capture and clustering.
The graph’s vertices and edges are used to describe objects and the relationships between them, respectively. Vagueness in global issues can emerge in the information that specifies the conditions. FG models are useful mathematical tools for dealing with combinatorial issues in different fields, such as topology, algebra, optimization, computers, and environmental science. Because of the inherent presence of vagueness and ambiguity, FG models are more complex in comparison to simple graphical models. The first time fuzzy set theory was used, it was used to deal with a lot of complicated situations that did not have enough information.
Zadeh [1] proposed the theory of a fuzzy set (FS), which is applicable in several areas, and his FS has a true membership function which is limited to [0,1]. In approximate reasoning, the importance of fuzzy theory is particularly significant in overcoming combinatorial challenges in numerous domains, such as algebra, image segmentation, topology, operational research, medical science, and algebraic structure. Rosenfeld [2] discussed the fuzzy versions of various graph-based theories. Ghorai and Pal [3,4] recently studied the extensions of FG, such as bipolar fuzzy graphs, m-polar fuzzy planner graphs, and m-polar fuzzy graphs. They defined the density of m-polar fuzzy graph techniques as well as a set of operations. Nagoor Gani and Radha [5] discussed a few operations on regular FG. Mathew and Sunitha described some kinds of arcs of FG. Bhattacharya [6] gave some remarks on FG. Atanassov [7] extended the FS to the intuitionistic fuzzy set. Shao et al. [8] developed new notions of the bondage number in intuitionistic fuzzy graphs. Rashmanlou et al. [9,10] discussed briefly a bipolar fuzzy graph with the product of bipolar fuzzy graphs, categorical operations, and related degrees. Rashmanlou et al. [11] were interested in research on interval-valued fuzzy graphs. Zeng et al. [12] invented different properties for single-valued neutrosophic graphs. Shao et al. [13] studied the properties of vague graphs.
Ramot et al. [14] proposed the notion of a “CFS” in 2002. CFSs are an innovative development of Zadeh’s fuzzy sets. Despite all of the benefits of this theory, we still face enormous challenges when attempting to counter various physical conditions using a true membership function. Because of this, it is very important to add a new step to fuzzy set theory that takes into account complex numbers, which are an expansion of real numbers. Complex fuzzy logic is a linear extension of standard fuzzy logic. It lets problems in fuzzy logic that cannot be solved with a simple membership function grow and change in a natural way. This specific set plays a critical role in a variety of executions, particularly intelligent control systems and the prediction of periodic phenomena, where various fuzzy variables are connected in a complicated way that cannot be accurately represented by simple fuzzy operations. Furthermore, these sets are employed to tackle a variety of difficulties, particularly the various periodic aspects and forecasting challenges. One of the far-reaching implications of researching the CFS is that it effectively illustrates data with uncertainty and periodicity. Buckley described fuzzy complex numbers in [15]. Yaqoob et al. [16] studied the complex intuitionistic fuzzy graph and the complex neutrosophic graph. Shoaib et al. [17] proposed the concept of a complex Pythagorean fuzzy graph. Shoaib et al. [18] discussed some properties, symmetric difference and maximal product of picture fuzzy graphs. Gulzar et al. [19,20,21] discussed fuzzy groups.
The CFG is the generalization of the FG. We define the order and size of CFG. Furthermore, we present the degree of vertex and total degree of vertex concepts for CFG. We describe some basic properties, including the join, union, and complement of CFG. We discuss some new operations with maximal product and symmetric difference on CFG with elaboration of examples and related theorems. Lastly, we analyze the application of CFG.

2. Preliminaries

Definition 1
([1]). Fuzzy set is defined as Q = < p : μ Q ( p ) > , p X , where μ Q : A [ 0 , 1 ] represent the degree of true membership function.
Definition 2
([17]). Let X be a non-empty universal set. A complex fuzzy set Q is defined as Q = < p : μ Q ( p ) e i α Q > , p X where μ Q : A [ 0 , 1 ] and α Q : A [ 0 , 2 π ] .
Definition 3
([22]). FG is a pair G = ( Q , L ) with fuzzy set Q on A and a fuzzy relation L on A such that
μ L ( p q ) max { μ Q ( p ) , μ Q ( q ) }
where μ Q : A [ 0 , 1 ] denotes the degree of true membership function and the function μ L : B ⊆ A × A→ [0,1].

3. CFGs

This section presents the idea of complex fuzzy relations and CFG, as well as some of their properties.
Definition 4.
A CFG on a universe Y with underlying set A is an ordered pair τ = ( Q , L ) ; Q is a complex fuzzy set on A and L is a complex fuzzy set on B A × A such that
μ L ( x y ) e i α L ( x y ) min { μ Q ( x ) , μ Q ( y ) } e i min { α Q ( x ) , α Q ( y ) }
μ Q ( x ) [ 0 , 1 ] , and α Q ( x ) [ 0 , 2 π ]
∀ x, y ∈ A.
Definition 5.
Let Q = { x , μ Q ( x ) e i α Q ( x ) } , Q 1 = { x , μ Q 1 ( x ) e i α Q 1 ( x ) } | x Y } ,
Q 2 = { x , μ Q 2 ( x ) e i α Q 2 ( x ) } | x Y } , be the three CFSs in Y:
 (i) 
Q 1 Q 2 if and only if μ Q 1 μ Q 2 for amplitude terms and α Q 1 α Q 2 for phase terms, ∀ x ∈ Y.
 (ii) 
Q 1 = Q 2 if and only if μ Q 1 = μ Q 2 for amplitude terms and α Q 1 = α Q 2 for phase terms, ∀ x ∈ Y.
For simplicity, μ e i α is called the complex fuzzy number where μ ∈ [0,1], and α ∈ [ 0 , 2 π ] .
Definition 6.
Let Q 1 = { x , μ Q 1 ( x ) e i α Q 1 ( x ) | x Y } and Q 2 = { x , μ Q 2 ( x ) e i α Q 2 ( x ) | x Y } be the two complex picture fuzzy sets in Y, then
 (i) 
Q 1 Q 2 = { x , max ( μ Q 1 ( x ) , μ Q 2 ( x ) ) e i max ( α Q 1 ( x ) , α Q 2 ( x ) ) | x Y } .
 (ii) 
Q 1 Q 2 = { x , min ( μ Q 1 , μ Q 2 ( x ) ) e i min ( α Q 1 ( x ) , α Q 2 ( x ) ) | x Y } .
Definition 7.
A complex fuzzy set L in Y × Y is called a complex fuzzy relation in Y, characterized by L = { x y , μ L ( x y ) e i α L ( x y ) | x y Y × Y}, where μ L : Y × Y → [0,1] depicts the membership function of L and α L ( x y ) 2 π ∀ xy ∈ Y × Y.
Example 1.
Let G = (A,B) be a graph with Q = { s 1 , s 3 , s 4 } as the vertex set and L = { s 1 s 3 , s 3 s 4 } as the edge set of G. τ = ( Q , L ) is a CFG on A, as given in Figure 1, defined by Q = < ( s 1 0.3 e 0.2 π i , s 3 0.3 e 0.3 π i , s 4 0.3 e 0.3 π i ) >   L = < ( s 1 s 3 0.2 e 0.1 π i , s 3 s 4 0.2 e 0.2 π i ) > .
Definition 8.
Let Q = { x , μ Q ( x ) e i α Q ( x ) | x A } and L = { x y , μ L ( x y ) e i α L ( x y ) | x y B } be the vertex set and edge set of a CFG τ, then the order of a CFG τ is denoted by O(τ) and is defined as O(τ) = x i A μ Q ( x i ) e i x i A α Q ( x i ) .
The size of a CFG τ is denoted by S(τ ) and is defined as S(τ) = x i A μ L ( x i y j ) e i x i y j A α L ( x i y j ) .
Example 2.
The order and size of the CFG given in Figure 1 is O(τ) = 0.9 e 0.8 π i and S(τ) = 0.4 e 0.3 π i , respectively.
Definition 9.
The complement of a CFG τ = (Q,L) on the underlying graph G = (A,B) is a CFG τ ¯ = ( Q ¯ , L ¯ ) defined by
 1. 
μ Q ( x ) e i α Q ( x ) ¯ = μ Q ( x ) e i α Q ( x )
 2. 
μ L ( x y ) e i α L ( x y ) ¯ = min { μ Q ( x ) , μ Q ( y ) } e min { α Q ( x ) , α Q ( y ) } i i f μ L ( x y ) e i α L ( x y ) = 0 , min { μ Q ( x ) , μ Q ( y ) } e min { α Q ( x ) , α Q ( y ) } i μ L ( x y ) e i α L ( x y ) i f 0 < μ L ( x y ) e i α L ( x y ) 1 . .
Example 3.
Consider a CFG τ = (Q,L) on A = { s 1 , s 2 , s 3 } , which is shown as in Figure 2 where Q = < ( s 1 0.3 e 0.3 π i , s 2 0.4 e 0.4 π i , s 3 0.2 e 0.2 π i ) , L = < ( s 2 s 1 0.3 e 0.3 π i , s 1 s 3 0.1 e 0.1 π i ) .
Utilizing the Definition 9, the complement of a CFG can be obtained, which is shown as in Figure 3.
Where Q ¯ = < ( s 1 0.3 e 0.3 π i , s 2 0.4 e 0.4 π i , s 3 0.2 e 0.2 π i ) >   L ¯ = < ( s 1 s 3 0.1 e 0.1 π i , s 2 s 3 0.2 e 0.2 π i ) ) .
It is easy to see from Figure 3 that τ ¯ = ( Q ¯ , L ¯ ) is a CFG.
Theorem 1.
The complement of a complement of CFG is a CFG itself, that is, τ = = τ
Proof. 
Suppose that τ is a CFG. Then, by utilizing Definition 9.
μ Q ( x ) = e i α Q ( x ) = = μ Q ( x ) ¯ e i α Q ( x ) ¯ = μ Q ( x ) e i α Q ( x ) for all x ∈ A
if μ L ( x y ) e i α L ( x y ) = 0 then
μ L ( x y ) = e i α L ( x y ) = = min { μ Q ( x ) ¯ , μ Q ( y ) ¯ } e i   min { α Q ( x ) ¯ , α Q ( y ) ¯ }
= min { μ Q ( x ) , μ Q ( y ) } e i   min { α Q ( x ) , α Q ( y ) } = μ L ( x y ) e i α L ( x y )
if 0 < μ L ( x y ) e i α L ( x y ) 1 then
μ L ( x y ) = e i α L ( x y ) = = min { μ Q ( x ) ¯ , μ Q ( y ) ¯ } e i   min { α Q ( x ) ¯ , α Q ( y ) ¯ } μ L ( x y ) ¯ e i α L ( x y ) ¯
μ L ( x y ) = e i α L ( x y ) = = min { μ Q ( x ) ¯ , μ Q ( y ) ¯ } e i   min { α Q ( x ) ¯ , α Q ( y ) ¯ }
min { μ Q ( x ) , μ Q ( y ) } e min { α Q ( x ) , α Q ( y ) } i μ L ( x y ) e i α L ( x y )
μ L ( x y ) = e i α L ( x y ) = = μ L ( x y ) e i α L ( x y )
for all x, y ∈ A. Hence τ = = τ . □
Definition 10.
The union τ 1 ∪τ 2 = ( Q 1 Q 2 , L 1 L 2 ) of two CFGs τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) of the graphs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) , respectively, is defined as follows: ( μ Q 1 μ Q 2 ) (x) e i ( α Q 1 α Q 2 )
( μ Q 1 μ Q 2 ) ( x ) e i ( α Q 1 α Q 2 ) ( x ) = μ Q 1 ( x ) e i α Q 1 ( x ) i f x A 1 A 2 , μ Q 2 ( x ) e i α Q 2 ( x ) i f x A 2 A 1 , max { μ Q 1 ( x ) , μ Q 2 ( x ) } e i   max { α Q 1 ( x ) , α Q 2 ( x ) } i f x A 1 A 2 ,
( μ L 1 μ L 2 ) ( x y ) e i ( α L 1 α L 2 ) ( x y ) = μ L 1 ( x y ) e i α L 1 ( x y ) i f x y B 1 B 2 , μ L 2 ( x y ) e i α L 2 ( x y ) i f x y B 2 B 1 , max { μ L 1 ( x y ) , μ L 2 ( x y ) } e i   max { α L 1 ( x y ) , α L 2 ( x y ) } i f x y B 1 B 2 ,
Definition 11.
The ring-sum τ 1 τ 2 = ( Q 1 Q 2 , L 1 L 2 ) of two CFGs τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) of the graphs G 1 and G 2 , respectively, is defined as follows:
( μ Q 1 μ Q 2 ) ( x ) e i ( α Q 1 α Q 2 ) ( x ) =( μ Q 1 μ Q 2 ) ( x ) e i ( α Q 1 α Q 2 ) ( x ) ,
( μ L 1 μ L 2 ) ( x y ) e i ( α L 1 α L 2 ) ( x y ) = μ L 1 ( x y ) e i α L 1 ( x y ) i f x y B 1 B 2 , μ L 2 ( x y ) e i α L 2 ( x y ) i f x y B 2 B 1 , 0 i f x y B 1 B 2 ,
Definition 12.
Let τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) be two CFGs of G 1 and G 2 , respectively. The join τ 1 + τ 2 = ( Q 1 + Q 2 , L 1 + L 2 ) of τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) , defined as
 (i) 
( μ Q 1 + μ Q 2 ) ( x ) e i ( α Q 1 + α Q 2 ) ( x ) =( μ Q 1 μ Q 2 ) ( x ) e i ( α Q 1 α Q 2 ) ( x ) ,
 (ii) 
( μ L 1 + μ L 2 ) ( x y ) e i ( α L 1 + α L 2 ) ( x y ) =( μ L 1 μ L 2 ) ( x y ) e i ( α L 1 α L 2 ) ( x y ) ,
 (iii) 
( μ L 1 + μ L 2 ) ( x y ) e i ( α L 1 + α L 2 ) ( x y ) = min { μ Q 1 ( x ) , μ Q 2 ( y ) } e i   min { α Q 1 ( x ) , α Q 2 ( y ) } where B is the arcs set joining the nodes of A 1 and A 2 , A 1 A 2 = .
Definition 13.
The degree of a vertex x ∈ A in a CFG τ stands for d τ ( x ) , and is described as d τ ( x ) = d μ e i α ( x ) , where d μ e i α ( x ) = x , y x A μ L ( x y ) e i x , y x A α L ( x y )
Definition 14.
The total degree of a vertex x ∈ A in a CFG τ stands for t d τ ( x ) , and is described as t d τ ( x ) = t d μ e i α ( x ) , where t d μ e i α ( x ) = x , y x A μ L ( x y ) e i x , y x A α L ( x y ) + μ Q ( x ) e i α Q ( x )
Definition 15.
Let τ 1 and τ 2 be two CFGs. For any vertex x A 1 A 2 , there are three cases to consider.
 Case 1: 
Either x A 1 A 2 or x A 2 A 1 . Then no arc incident at x lies in B 1 B 2 . Thus, for c C 1 C 2 ,
( d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 μ L 1 ( x y ) e i x y B 1 α L 1 ( x y ) = ( d μ e i α ) G 1 ( x )
( t d μ e i α ) τ 1 τ 2 ( x ) = ( t d μ e i α ) G 1 ( x ) . For x A 2 A 1 .
( d μ e i α ) τ 1 τ 2 ( x ) = x y B 2 μ L 2 ( x y ) e i x y B 2 α L 2 ( x y ) = ( d μ e i α ) G 2 ( x )
( t d μ e i α ) τ 1 τ 2 ( x ) = ( t d μ e i α ) G 2 ( x ) .
 Case 2: 
x A 1 A 2 but no arc incident at x lies in B 1 B 2 . Then any arc incident at x is either B 1 B 2 or B 2 B 1 .
( d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 B 2 ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( x y )
( d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 μ L 1 e i α L 1 ( x y ) + x y B 2 μ L 2 e i α L 2 ( x y )
( d μ e i α ) τ 1 τ 2 ( x ) = ( d μ e i α ) G 1 ( x ) + ( d μ e i α ) G 2 ( x )
( t d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 B 2 ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( x y ) + max { μ Q 1 e i α Q 1 ( x ) , μ Q 2 e i α Q 2 ( x ) }
( t d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 μ L 1 e i α L 1 ( x y ) + x y B 2 μ L 2 e i α L 2 ( x y ) + max { μ Q 1 e i α Q 1 ( x ) , μ Q 2 e i α Q 2 ( x ) }
( t d μ e i α ) τ 1 τ 2 ( x ) = ( d μ e i α ) G 1 ( x ) + ( d μ e i α ) G 2 ( x ) + max { μ Q 1 e i α Q 1 ( x ) , μ Q 2 e i α Q 2 ( x ) }
( t d μ e i α ) τ 1 τ 2 ( x ) = ( t d μ e i α ) G 1 ( x ) + ( t d μ e i α ) G 2 ( x ) min { μ Q 1 e i α Q 1 ( x ) , μ Q 2 e i α Q 2 ( x ) }
 Case 3: 
( d μ e i α ) τ 1 τ 2 ( x ) = x y B 1 B 2 ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( x y ) = x y B 1 B 2 μ L 1 e i α L 1 ( x y ) + x y B 2 B 1 μ L 2 e i α L 2 ( x y ) + x y B 1 B 2 max { μ L 1 e i α L 1 ( x y ) , μ L 2 e i α L 2 ( x y ) } = x y B 1 B 2 μ L 1 e i α L 1 ( x y ) + x y B 2 B 1 μ L 2 e i α L 1 ( x y ) + x y B 1 B 2 max { μ L 1 e i α L 1 ( x y ) , μ L 2 e i α L 2 ( x y ) } + x y B 1 B 2 min { μ L 1 ( x y ) , μ L 2 ( x y ) } e i min { α L 1 ( x y ) , α L 2 ( x y ) } x y B 1 B 2 min { μ L 1 e i α L 1 ( x y ) , μ L 2 e i α L 2 ( x y ) } = x y B 1 μ L 1 e i α L 1 ( x y ) + x y B 2 μ L 2 e i α L 1 ( x y ) x y B 1 B 2 min { μ L 1 e i α L 1 ( x y ) , μ L 2 e i α L 2 ( x y ) } = ( d μ e i α ) τ 1 ( x ) + ( d μ e i α ) τ 2 ( x ) x y B 1 B 2 min { μ L 1 e i α L 1 ( x y ) , μ L 2 e i α L 2 ( x y ) }
In addition,
( td ¯ e i ff ) ø 1 ø 2 ( x ) = ( t d μ e i α ) τ 1 ( x ) + ( t d μ e i α ) τ 2 ( x ) x y B 1 B 2 min { μ L 1 ( x y ) , μ L 2 ( x y ) } e i   min { α L 1 ( x y ) , α L 2 ( x y ) } min { μ Q 1 ( x ) , μ Q 2 ( x ) } e i   min { α Q 1 ( x ) , α Q 2 ( x ) } ,
Example 4.
Suppose that τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs on A 1 = { s 1 , s 2 , s 4 } and A 2 = { s 1 , s 2 , s 3 , s 4 } , respectively, as shown in Figure 4 and Figure 5.
Moreover, τ 1 τ 2 is shown in Figure 6.
If s 3 A 2 A 1 , then
( d μ e i α ) τ 1 τ 2 ( s 3 ) = ( d μ e i α ) τ 2 ( s 3 ) = 0.3 e 0.2 π i
Therefore, ( d τ 1 τ 2 ( s 3 ) = d τ 2 ( s 3 ) = 0.3 e 0.2 π i
( t d μ e i α ) τ 1 τ 2 ( s 3 ) = ( t d μ e i α ) τ 2 ( s 3 ) = 0.6 e 0.3 π i
Therefore, ( t d τ 1 τ 2 ( s 3 ) = t d τ 2 ( s 3 ) = 0.6 e 0.3 π i )
Since s 4 A 1 A 2 but there is no edge incident at s 4 lies in B 1 B 2 ,
( d μ e i α ) τ 1 τ 2 ( s 4 ) = ( d μ e i α ) τ 1 ( s 4 ) + ( d μ e i α ) τ 2 ( s 4 ) = 0.4 e 0.5 π i
Therefore, ( d τ 1 τ 2 ( s 4 ) = d τ 1 ( s 4 ) + d τ 2 ( s 4 ) = ( 0.4 e 0.5 π i )
( t d μ e i α ) τ 1 τ 2 ( s 4 ) = ( t d μ e i α ) τ 1 ( s 4 ) + ( t d μ e i α ) τ 2 ( s 4 ) + max { μ Q 1 ( s 4 ) , μ Q 2 ( s 4 ) } e max { α Q 1 ( s 4 ) , α Q 2 ( s 4 ) } i
= 0.7 e 0.8 π i
Since s 2 A 1 A 2 and s 1 s 2 B 1 B 2 ,
( d μ e i α ) τ 1 τ 2 ( s 2 ) = ( d μ e i α ) τ 1 ( s 2 ) + ( d μ e i α ) τ 2 ( s 2 ) min { μ L 1 ( s 1 s 2 ) , μ L 2 ( s 1 s 2 ) } e min { α L 1 ( s 1 s 2 ) , α L 2 ( s 1 s 2 ) } i = 0.5 e 0.5 π i
Therefore, ( d τ 1 τ 2 ( s 2 ) = 0.5 e 0.5 π i
( t d μ e i α ) τ 1 τ 2 ( s 2 ) = ( t d μ e i α ) τ 1 ( s 2 ) + ( t d μ e i α ) τ 2 ( s 2 ) min { μ L 1 ( s 1 s 2 ) , μ L 2 ( s 1 s 2 ) } e min { α L 1 ( s 1 s 2 ) , α L 2 ( s 1 s 2 ) } i
+ max { μ Q 1 ( s 2 ) , μ Q 2 ( s 2 ) } e max { α Q 1 ( s 2 ) , α Q 2 ( s 2 ) } i = 0.7 e 0.8 π i
Therefore, ( t d τ 1 τ 2 ( s 2 ) = 0.7 e 0.8 π i
Definition 16.
Maximal product τ 1 τ 2 = ( Q 1 Q 2 , L 1 L 2 ) of two CFGs τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) is defined as
 (i) 
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( u 1 , u 2 ) ) = { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } ( u 1 , u 2 ) ( V 1 × V 2 ) ,
 (ii) 
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( m , u 2 ) ( m , w 2 ) ) = { μ Q 1 e i α Q 1 ( m ) , μ L 2 e i α L 2 ( u 2 w 2 ) } m V 1 a n d u 2 w 2 E 2 ,
 (iii) 
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( u 1 , z ) ( w 1 , z ) ) = { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) } z V 2 a n d u 1 w 1 E 1 .
Example 5.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs, shown in Figure 7 and Figure 8. Their maximal product τ 1 τ 2 is shown in Figure 9.
For vertex (e,a), we find membership value (Mv) as follows:
( μ e Q 1 i α μ Q 2 e i α Q 2 ) ( ( e , a ) ) = { μ Q 1 e i α Q 1 ( e ) , μ Q 2 e i α Q 2 ( a ) } = { 0.1 , 0.2 } e i { 0.1 , 0.2 } = 0.2 e i 0.2 π ,
for e V 1 and a V 2 .
For edge (e,a)(e,b), we find Mv.
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( e , a ) ( e , b ) ) = { μ Q 1 e i α Q 1 ( e ) , μ L 2 e i α L 2 ( a b ) } = { 0.1 , 0.1 } e i { 0.1 , 0.1 } π = 0.1 e i { 0.1 , 0.1 } π .
for e V 1 and a b E 2 .
For edge ( e , a ) ( f , a ) :
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( e , a ) ( f , a ) ) = { μ L 1 e i α L 1 ( e f ) , μ Q 2 e i α Q 2 ( a ) } = { 0.1 , 0.2 } e i { 0.1 , 0.2 } π = 0.2 e i 0.2 π .
for a V 2 and e f E 1 . Similarly, Mv for all others nodes and edges can be calculated.
Proposition 1.
Maximal product of two CFGs τ 1 and τ 2 , is a CFG.
Proof. 
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs on crisp graphs
G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively and ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) E 1 × E 2 .
(i)
if u 1 = w 1 = m
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( m , u 2 ) ( m , w 2 ) ) = { μ Q 1 e i α Q 1 ( m ) , μ L 2 e i α L 2 ( u 2 w 2 ) } { μ Q 1 e i α Q 1 ( m ) , { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } } = { { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( u 2 ) } , { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( w 2 ) } } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , u 2 ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , w 2 ) } .
(ii)
if u 2 = w 2 = z
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , z ) ( w 1 , z ) ) = { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) } { { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) } = { { μ L 1 e i α L 1 ( u 1 ) , μ Q 2 e i α Q 2 ( z ) } , { { μ Q 1 e i α Q 1 ( w 1 ) , μ Q 2 e i α Q 2 ( z ) } } } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( u 1 , z ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( w 1 , z ) } .
We conclude that τ 1 τ 2 is a CFG. □
Theorem 2.
Maximal product of two strong CFGs τ 1 and τ 2 is a strong CFG.
Proof. 
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two strong CFGs on two crisp graphs and ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) E 1 × E 2 .
(i)
if u 1 = w 1 = m
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( m , u 2 ) ( m , w 2 ) ) = { μ Q 1 e i α Q 1 ( m ) , μ L 2 e i α L 2 ( u 2 w 2 ) } = { μ Q 1 e i α Q 1 ( m ) , { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } } = { { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( u 2 ) } , { { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( w 2 ) } } } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , u 2 ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , w 2 ) } .
(ii)
if u 2 = w 2 = z
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , z ) ( w 1 , z ) ) = { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) } = { { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) } = { { μ L 1 e i α L 1 ( u 1 ) , μ Q 2 e i α Q 2 ( z ) } , { { μ Q 1 e i α Q 1 ( w 1 ) , μ Q 2 e i α Q 2 ( z ) } } } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( u 1 , z ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( w 1 , z ) } .
Hence, τ 1 τ 2 is a strong CFG. □
Example 6.
Suppose τ 1 and τ 2 are two strong CFGs as shown in Figure 10.
Hence G 1 G 2 is also a strong CFG.
Remark 1.
If maximal product of two CFGs τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) is a strong, then τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) not necessary to be strong, in general.
Example 7.
Suppose τ 1 and τ 2 are two CFGs as in Figure 11 and Figure 12. We can see that the maximal product of two CFGs τ 1 and τ 2 , that is τ 1 τ 2 in Figure 13.
Then τ 1 and τ 1 τ 2 are strong CFGs, but τ 2 is not strong. Since μ L 2 e i α L 2 ( u 2 , w 2 ) = 0.2 e i 0.2 π , on other hand { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } = { 0.2 e i 0.2 π , 0.1 e i 0.1 π } = 0.1 e i 0.1 π .
Hence μ L 2 e i μ L 2 ( u 2 , w 2 ) { μ Q 2 e i μ Q 2 ( u 2 ) , μ Q 2 e i μ Q 2 ( w 2 ) } .
Remark 2.
The maximal product of two complete CFGs may or may not be a complete CFG because ( u 1 , u 2 ) E 1 and ( w 1 , w 2 ) E 2 do not exist in the definition of the maximal product of two CFGs.
Definition 17.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs. ( u 1 , u 2 ) V 1 × V 2
( d μ e α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) }
Theorem 3.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs. If μ Q 1 e i α Q 1 μ L 2 e i α L 2 , and μ Q 2 e i α Q 2 μ L 1 e i α L 1 . Then for every ( u 1 , u 2 ) V 1 × V 2
( d μ ) e τ 1 τ 2 i α ( u 1 , u 2 ) = ( d ) G 2 ( u 2 ) μ Q 1 e i α Q 1 ( u 1 ) + ( d ) G 1 ( u 1 ) μ Q 2 e i α Q 2 ( u 2 )
Proof. 
( d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i _ α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = u 2 w 2 E 2 , u 1 = w 1 μ L 2 e i α L 2 ( u 2 w 2 ) + u 1 w 1 E 1 , u 2 = w 2 μ L 1 e i α L 1 ( u 1 w 1 ) = ( d ) G 2 ( u 2 ) μ Q 1 e i α Q 1 + ( d ) G 1 ( u 1 ) μ Q 2 e i α Q 2
Example 8.
Take the CFGs τ 1 , τ 2 , and τ 1 τ 2 as in Figure 14. Since μ Q 1 μ L 2 , α Q 1 α L 2 , μ Q 2 μ L 1 , α Q 2 α L 1 , by Theorem 3.8, we have the following.
( d μ e i α ) G 1 G 2 ( a , d ) = ( d ) G 2 ( d ) μ Q 1 e i α Q 1 ( a ) + ( d ) G 1 ( a ) μ Q 2 e i α Q 2 ( d ) = 1 · ( 0.3 e i 0.3 π ) + 1 · ( 0.3 e i 0.3 π ) = 0.6 e i 0.6 π ,
By direct calculations:
( d μ e G 1 G 2 i α ( b , d ) ) = 0.2 e i 0.2 π + 0.3 e i 0.3 π = 0.5 e i 0.5 π , ( d μ e G 1 G 2 i α ( a , c ) ) = 0.5 e i 0.5 π , ( d μ e G 1 G 2 i α ( a , d ) ) = 0.6 e i 0.6 π , ( d μ e G 1 G 2 i α ( b , c ) ) = 0.4 e i 0.4 π ,
We conclude from the above calculations that ”the degrees of nodes determined by using the formula of the above theorem and by the directed method are equal”.
Definition 18.
Let τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) be two CFGs. ( u 1 , u 2 ) V 1 × V 2
( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) + ( α Q 1 α Q 2 ( u 1 , u 2 ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } e i { α Q 1 ( u 1 ) , α Q 2 ( u 2 ) } ,
Theorem 4.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs. If μ Q 1 μ L 2 , α Q 1 α L 2 and μ Q 2 μ L 1 , α Q 2 α L 1 . Then for every ( u 1 , u 2 ) V 1 × V 2
( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( d ) G 2 ( u 2 ) μ e Q 1 i α ( u 1 ) + ( d ) G 1 ( u 1 ) μ Q 2 e i α Q 2 ( u 2 ) + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) }
Proof. 
( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) + ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 1 ) ( u 1 , u 2 ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 ( u 1 w 1 ) , μ Q 2 ( u 2 ) } e i u 1 w 1 E 1 , u 2 = w 2 { α L 1 ( u 1 w 1 ) , α Q 2 ( u 2 ) } + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = u 2 w 2 E 2 , u 1 = w 1 μ L 2 e i α L 2 ( u 2 w 2 ) + u 1 w 1 E 1 , u 2 = w 2 μ L 1 e i α L 1 ( u 1 w 1 ) + max { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = ( d ) G 2 ( u 2 ) μ Q 1 e i α Q 1 ( u 1 ) + ( d ) G 1 ( u 1 ) μ Q 2 e i α Q 2 ( u 2 ) + m a x { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) }
Example 9.
Let τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) be two CFGs. If μ Q 1 e i α Q 1 μ L 2 e i α L 2 and μ Q 2 e i α Q 2 μ L 1 e i α L 1 .
In Example 9, we calculate total degree of nodes of τ 1 τ 2 by using Figure 7, Figure 8 and Figure 9. We calculate the total degree of nodes in the maximal product. Choose node (e,a).
( t d μ e i α ) τ 1 τ 2 ( e , a ) = ( d ) G 2 ( e ) μ Q 1 e i α Q 1 ( a ) + ( d ) G 1 ( a ) μ Q 2 e i α Q 2 ( e ) + { μ Q 1 e i α Q 1 ( e ) , μ Q 2 e i α Q 2 ( a ) } = 1 ( 0.1 e i 0.1 π ) + 3 ( 0.2 e i 0.2 π ) + ( 0.2 , 0.1 ) e i ( 0.2 , 0.1 ) π = ( 0.1 + 0.6 + 0.2 ) e i ( 0.1 + 0.6 + 0.2 ) π = 0.9 e i 0.9 π
Similarly, we can calculate it for other nodes.
Definition 19.
Symmetric difference τ 1 τ 2 = ( Q 1 Q 2 , L 1 L 2 ) of two CFGs τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) is defined as
 (i) 
( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( ( u 1 , u 2 ) ) = { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) }
( u 1 , u 2 ) ( V 1 × V 2 )
 (ii) 
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( m , u 2 ) ( m , w 2 ) ) = { μ Q 1 e i α Q 1 ( m ) , μ L 2 e i α L 2 ( u 2 w 2 ) }
m V 1 a n d u 2 w 2 E 2
 (iii) 
( μ L 1 e i α L 1 μ L 2 ) e i α L 1 ( ( u 1 , z ) ( w 1 , z ) ) = { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( z ) }
z V 2 a n d u 1 w 1 E 1
(iv)
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } f o r a l l u 1 w 1 E 1 a n d u 2 w 2 E 2 o r = { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) , μ L 1 e i α L 1 ( u 1 w 1 ) } f o r a l l u 1 w 1 E 1 a n d u 2 w 2 E 2
Example 10.
Take τ 1 and τ 2 as CFGs as shown in Figure 15 and Figure 16. We can see the symmetric difference of two CFGs τ 1 and τ 2 , that is τ 1 τ 2 in Figure 17.
For node ( a , f ) , we calculate Mv, IDv and NMv as follows:
( μ Q 1 μ Q 2 ) ( ( a , f ) ) e i ( α Q 1 α Q 2 ) ( ( a , f ) ) = { μ Q 1 ( a ) , μ Q 2 ( f ) } e i { α Q 1 ( a ) , α Q 2 ( f ) } = { 0.2 , 0.4 } e i { 0.2 , 0.4 } π = 0.2 e i 0.2 π ,
for a V 1 and f V 2 .
For arc/edge ( a , d ) ( a , e ) , we calculate the Mv.
( μ L 1 e i α L 1 ) ( μ L 2 e i α L 2 ) ( ( a , d ) ( a , e ) ) = { μ Q 1 e i α Q 1 ( a ) , μ L 2 e i α L 2 ( d e ) } = { 0.2 , 0.2 } e i { 0.2 , 0.2 } π = 0.2 e i 0.2 π ,
for a V 1 and d e E 2 .
Now, for edge ( a , d ) ( b , d ) we have
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( a , d ) ( b , d ) ) = { μ L 1 e i α L 1 ( a b ) , μ Q 2 e i α Q 2 ( d ) } = { 0.2 , 0.2 } e i { 0.2 , 0.2 } = 0.2 e i 0.2 π .
for a b E 1 and d V 2 .
We can calculate Mv for all other nodes and edges.
Proposition 2.
Symmetric difference of two CFGs τ 1 and τ 2 is a CFG.
Proof. 
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) are two CFGs on two crisp graphs and ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) E 1 × E 2 .
(i)
If u 1 = w 1 = m
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( m , u 2 ) ( m , w 2 ) ) = { μ Q 1 e i α Q 1 ( m ) , μ L 2 e i α L 2 ( u 2 w 2 ) } { μ Q 1 e i α Q 1 ( m ) , min { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } } = { { { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( u 2 ) } , { { μ Q 1 e i α Q 1 ( m ) , μ Q 2 e i α Q 2 ( w 2 ) } } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , u 2 ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( m , w 2 ) } .
(ii)
If u 2 = w 2 = z
( μ L 1 e i α L 1 μ L 2 e i α L 2 e i ( α L 1 α L 2 ) ) ( ( u 1 , z ) ( w 1 , z ) ) = { μ L 1 e i α L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 e i α Q 2 ( z ) } { { μ L 1 e i α L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 e i α Q 2 ( z ) } = { { { μ Q 1 e i α Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 e i α Q 2 ( z ) } , { { μ Q 1 e i α Q 1 e i α Q 1 ( w 1 ) , μ Q 2 e i α Q 2 e i α Q 2 ( z ) } } = { ( μ Q 1 e i α Q 1 e i α Q 1 μ Q 2 e i α Q 2 e i α Q 2 ) ( u 1 , z ) , ( μ Q 1 e i α Q 1 e i α Q 1 μ Q 2 e i α Q 2 e i α Q 2 ) ( w 1 , z ) } .
(iii)
If u 1 w 1 E 1   a n d   u 2 w 2 E 2
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , min { μ Q 2 e i α Q 2 ( u 2 ) μ Q 2 e i α Q 2 ( w 2 ) } } = { { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } , { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( w 2 ) } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( u 1 , u 2 ) , ( μ Q 1 e i α Q 1 μ Q 2 ) e i α Q 1 ( w 1 , w 2 ) } .
(iv)
If u 1 w 1 E 1 a n d u 2 w 2 E 2
( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) , μ L 1 e i α L 1 ( u 1 w 1 ) } { μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) , { μ Q 1 e i α Q 1 ( u 1 ) μ Q 1 e i α Q 1 ( w 1 ) } } = { { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } , { μ Q 1 e i α Q 1 ( w 1 ) , μ Q 2 e i α Q 2 ( w 2 ) } = { ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( u 1 , u 2 ) , ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( w 1 , w 2 ) } .
Hence, τ 1 τ 2 is a CFG. □
Definition 20.
Suppose G 1 = ( Q 1 , L 1 ) and G 2 = ( Q 2 , L 2 ) are two CFGs. For any node ( u 1 , u 2 ) V 1 × V 2 , we have
( d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 , μ Q 2 e i α Q 2 ( u 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } ,
Theorem 5.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , Y 2 ) are two CFGs. If μ Q 1 e i α Q 1 μ L 2 e i α L 2 and μ Q 2 e i α Q 2 μ L 1 e i α L 1 . Then ( u 1 , u 2 ) V 1 × V 2
( d ) τ 1 τ 2 ( u 1 , u 2 ) = q ( d ) τ 1 ( u 1 ) + s ( d ) τ 2 ( u 2 ) where s= V 1 ( d ) G 1 ( u 1 ) and q= V 2 ( d ) G 2 ( u 2 ) .
Proof. 
( d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } = u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) + u 1 w 1 E 1 μ L 1 e i α L 1 ( u 1 w 1 ) + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 1 e i α L 1 ( u 1 w 1 ) = q ( d μ ) τ 1 ( u 1 ) + s ( d μ ) τ 2 ( u 2 ) ,
We conclude that ( d ) τ 1 τ 2 ( u 1 , u 2 ) = q ( d ) τ 1 ( u 1 ) + s ( d ) τ 2 ( u 2 ) , where s = V 1 ( d ) G 1 ( u 1 ) and q = V 2 ( d ) G 2 ( u 2 ) . □
Example 11.
In Figure 18, μ Q 1 μ L 2 , ψ Q 1 ψ L 2 , μ Q 2 μ L 1 , and ψ Q 2 ψ L 1 . Then, the total degree of vertex in the symmetric difference is calculated by using the following formula:
( d μ e i α ) G 1 G 2 ( m 1 , m 2 ) = q ( d T ) G 1 ( m 1 ) + s ( d T ) G 2 ( m 2 ) ,
( d μ e i α ) G 1 G 2 ( a , c ) = 1 · ( 0.2 e i 0.2 π ) + 1 · ( 0.2 e i 0.2 π ) = 0.4 e i 0.4 π , ( d μ e i α ) G 1 G 2 ( a , d ) = 1 · ( 0.2 e i 0.2 π ) + 1 · ( 0.2 e i 0.2 π ) = 0.4 e i 0.4 π ,
So, ( d ) G 1 G 2 ( a , c ) = 0.4 e i 0.4 π and ( d ) G 1 G 2 ( a , d ) = 0.4 e i 0.4 π . Applying the same technique, we can obtain ( d ) G 1 G 2 ( b , c ) = ( d ) G 1 G 2 ( b , d ) = ( 0.4 , 0.9 , 0.9 ) . Now by direct calculations we have:
( d μ e i α ) G 1 G 2 ( a , c ) = 0.2 e i 0.2 π + 0.2 e i 0.2 π = 0.4 e i 0.4 π , ( d μ e i α ) G 1 G 2 ( a , d ) = 0.2 e i 0.2 π + 0.2 e i 0.2 π = 0.4 e i 0.4 π , ( d μ e i α ) G 1 G 2 ( b , c ) = 0.2 e i 0.2 π + 0.2 e i 0.2 π = 0.4 e i 0.4 π , ( d μ e i α ) G 1 G 2 ( b , d ) = 0.2 e i 0.2 π + 0.2 e i 0.2 π = 0.4 e i 0.4 π .
It is obvious from the above calculations that the degrees of nodes determined by using the formula of the above theorem and by the direct method are equal.
Definition 21.
Let τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , L 2 ) be two CFGs. For any vertex ( u 1 , u 2 ) V 1 × V 2 , we have
( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) + ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ( u 1 , u 2 ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 , μ Q 2 e i α Q 2 ( u 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } ,
Theorem 6.
Suppose τ 1 = ( Q 1 , L 1 ) and τ 2 = ( Q 2 , Y 2 ) are two CFGs. If
  • μ Q 1 μ L 2 a n d μ Q 2 μ L 1 then ( u 1 , u 2 ) V 1 × V 2
    ( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = q ( t d μ e i α ) τ 1 ( u 1 ) + s ( t d μ e i o α ) τ 2 ( u 2 ) ( q 1 ) μ e i α τ 1 ( u 1 ) { μ e i α τ 1 ( u 1 ) , μ e i α τ 1 ( u 1 ) }
    ( u 1 , u 2 ) V 1 × V 2 , s= V 1 ( d ) G 1 ( u 1 ) and q= V 2 ( d ) G 2 ( u 2 ) .
Proof. 
( u 1 , u 2 ) V 1 × V 2
( t d μ e i α ) τ 1 τ 2 ( u 1 , u 2 ) = ( u 1 , u 2 ) ( w 1 , w 2 ) E 1 × E 2 . ( μ L 1 e i α L 1 μ L 2 e i α L 2 ) ( ( u 1 , u 2 ) ( w 1 , w 2 ) ) + ( μ Q 1 e i α Q 1 μ Q 2 e i α Q 2 ) ( u 1 , u 2 ) = u 1 = w 1 , u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 , u 2 = w 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 1 e i α Q 1 ( w 1 ) , μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 { μ L 1 e i α L 1 ( u 1 w 1 ) , μ Q 2 e i α Q 2 ( u 2 ) , μ Q 2 e i α Q 2 ( w 2 ) } + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) + u 1 w 1 E 1 μ L 1 e i α L 1 ( u 1 w 1 ) + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 1 e i α L 1 ( u 1 w 1 ) + { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) + u 1 w 1 E 1 μ L 1 e i α L 1 ( u 1 w 1 ) + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 2 e i α L 2 ( u 2 w 2 ) } + u 1 w 1 E 1 a n d u 2 w 2 E 2 μ L 1 e i α L 1 ( u 1 w 1 ) + μ Q 1 e i α Q 1 ( u 1 ) + μ Q 2 e i α Q 2 ( u 2 ) { μ Q 1 e i α Q 1 ( u 1 ) , μ Q 2 e i α Q 2 ( u 2 ) } = q ( t d μ e i α ) τ 1 ( u 1 ) + s ( t d μ e i α ) τ 2 ( u 2 ) ( q 1 ) μ e i α τ 1 ( u 1 ) { μ e i α τ 1 ( u 1 ) , μ e i α τ 1 ( u 1 ) }
where value of s and q as follows s = | V 1 | ( d ) G 1 ( u 1 ) and q = | V 2 | ( d ) G 2 ( u 2 ) . □
Example 12.
We find the total degree of nodes by using Example 10.
( d μ e i α ) τ 1 τ 2 ( a , e ) = q ( d μ ) τ 1 ( a ) + s ( d μ e i α ) τ 2 ( e )
s = V 1 ( d ) G 1 ( a ) = 2 1 = 1
Now,
q = V 2 ( d ) G 2 ( e ) = 4 2 = 2
( t d ¯ ) ø 1 ø 2 ( a , e ) = q ( t d μ e i α ) τ 1 ( a ) + s ( t d μ e i α ) τ 2 ( e ) ( s 1 ) μ e i α τ 2 ( e ) ( q 1 ) μ e i α τ 1 ( a ) { μ e i α τ 1 ( a ) , μ e i α τ 2 ( e ) } = 2 ( 0.2 e i 0.2 π + 0.2 e i 0.2 π ) + 1 ( 0.3 e i 0.3 π + 0.3 e i 0.3 π + 0.2 e i 0.2 π ) ( 1 1 ) ( 0.3 e i 0.3 π ) ( 2 1 ) ( 0.2 e i 0.2 π ) { 0.2 e i 0.2 π , 0.3 e i 0.3 π } = 2 ( 0.4 + 0.8 0.2 0.3 ) e i 0.4 + 0.8 0.2 0.3 π = 1.1 e i 1.1 π
( t d ) τ 1 τ 2 ( a , e ) = 1.1 e i 1.1 π
We conclude from the calculations that the total degrees of nodes calculated by the formula of the above theorem and by the direct method are equal.

4. Application of CFG

CFGs play a great role in fuzzy decision making and image segmentation. We presented a few factors in the application which will help in a physical way. For this, the government of Pakistan wants to construct COVID-19 Designated Tertiary Hospitals in any district that has a plan to make the minimum number of COVID-19 Designated Tertiary Hospitals in the district so that many people can benefit from this project. For this purpose, the following are some parameters taken into account: (1) a good place to build a COVID-19 Tertiary Hospital; (2) patients; (3) an urban location; (4) access to the facility; (5) security and safety; and (6) cost and efficiency. Assume that members of a team select 10 areas where they are engaged in the established COVID-19 Designated Tertiary Hospitals so that they may assist more patients for their treatment purposes. They see the following two scenarios: Constructing a COVID-19 Designated Tertiary Hospital in 1 of the 10 approved locations.
Constructing a COVID-19 Designated Tertiary Hospital between any 2 of the selected 10 places. Suppose that P = {Islamabad, Thatha, Okara, Lailpur, Sakhar, Nawabshah, Vihari, Lahore, Foortabas, Layia} is the set of locations where the team wishes to construct the COVID-19 Designated Tertiary Hospital as a node set. Assume that, after carefully analyzing the various characteristics, 80 percent of the specialists on the panel agree that Islamabad will have a COVID-19 Designated Tertiary Hospital. As a result, we can determine the term of membership. The phase term, which defines the time, must be computed for this. Twenty percent of professionals believe that Islamabad always manages a large number of patients. We will make a model of this information as 0.8 e 0.2 π i > . Hence, it is their final argument. The team now wished to travel to Thatha. Assume that 70 percent of the team’s specialists feel that Thatha will have a COVID-19 Designated Tertiary Hospital after thoroughly analyzing the various factors. As a result, we may determine the terms of the membership functions. The phase term, which defines the period, must be computed for this. According to 50 percent of professionals, Thatha led a large number of patients at one point in time. We make a model of this information as < 0.7 e 0.5 π i > . After this, they visit Okara for their valuable mission. Suppose the model information about Okara is < 0.4 e 0.3 π i > . This means that 40 percent of the population prefers this location. However, 30 percent of those polled are opposed to it. In a similar way, they go to every place and collect all the information as follows:
< L a i l p u r : 0.8 e 0.4 π i > , < S a k h a r : 0.1 e 0.5 π i > , < N a w a b s h a h : 0.2 e 0.5 π i > , < V i h a r i : 0.2 e 0.5 π i > , < L a h o r e : 0.3 e 0.6 π i > , < F o o r t a b a s : 0.5 e 0.6 π i > , < L y i a : 0.5 e 0.4 π i > . We can denote this model as
B = < I s l a m a b a d : 0.8 e 0.2 π i > < T h a t h a : 0.7 e 0.5 π i > < O k a r a : 0.3 e 0.2 π i > < L a i l p u r : 0.8 e 0.4 π i > < S a k h a r : 0.1 e 0.5 π i > < N a w a b s h a h : 0.2 e 0.5 π i > < V i h a r i : 0.2 e 0.5 π i > < L a h o r e : 0.3 e 0.6 π i > < F o o r t a b a s : 0.5 e 0.6 π i > < L y i a : 0.5 e 0.4 π i >
The complex membership of the nodes represents the positive characteristics of a specific parameter for choosing a city for the COVID-19 Designated Tertiary Hospital. Now, we have truth membership function
Islamabad = 0.8,
Thatha = 0.7,
Okara = 0.3,
Lailpur = 0.8,
Sakhar = 0.1,
Nawabshah = 0.2,
Vihari = 0.2,
Lahore = 0.3,
Foortabas = 0.5,
Lyia = 0.5,
To determine the optimal choice, we see 10 truth membership functions. The value of Islamabad and Lailpur are the same. Now we add tradition and phase terms, for Islamabad, 0.8 + 0.2 = 1 and for Lailpur, 0.8 + 0.4 = 1.2. Lailpur city is the best choice for the COVID-19 Designated Tertiary Hospital. This is the application of CFG where it has no edge between vertices. CFG with no edge is shown in Figure 19.
Take P = {Islamabad, Thatha, Okara, Lailpur, Sakhar, Nawabshah, Vihari, Lahore, Foortabas, Lyia} = { R 1 , R 2 , R 3 , R 4 , R 5 , R 6 , R 7 , R 8 , R 9 , R 10 } .
Now the team goes to look at situation two as follows: we find other edges according to the condition of the team.
F = < R 1 R 2 : 0.7 e 0.3 π i > < R 1 R 3 : 0.4 e 0.2 π i > < R 1 R 4 : 0.6 e 0.3 π i > < R 1 R 5 : 0.2 e 0.3 π i > < R 1 R 6 : 0.3 e 0.3 π i > < R 1 R 7 : 0.1 e 0.3 π i > < R 1 R 8 : 0.6 e 0.3 π i > < R 1 R 9 : 0.7 e 0.3 π i > < R 1 R 10 : 0.5 e 0.3 π i > < R 2 R 3 : 0.4 e 0.2 π i > < R 2 R 4 : 0.3 e 0.4 π i > < R 2 R 5 : 0.2 e 0.4 π i > < R 2 R 6 : 0.3 e 0.4 π i > < R 2 R 7 : 0.1 e 0.4 π i > < R 2 R 8 : 0.8 e 0.4 π i > < R 2 R 9 : 0.7 e 0.3 π i > < R 2 R 10 : 0.5 e 0.4 π i > < R 3 R 4 : 0.4 e 0.2 π i > < R 3 R 5 : 0.2 e 0.2 π i > < R 3 R 6 : 0.3 e 0.2 π i > < R 3 R 7 : 0.1 e 0.2 π i > < R 3 R 8 : 0.4 e 0.2 π i > < R 3 R 9 : 0.2 e 0.2 π i > < R 3 R 10 : 0.4 e 0.2 π i > < R 4 R 5 : 0.2 e 0.4 π i > < R 4 R 6 : 0.3 e 0.4 π i > < R 4 R 7 : 0.1 e 0.4 π i > < R 4 R 8 : 0.6 e 0.4 π i > < R 4 R 9 : 0.3 e 0.3 π i > < R 4 R 10 : 0.6 e 0.4 π i > < R 5 R 6 : 0.4 e 0.5 π i > < R 5 R 7 : 0.1 e 0.4 π i > < R 5 R 8 : 0.2 e 0.5 π i > < R 5 R 9 : 0.2 e 0.3 π i > < R 5 R 10 : 0.2 e 0.4 π i > < R 6 R 7 : 0.1 e 0.4 π i > < R 6 R 8 : 0.3 e 0.6 π i > < R 6 R 9 : 0.3 e 0.3 π i > < R 6 R 10 : 0.3 e 0.4 π i > < R 7 R 8 : 0.1 e 0.4 π i > < R 7 R 9 : 0.1 e 0.3 π i > < R 7 R 10 : 0.1 e 0.4 π i > < R 8 R 9 : 0.3 e 0.3 π i > < R 8 R 10 : 0.6 e 0.4 π i > < R 9 R 10 : 0.4 e 0.3 π i >
traditional membership values of edges are given
R 1 R 2 = 0.7 , R 1 R 3 = 0.4 , R 1 R 4 = 0.6 , R 1 R 5 = 0.2 , R 1 R 6 = 0.3 ,
R 1 R 7 = 0.1 , R 1 R 8 = 0.6 , R 1 R 9 = 0.7 , R 1 R 10 = 0.5 , R 2 R 3 = 0.4 ,
R 2 R 4 = 0.3 , R 2 R 5 = 0.2 , R 2 R 6 = 0.3 , R 2 R 7 = 0.1 , R 2 R 8 = 0.8 ,
R 2 R 9 = 0.7 , R 2 R 10 = 0.5 , R 3 R 4 = 0.4 , R 3 R 5 = 0.2 , R 3 R 6 = 0.3 ,
R 3 R 7 = 0.1 , R 3 R 8 = 0.4 , R 3 R 9 = 0.2 , R 3 R 10 = 0.4 , R 4 R 5 = 0.2 ,
R 4 R 6 = 0.3 . R 4 R 7 = 0.1 , R 4 R 8 = 0.6 , R 4 R 9 = 0.3 , R 4 R 10 = 0.6 ,
R 5 R 6 = 0.4 , R 5 R 7 = 0.1 , R 5 R 8 = 0.2 , R 5 R 9 = 0.2 , R 5 R 10 = 0.2 ,
R 6 R 7 = 0.1 , R 6 R 8 = 0.3 , R 6 R 9 = 0.3 , R 6 R 10 = 0.3 , R 7 R 8 = 0.1 ,
R 7 R 9 = 0.1 , R 7 R 10 = 0.1 , R 8 R 9 = 0.3 , R 8 R 10 = 0.6 , R 9 R 10 = 0.4
S ( R 2 R 8 ) is the largest value and therefore more suitable for making the COVID-19 Designated Tertiary Hospital. CFG with an edge is shown in Figure 20.

5. Conclusions

Complex fuzzy models have greater flexibility and comparability than fuzzy models. The CFG is a FG extension. Each vertex and edge in a complex fuzzy graphical model has only one complex membership grade. To improve the approximation, CFG can be employed. Different sorts of degrees of vertices were employed in this project. Only the overall contribution of the amplitude in the system is determined by the degree of vertices in FG. The overall information and contribution of the amplitude and phase components are given by the degree of vertices in CFG. This article looked at the communication between a few hospitals. The CFGs and their associated network systems were the exclusive focus of this study. This strategy can only be used if one-directed thinking occurs in a linked, complex fuzzy graphical system. Obtaining accurate data is not always easy. We defined the order and size of the CFG. We determined the operations on CFG, including union, intersection, and join of CFG. We discussed the degree and total degree of vertex of the CFG. Finally, we described how CFG can be used to solve decision-making problems in the COVID-19 environment. The maximal product and symmetric difference of CFG are discussed. In the future, our aim is to introduce (1) bipolar-CFG and (2) rejection of CFG.

Author Contributions

Conceptualization, M.S., W.M., Q.X. and F.T.; methodology, M.S., W.M., Q.X. and F.T.; validation, M.S., W.M. and F.T.; formal analysis, M.S., W.M. and F.T.; investigation, M.S., W.M., Q.X. and F.T.; data curation, M.S., W.M., Q.X. and F.T.; writing—original draft preparation, M.S. and W.M.; writing—review and editing, M.S., W.M., Q.X. and F.T.; visualization, M.S., W.M., Q.X., and F.T.; supervision, M.S. and W.M.; project administration, M.S., W.M., Q.X. and F.T.; funding acquisition, F.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the researchers, Supporting Project Number (RSP-2021/401), King Saud University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Rosenfeld, A. Fuzzy groups. J. Math. Anal. Appl. 1971, 35, 512–517. [Google Scholar] [CrossRef] [Green Version]
  3. Ghorai, G.; Pal, M. Faces and dual of m-polar fuzzy planar graphs. J. Intell. Fuzzy Syst. 2016, 31, 2043–2049. [Google Scholar] [CrossRef]
  4. Ghorai, G.; Pal, M. On degrees of m-polar fuzzy graph with application. J. Uncertain Syst. 2017, 11, 294–305. [Google Scholar]
  5. Gani, N.; Radha, K. On regular fuzzy graphs. J. Phys. Sci. 2008, 12, 33–44. [Google Scholar]
  6. Bhattacharya, P. Some remarks on fuzzy graphs. Pattern Recognit. Lett. 1983, 6, 297–302. [Google Scholar] [CrossRef]
  7. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  8. Shao, Z.; Kosari, S.; Rashmanlou, H.; Shoaib, M. New Concepts in Intuitionistic Fuzzy Graph with Application in Water Supplier Systems. Mathematics 2020, 8, 1241. [Google Scholar] [CrossRef]
  9. Rashmanlou, H.; Pal, M.; Samanta, S.; Borzooei, R.A. Product of bipolar fuzzy graphs and their degree. Int. J. Gen. Syst. 2016, 45, 1–14. [Google Scholar] [CrossRef]
  10. Rashmanlou, H.; Samanta, S.; Pal, M.; Borzooei, R.A. A study on bipolar fuzzy graphs. J. Intell. Fuzzy Syst. 2015, 28, 571–580. [Google Scholar] [CrossRef]
  11. Rashmanlou, H.; Pal, M. Some properties of highly irregular interval-valued fuzzy graphs. World Appl. Sci. J. 2013, 27, 1756–1773. [Google Scholar]
  12. Zeng, S.; Shoaib, M.; Ali, S.; Smarandache, F.; Rashmanlou, H.; Mofidnakhaei, F. Certain Properties of Single-Valued Neutrosophic graph with Application in Food and Agriculture Organization. Int. J. Comput. Intell. Syst. 2021, 14, 1516–1540. [Google Scholar] [CrossRef]
  13. Shao, Z.; Kosari, S.; Shoaib, M.; Rashmanlou, H. Certain Concepts of Vague Graphs With Applications to Medical Diagnosis. Font. Phys. 2020, 8, 357. [Google Scholar] [CrossRef]
  14. Remot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  15. Buckley, J.J. Fuzzy complex numbers. Fuzzy Sets Syst. 1989, 33, 333–345. [Google Scholar] [CrossRef]
  16. Yaqoob, N.; Akram, M. Complex Neutrosophic graph. Bull. Comput. Appl. Math. 2018, 6, 2224–8659. [Google Scholar]
  17. Shoaib, M.; Kosari, S.; Rashmanlou, H.; Malik, M.A.; Rao, Y.; Talebi, Y.; Mofidnakhaei, F. Notion of Complex Pythagorean Fuzzy Graph with Properties and Application. J. Multi-Valued Logic Soft Comput. 2020, 34, 553–586. [Google Scholar]
  18. Shoaib, M.; Mahmood, W.; Xin, Q.; Tchier, F. Certain Operations on Picture Fuzzy Graph with Applicatioin. Symmetry 2021, 13, 2400. [Google Scholar] [CrossRef]
  19. Gulzar, M.; Abbas, G.; Dilawar, F. Algebraic Properties of w-Q-fuzzy subgroups. Int. J. Math. Comput. Sci. 2020, 15, 265–274. [Google Scholar]
  20. Gulzar, M.; Alghazzawi, M.H.; Mateen, D.; Kausar, N. A Certain Class of t-intuitionistic Fuzzy Subgroup. IEEE Access 2020, 8, 163260–163268. [Google Scholar] [CrossRef]
  21. Gulzar, M.; Mateen, M.H.; Alghazzawi, D.; Kausar, N. A novel applicatioin of complex intutionistic fuzzy sets in group theory. IEEE Access 2020, 8, 196075–196085. [Google Scholar] [CrossRef]
  22. Zeng, S.; Shoaib, M.; Ali, S.; Abbas, Q.; Nadeem, M.S. Complex Vague Graphs and Their Application in Decision-Making Problems. IEEE Access 2020, 8, 174094–174104. [Google Scholar] [CrossRef]
Figure 1. CFG.
Figure 1. CFG.
Symmetry 14 01126 g001
Figure 2. CFG1.
Figure 2. CFG1.
Symmetry 14 01126 g002
Figure 3. Complement of CFG.
Figure 3. Complement of CFG.
Symmetry 14 01126 g003
Figure 4. τ 1 .
Figure 4. τ 1 .
Symmetry 14 01126 g004
Figure 5. τ 2 .
Figure 5. τ 2 .
Symmetry 14 01126 g005
Figure 6. τ 1 U τ 2 .
Figure 6. τ 1 U τ 2 .
Symmetry 14 01126 g006
Figure 7. τ 1 .
Figure 7. τ 1 .
Symmetry 14 01126 g007
Figure 8. τ 2 .
Figure 8. τ 2 .
Symmetry 14 01126 g008
Figure 9. τ 1 τ 2 .
Figure 9. τ 1 τ 2 .
Symmetry 14 01126 g009
Figure 10. CFGs.
Figure 10. CFGs.
Symmetry 14 01126 g010
Figure 11. τ 1 .
Figure 11. τ 1 .
Symmetry 14 01126 g011
Figure 12. τ 2 .
Figure 12. τ 2 .
Symmetry 14 01126 g012
Figure 13. τ 1 τ 2 .
Figure 13. τ 1 τ 2 .
Symmetry 14 01126 g013
Figure 14. CFG3.
Figure 14. CFG3.
Symmetry 14 01126 g014
Figure 15. τ 1 .
Figure 15. τ 1 .
Symmetry 14 01126 g015
Figure 16. τ 2 .
Figure 16. τ 2 .
Symmetry 14 01126 g016
Figure 17. τ 1 τ 2 .
Figure 17. τ 1 τ 2 .
Symmetry 14 01126 g017
Figure 18. Symmetric difference.
Figure 18. Symmetric difference.
Symmetry 14 01126 g018
Figure 19. CFG with no edge.
Figure 19. CFG with no edge.
Symmetry 14 01126 g019
Figure 20. CFG with edge.
Figure 20. CFG with edge.
Symmetry 14 01126 g020
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shoaib, M.; Mahmood, W.; Xin, Q.; Tchier, F. Maximal Product and Symmetric Difference of Complex Fuzzy Graph with Application. Symmetry 2022, 14, 1126. https://doi.org/10.3390/sym14061126

AMA Style

Shoaib M, Mahmood W, Xin Q, Tchier F. Maximal Product and Symmetric Difference of Complex Fuzzy Graph with Application. Symmetry. 2022; 14(6):1126. https://doi.org/10.3390/sym14061126

Chicago/Turabian Style

Shoaib, Muhammad, Waqas Mahmood, Qin Xin, and Fairouz Tchier. 2022. "Maximal Product and Symmetric Difference of Complex Fuzzy Graph with Application" Symmetry 14, no. 6: 1126. https://doi.org/10.3390/sym14061126

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop