Next Article in Journal
Diffusion Dynamics and Impact of Noise on a Discrete-Time Ratio-Dependent Model: An Analytical and Numerical Approach
Previous Article in Journal
Meshless Local Petrov–Galerkin Formulation of Inverse Stefan Problem via Moving Least Squares Approximation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Decision Making Approach under Pythagorean Dombi Fuzzy Graphs for Selection of Leading Textile Industry

1
Department of Mathematics, University of the Punjab, New Campus, Lahore 4590, Pakistan
2
Department of Mathematics, University of Education, Bank Road Campus, Lahore, Pakistan
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2019, 24(4), 102; https://doi.org/10.3390/mca24040102
Submission received: 17 November 2019 / Revised: 8 December 2019 / Accepted: 12 December 2019 / Published: 13 December 2019

Abstract

:
Graphs play a pivotal role in structuring real-world scenarios such as network security and expert systems. Numerous extensions of graph theoretical conceptions have been established for modeling uncertainty in graphical network situations. The Pythagorean Dombi fuzzy graph (PDFG), a generalization of the fuzzy Dombi graph (FDG), is very useful in representing vague relations between several objects, whereas the operational parameter has a flexible nature in decision-making problems. The main objective of this research study is to expand the area of discussion on PDFGs by establishing fruitful results and notions related to operations such as the direct product, Cartesian product, semi-strong product, strong product, and composition on PDFGs. Certain concepts, including the degree of vertices and total degree, are discussed as its modifications. Meanwhile, these outcomes are considered on PDFGs maintaining the strongness property. At the end, an algorithm for Pythagorean Dombi fuzzy multi-criteria decision-making is given, and a numerical example based on the selection of a leading textile industry is put forward to clarify the suitability of the proposed approach.

1. Introduction

In the last several years, many operators were established that occurred in various monographs with regard to fuzzy logic; specifically, min-max, Frank, Einstein, product, Hamacher, and Dombi operators. These parametric families gain one’s attention from a practical point of view as different arguments can be made by taking into account different values of the parameters.
Zadeh [1] proposed the concept of the min operator for introducing a fuzzy set (FS). Hamacher [2] showed that these operators can be easily created by considering the solution of associative operation equality. Later, rational structures were obtained under Kuwagaki’s results [3]. From that time, a more generalized form, i.e., triangular norms (t-norms) and triangular conorms (t-conorms), was explored by the scholars active in the fuzzy theory area. Within the probabilistic metric framework, t-norms and t-conorms were initiated by Menger [4], where the distance between objects was narrated by numbers. Many axioms concerning t-norms and t-conorms were given by Schweizer and Sklar [5]. Furthermore, Alsina et al. [6] certified these norms as standard models for defining the union and intersection of FSs. Several summarizations and extensions of meaningful results of T -operators can be observed in Klement et al. [7] and [8], respectively. Zadeh’s min and max operators have been widely used in almost every fuzzy logic application, but from the theoretical and experimental perspective, other T -operators may produce better outcomes, especially in decision-making situations, such as the product operator may be preferred over the minimum operator [9]. Before the appropriate choice of these operators, one has to examine the features of T -operators like simplicity, suitability, and the implementation of software and hardware. Since the work and study on these operators has expanded, a variety of choices exists for selecting T -operators that may be preferred for a given analysis.
Graphs connect objects, but if in the connection there exists vagueness, then it can be considered as a fuzzy graph (FG). Rosenfeld [10] presented the structure of FG by establishing the fuzzy relation on FS with minimum and maximum operators. Further, several operations on FGs were discussed by Mordeson and Peng [11]. As the hesitant part was not clearly expressed, therefore Atanassov [12] generalized FSs to intuitionistic fuzzy sets (IFSs) by appointing membership μ and non-membership grade ν to the units, fulfilling the requirement μ + ν 1 with hesitant part π = 1 μ ν . Due to the wide range of graph theory applications, Shannon and Atanassov [13] gave the proposal of IFGsby taking into account intuitionistic fuzzy relations on IFSs. To deal with impreciseness and complex uncertainty, Yager [14,15,16] developed Pythagorean fuzzy sets (PFSs) with the requirement μ 2 + ν 2 1 , where ν and μ depict non-membership and membership grade, respectively. After that, the dual aspects of a unit were explained by Zhang and Xu [17] with the Pythagorean fuzzy number (PFN). In any decision-making atmosphere, the encouragement of PFSs can be seen; a professional provides the preferable information with membership μ = 0.8 and non-membership ν = 0.3 , and one may observe that the IF number fails to tackle this state, as 0.8 + 0.3 > 1 . Besides, ( 0.8 ) 2 + ( 0.3 ) 2 1 . Hence, a greater amount of haziness can be dealt with by the help of PFSs. The concept of PFS has been prosperously applied in numerous fields [17,18]. In practical MCGDM situations, Akram et al. [19,20] proved that PFSs are much more reliable in handling haziness. Under the PF environment, some operations [21] and the TODIM technique for MCDM problem [22] have been studied. Moreover, it has been examined from several perspectives, in particular aggregation operators [23,24]. Garg [25,26,27,28] inspected and explored numerous applications of PFSs in a decision support system. As an extensive range of applications, such as database theory, optimization of networks, and decision-making are covered by means of graphs, hence on this basis, Naz et al. [29] presented the notion of Pythagorean fuzzy graphs (PFGs) by considering min and max operators. Verma et al. [30] discussed strong PFGs and proffered complements. The energy of PFGs was put forward by Akram and Naz [31]. Under PF circumstances, Akram et al. [32,33,34,35] presented certain graphs and analyzed their essential characteristics. Naz et al. [36] developed operations and their application under single valued neutrosophic situation. Akram and Habib [37] discussed the regularity of q-rung picture fuzzy graphs with applications. Habib et al. [38] presented the notion of q-rung orthopair fuzzy competition graphs by considering the most wide spread max and min operators and gave an application in the soil ecosystem. Akram et al. [39] explored the concept of the edge regularity of q-rung picture fuzzy graphs.
Dombi [40] inaugurated the Dombi operator with operational parameter λ in 1982. Afterward, he [41] generalized them. The sign of this operational parameter makes it exceptional. It is very helpful in making decisions, as by choosing different values of λ , distinct arguments can be formed depending on one’s requirement. For this precedence, Dombi operations were later used by Chen and Ye [42], Shi and Ye [43], and Jana et al. [44] in MCDM situations. By using the Dombi–Bonferroni mean operator, Liu et al. [45] solved the MCGDM problem. In a hesitant fuzzy environment, He [46] explored typhoon disaster assessment by taking into account Dombi operators. Recently, Akram et al. [47] proffered Pythagorean Dombi fuzzy aggregation operators and gave an application for better understanding. From the existing research, it is noted that in decision-making areas, Dombi operational parameters have an excellent nature. Since FG can easily model and structure decision-making situations with vagueness, a very insufficient attempt has been made to utilize the Dombi operator in graph theory. Hence, on this base, Ashraf et al. [48] provided the notion of the Dombi fuzzy graph (DFG). As PF models are more versatile and practical than fuzzy and IF models for describing uncertain information that appear in decision-making circumstances, such as mathematics, engineering, medical, artificial intelligence, and social sciences, Akram et al. [49] presented the idea of PDFG by considering the point that for extending classical graphs to PFGs, max and min operators are not always preferred to deal with certain world problems. Furthermore, the development inaugurated by Klement, Hamachar, Alsina, and other inventors was put together in the area of PFG theory, and the use of the T -operator, mainly, the Dombi operator was demonstrated. Graph operations produce new classes of graphs from initial ones, which in turn may be useful for the modeling and recognition of computer network designs. In this research article, various operations of the proposed graph, such as the direct product, semi-strong product, strong product, Cartesian product, and composition, are developed, and a number of their significant characteristics are explored, as they are widely used for structuring reliable models. These graph products can be utilized to create and examine series of real-world networks, in particular, communication and road networks. Further, the degree of vertices and total degree are defined as a modification, of the resultant PDFGs, acquired from the given PDFGs using these operations.
The presented research article is structured as follows: Section 2 proposes the novel concept of certain Pythagorean Dombi fuzzy graphs such as direct, Cartesian, semi-strong, strong, and composition with appropriate illustrations. Section 3 presents a decision-making algorithm in the Pythagorean Dombi fuzzy environment and solves a numerical example to illustrate the developed method. Section 4 contains concluding remarks and points out directions for future work.

2. Certain Pythagorean Dombi Fuzzy Graphs

In this section, certain Pythagorean Dombi fuzzy graphs including direct, Cartesian, semi-strong, strong, and composition are defined with their essential features, as these graphs play a crucial role in structuring and designing reliable communication and road networking models.

2.1. Direct Product of Pythagorean Dombi Fuzzy Graphs

Definition 1.
Let A j and B j be the Pythagorean fuzzy subsets of V j and E j ( j = 1 , 2 ) , respectively. The direct product of PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, is represented by G 1 × G 2 = ( A 1 × A 2 , B 1 × B 2 ) , defined as:
(i)
( μ A 1 × μ A 2 ) ( s 1 , s 2 ) = μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) = ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 )
for all ( s 1 , s 2 ) V 1 × V 2 ,
(ii)
( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 )
for all s 1 t 1 E 1 and s 2 t 2 E 2 .
Example 1.
Consider PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) on V 1 = { s 1 , s 2 } and V 2 = { t 1 , t 2 } , respectively, as represented in Figure 1. Their direct product G 1 × G 2 is given in Figure 2.
By routine computations, one can view from Figure 2 that G 1 × G 2 = ( A 1 × A 2 , B 1 × B 2 ) is a PDFG of the underlying crisp graph G 1 × G 2 = ( V 1 × V 2 , E 1 × E 2 ) .
Proposition 1.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are two PDFGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the direct product G 1 × G 2 of G 1 and G 2 is the PDFG of G 1 × G 2 .
Proof. 
Assume that G 1 and G 2 are two PDFGs of underlying crisp graphs G 1 and G 2 , respectively. Further, suppose that G = G 1 × G 2 = ( A 1 × A 2 , B 1 × B 2 ) is the direct product of G 1 and G 2 , where A = A 1 × A 2 and B = B 1 × B 2 are the PF vertex and edge set, respectively. Let ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 .
If s 1 t 1 E 1 and s 2 t 2 E 2 , then the membership grade is:
( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = T ( μ B 1 ( s 1 t 1 ) , μ B 2 ( s 2 t 2 ) ) T ( μ A 1 ( s 1 ) μ A 1 ( t 1 ) μ A 1 ( s 1 ) + μ A 1 ( t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) , μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ A 2 ( s 2 ) + μ A 2 ( t 2 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) )
Taking μ A 1 ( s 1 ) = u , μ A 1 ( t 1 ) = v , μ A 2 ( s 2 ) = w , and μ A 2 ( t 2 ) = x , we have:
( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) T u v u + v u v , w x w + x w x = u v w x ( u + v u v ) ( w + x w x ) u v u + v u v + w x w + x w x u v w x ( u + v u v ) ( w + x w x ) = u v w x ( u + w u w ) ( v + x v x ) u v u + w u w + w x v + x v x u v w x ( u + w u w ) ( v + x v x ) = ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) + ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) .
Likewise, for the non-membership grade:
( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = S ( ν B 1 ( s 1 t 1 ) , ν B 2 ( s 2 t 2 ) ) S ( ν A 1 ( s 1 ) + ν A 1 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 1 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 1 ( t 1 ) , ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν A 2 ( s 2 ) ν A 2 ( t 2 ) )
Taking ν A 1 ( s 1 ) = p , ν A 1 ( t 1 ) = q , ν A 2 ( s 2 ) = n and ν A 2 ( t 2 ) = m , we have:
( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) S p + q 2 p q 1 p q , n + m 2 n m 1 n m = p + q 2 p q 1 p q + n + m 2 n m 1 n m 2 ( p + q 2 p q 1 p q ) ( n + m 2 n m 1 n m ) 1 ( p + q 2 p q 1 p q ) ( n + m 2 n m 1 n m ) = p + n 2 p n 1 p n + q + m 2 q m 1 q m 2 ( p + n 2 p n 1 p n ) ( q + m 2 q m 1 q m ) 1 ( p + n 2 p n 1 p n ) ( q + m 2 q m 1 q m ) = ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) + ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) 2 ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) 1 ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) .
Hence, it is concluded that G 1 × G 2 is a PDFG of G 1 × G 2 .
Definition 2.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFGs. Then, for any vertex ( s 1 , s 2 ) V 1 × V 2 ,
( D μ ) G 1 × G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 ( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ,
( D ν ) G 1 × G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 ( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) .
Definition 3.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFGs. Then, for any vertex ( s 1 , s 2 ) V 1 × V 2 ,
( TD μ ) G 1 × G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 ( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) = s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) + μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ,
( TD ν ) G 1 × G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 ( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) = s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) + ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 ) .
Example 2.
Consider PDFGs G 1 and G 2 as in Example 1. Their direct product is presented in Figure 2. Then, by Definition 2, we must have:
( D μ ) G 1 × G 2 ( s 1 , t 2 ) = ( μ B 1 × μ B 2 ) ( ( s 1 , t 2 ) ( s 2 , t 1 ) ) = μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) + μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) = 0.21 ,
( D ν ) G 1 × G 2 ( s 1 , t 2 ) = ( ν B 1 × ν B 2 ) ( ( s 1 , t 2 ) ( s 2 , t 1 ) ) = ν B 1 ( s 1 s 2 ) + ν B 2 ( t 1 t 2 ) 2 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) 1 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) = 0.81 .
Thus, ( D ) G 1 × G 2 ( s 1 , t 2 ) = ( 0.21 , 0.81 ) .
Further, by using Definition 3, we have:
( TD μ ) G 1 × G 2 ( s 1 , t 2 ) = ( D μ ) G 1 × G 2 ( s 1 , t 2 ) + ( μ A 1 × μ A 2 ) ( s 1 , t 2 ) = 0.21 + μ A 1 ( s 1 ) μ A 2 ( t 2 ) μ A 1 ( s 1 ) + μ A 2 ( t 2 ) μ A 1 ( s 1 ) μ A 2 ( t 2 ) = 0.59 ,
( TD ν ) G 1 × G 2 ( s 1 , t 2 ) = ( D ν ) G 1 × G 2 ( s 1 , t 2 ) + ( ν A 1 × ν A 2 ) ( s 1 , t 2 ) = 0.81 + ν A 1 ( s 1 ) + ν A 2 ( t 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( t 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( t 2 ) = 1.53 .
Thus, ( TD ) G 1 × G 2 ( s 1 , t 2 ) = ( 0.59 , 1.53 ) .
Proposition 2.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are strong PDFGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then direct product G 1 × G 2 of G 1 and G 2 is also a strong PDFG of G 1 × G 2 .
Proof. 
The proof is the same as Proposition 1. □
Proposition 3.
If G 1 × G 2 of G 1 and G 2 is a strong PDFG, then at least G 1 or G 2 must be a strong PDFG.
Proof. 
Suppose on the contrary that G 1 and G 2 are not strong PDFGs. Then, for s 1 t 1 E 1 and s 2 t 2 E 2 , we have:
μ B 1 ( s 1 t 1 ) < μ A 1 ( s 1 ) μ A 1 ( t 1 ) μ A 1 ( s 1 ) + μ A 1 ( t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) = u v u + v u v ,
ν B 1 ( s 1 t 1 ) < ν A 1 ( s 1 ) + ν A 1 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 1 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 2 ( t 1 ) = p + q 2 p q 1 p q ,
and:
μ B 2 ( s 2 t 2 ) < μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ A 2 ( s 2 ) + μ A 2 ( t 2 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) = w x w + x w x ,
ν B 2 ( s 2 t 2 ) < ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν A 2 ( s 2 ) ν A 2 ( t 2 ) = n + m 2 n m 1 n m .
Assume that:
μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) < u v u + v u v u ,
ν B 2 ( s 2 t 2 ) ν B 1 ( s 1 t 1 ) < p + q 2 p q 1 p g p + q p q .
Let ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 × E 2 . If s 1 t 1 E 1 and s 2 t 2 E 2 , then the membership grade is:
( μ B 1 × μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = T ( μ B 1 ( s 1 t 1 ) , μ B 2 ( s 2 t 2 ) ) < T u v u + v u v , w x w + x w x = u v w x ( u + v u v ) ( w + x w x ) u v u + v u v + w x w + x w x u v w x ( u + v u v ) ( w + x w x ) = u v w x ( u + w u w ) ( v + x v x ) u v u + w u w + w x v + x v x u v w x ( u + w u w ) ( v + x v x ) = ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) + ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) ( μ A 1 × μ A 2 ) ( s 1 , s 2 ) ( μ A 1 × μ A 2 ) ( t 1 , t 2 ) .
Likewise, for the non-membership grade:
( ν B 1 × ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = S ( ν B 1 ( s 1 t 1 ) , ν B 2 ( s 2 t 2 ) ) < S p + q 2 p q 1 p q , n + m 2 n m 1 n m = p + q 2 p q 1 p q + n + m 2 n m 1 n m 2 ( p + q 2 p q 1 p q ) ( n + m 2 n m 1 n m ) 1 ( p + q 2 p q 1 p q ) ( n + m 2 n m 1 n m ) = p + n 2 p n 1 p n + q + m 2 q m 1 q m 2 ( p + n 2 p n 1 p n ) ( q + m 2 q m 1 q m ) 1 ( p + n 2 p n 1 p n ) ( q + m 2 q m 1 q m ) = ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) + ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) 2 ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) 1 ( ν A 1 × ν A 2 ) ( s 1 , s 2 ) ( ν A 1 × ν A 2 ) ( t 1 , t 2 ) .
Hence, it is concluded that G 1 × G 2 is not a strong PDFG of G 1 × G 2 , a contradiction. □

2.2. Cartesian Product of Pythagorean Dombi Fuzzy Graphs

Definition 4.
Let A j and B j be the Pythagorean fuzzy subsets of V j and E j ( j = 1 , 2 ) , respectively. The Cartesian product of PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) of the underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, is represented by G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) , defined as:
(i)
( μ A 1 μ A 2 ) ( s 1 , s 2 ) = μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 )
for all ( s 1 , s 2 ) V 1 × V 2 ,
(ii)
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = μ A 1 ( s ) μ B 2 ( s 2 t 2 ) μ A 1 ( s ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = ν A 1 ( s ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s ) ν B 2 ( s 2 t 2 )
for all s V 1 and s 2 t 2 E 2 ,
(iii)
( μ B 1 μ B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = μ B 1 ( s 1 t 1 ) μ A 2 ( s ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s ) μ B 1 ( s 1 t 1 ) μ A 2 ( s ) ( ν B 1 ν B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = ν B 1 ( s 1 t 1 ) + ν A 2 ( s ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s )
for all s 1 t 1 E 1 and s V 2 .
Remark 1.
The Cartesian product G 1 G 2 of two PDFGs G 1 and G 2 is not a PDFG as justified in the following example.
Consider PDFGs G 1 and G 2 as in Example 1. Then, the Cartesian product G 1 G 2 is displayed in Figure 3.
Since for the membership and non-membership grade:
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.27 0.25 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.80 0.84 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) ,
hence it is concluded that G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) is not a PDFG.
Definition 5.
If the non-membership and membership grade of each edge of PDFG G of underlying crisp graph G is attached from zero and [ 0 , 1 ] , respectively, and each vertex is crisp in G , then G is known as the Pythagorean Dombi fuzzy edge graph (PDFEG).
Proposition 4.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are two PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the Cartesian product G 1 G 2 of G 1 and G 2 is the PDFEG of G 1 G 2 .
Proof. 
Assume that G 1 and G 2 are two PDFEGs of underlying crisp graphs G 1 and G 2 , respectively. Further, suppose that G = G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) are the Cartesian product of G 1 and G 2 , where A = A 1 A 2 and B = B 1 B 2 are the PF vertex and edge set, respectively. Let ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 .
If s 1 = t 1 = s and s 2 t 2 E 2 , then the membership and non-membership grade are:
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = T ( μ A 1 ( s ) , μ B 2 ( s 2 t 2 ) ) = T ( 1 , μ B 2 ( s 2 t 2 ) ) = μ B 2 ( s 2 t 2 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ A 2 ( s 2 ) + μ A 2 ( t 2 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) = ( μ A 1 μ A 2 ) ( s , s 2 ) ( μ A 1 μ A 2 ) ( s , t 2 ) ( μ A 1 μ A 2 ) ( s , s 2 ) + ( μ A 1 μ A 2 ) ( s , t 2 ) ( μ A 1 μ A 2 ) ( s , s 2 ) ( μ A 1 μ A 2 ) ( s , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = S ( ν A 1 ( s ) , ν B 2 ( s 2 t 2 ) ) = S ( 0 , ν B 2 ( s 2 t 2 ) ) = ν B 2 ( s 2 t 2 ) ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν A 2 ( s 2 ) ν A 2 ( t 2 ) = ( ν A 1 ν A 2 ) ( s , s 2 ) + ( ν A 1 ν A 2 ) ( s , t 2 ) 2 ( ν A 1 ν A 2 ) ( s , s 2 ) ( ν A 1 ν A 2 ) ( s , t 2 ) 1 ( ν A 1 ν A 2 ) ( s , s 2 ) ( ν A 1 ν A 2 ) ( s , t 2 ) .
If s 1 t 1 E 1 and s 2 = t 2 = s , then the membership and non-membership grade are:
( μ B 1 μ B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = T ( μ B 1 ( s 1 t 1 ) , μ A 2 ( s ) ) = T ( μ B 1 ( s 1 t 1 ) , 1 ) = μ B 1 ( s 1 t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) μ A 1 ( s 1 ) + μ A 1 ( t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) = ( μ A 1 μ A 2 ) ( s 1 , s ) ( μ A 1 μ A 2 ) ( t 1 , s ) ( μ A 1 μ A 2 ) ( s 1 , s ) + ( μ A 1 μ A 2 ) ( t 1 , s ) ( μ A 1 μ A 2 ) ( s 1 , s ) ( μ A 1 μ A 2 ) ( t 1 , s ) ,
( ν B 1 ν B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = S ( ν B 1 ( s 1 t 1 ) , ν A 2 ( s ) ) = S ( ν B 1 ( s 1 t 1 ) , 0 ) = ν B 1 ( s 1 t 1 ) ν A 1 ( s 1 ) + ν A 1 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 1 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 1 ( t 1 ) = ( ν A 1 ν A 2 ) ( s 1 , s ) + ( ν A 1 ν A 2 ) ( t 1 , s ) 2 ( ν A 1 ν A 2 ) ( s 1 , s ) ( ν A 1 ν A 2 ) ( t 1 , s ) 1 ( ν A 1 ν A 2 ) ( s 1 , s ) ( ν A 1 ν A 2 ) ( t 1 , s ) .
Hence, it is concluded that G 1 G 2 is a PDFEG of G 1 G 2 .
Example 3.
Consider PDFEGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) as represented in Figure 4, such that μ A 1 ( s i ) = 1 , ν A 1 ( s i ) = 0 for all s i V 1 and i = 1 , 2 , where μ B 1 = { s 1 s 2 0.8 } , ν B 1 = { s 1 s 2 0.0 } and μ A 2 ( t j ) = 1 , ν A 2 ( t j ) = 0 for all t j V 2 and j = 1 , 2 , where μ B 2 = { t 1 t 2 0.7 } , ν B 2 = { t 1 t 2 0.0 } . Then, G 1 G 2 is given in Figure 5.
By routine computations, one can view from Figure 5 that G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) is a PDFEG of the underlying crisp graph G 1 G 2 = ( V 1 V 2 , E 1 E 2 ) .
Definition 6.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( D μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) ,
( D ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) .
Definition 7.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( TD μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( μ A 1 μ A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ,
( TD ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) + ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 ) .
Example 4.
Consider PDFEGs G 1 and G 2 as in Example 3; their G 1 G 2 is given in Figure 5. Then, by Definition 6, we must have:
( D μ ) G 1 G 2 ( s 1 , t 1 ) = ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) + μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) + μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) = 1.5 ,
( D ν ) G 1 G 2 ( s 1 , t 1 ) = ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = ν B 1 ( s 1 s 2 ) + ν A 2 ( t 1 ) 2 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) 1 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) + ν A 1 ( s 1 ) + ν B 2 ( t 1 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) = 0 .
Thus, ( D ) G 1 G 2 ( s 1 , t 1 ) = ( 1.5 , 0 ) .
Further, by using Definition 7, we have:
( TD μ ) G 1 G 2 ( s 1 , t 1 ) = ( D μ ) G 1 G 2 ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 1 ) = 1.5 + μ A 1 ( s 1 ) μ A 2 ( t 1 ) μ A 1 ( s 1 ) + μ A 2 ( t 1 ) μ A 1 ( s 1 ) μ A 2 ( t 1 ) = 2.5 ,
( TD ν ) G 1 G 2 ( s 1 , t 1 ) = ( D ν ) G 1 G 2 ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 1 ) = 0 + ν A 1 ( s 1 ) + ν A 2 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 2 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 2 ( t 1 ) = 0 .
Thus, ( TD ) G 1 G 2 ( s 1 , t 1 ) = ( 2.5 , 0 ) .
Remark 2.
The Cartesian product G 1 G 2 of strong PDFGs G 1 and G 2 is not a PDFG. This is justified in the following example.
Consider strong PDFGs G 1 and G 2 . Their G 1 G 2 is displayed in Figure 6.
Since for the membership and non-membership grade of ( s 1 , t 1 ) ( s 1 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.33 0.22 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.78 0.86 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) .
Likewise, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 1 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.28 0.25 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.81 0.84 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) .
Hence, it is concluded that G 1 G 2 is not a PDFG of underlying crisp graph G 1 G 2 .
Proposition 5.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are strong PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the Cartesian product G 1 G 2 of G 1 and G 2 is also a strong PDFEG of G 1 G 2 .
Proof. 
The proof is the same as Proposition 4. □

2.3. Semi-Strong Product of Pythagorean Dombi Fuzzy Graphs

Definition 8.
Let A j and B j be the Pythagorean fuzzy subsets of V j and E j ( j = 1 , 2 ) , respectively. The semi-strong product of PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, is represented by G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) , defined as:
(i)
( μ A 1 μ A 2 ) ( s 1 , s 2 ) = μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 )
for all ( s 1 , s 2 ) V 1 V 2 ,
(ii)
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = μ A 1 ( s ) μ B 2 ( s 2 t 2 ) μ A 1 ( s ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = ν A 1 ( s ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s ) ν B 2 ( s 2 t 2 )
for all s V 1 and s 2 t 2 E 2 ,
(iii)
( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 )
for all s 1 t 1 E 1 and s 2 t 2 E 2 .
Proposition 6.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the semi-strong product G 1 G 2 of G 1 and G 2 is the PDFEG of G 1 G 2 .
Proof. 
This proposition can be easily proven in the same way as Proposition 1 and Proposition 4 were proven. □
Example 5.
Consider PDFEGs G 1 and G 2 as in Example 3. Then, G 1 G 2 is displayed in Figure 7.
By routine computations, one can view from Figure 7 that G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) is a PDFEG of underlying crisp graph G 1 G 2 = ( V 1 V 2 , E 1 E 2 ) .
Definition 9.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( D μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ,
( D ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) .
Definition 10.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( TD μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( μ A 1 μ A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) + μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ,
( TD ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) + ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 ) .
Example 6.
Consider PDFEGs G 1 and G 2 as in Example 3; their G 1 G 2 is given in Figure 7. Then, by Definition 9, we must have:
( D μ ) G 1 G 2 ( s 2 , t 1 ) = ( μ B 1 μ B 2 ) ( ( s 2 , t 1 ) ( s 2 , t 2 ) ) + ( μ B 1 μ B 2 ) ( ( s 2 , t 1 ) ( s 1 , t 2 ) ) = μ A 1 ( s 2 ) μ B 2 ( t 1 t 2 ) μ A 1 ( s 2 ) + μ B 2 ( t 1 t 2 ) μ A 1 ( s 2 ) μ B 2 ( t 1 t 2 ) + μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) + μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) = 1.3 ,
( D ν ) G 1 G 2 ( s 2 , t 1 ) = ( ν B 1 ν B 2 ) ( ( s 2 , t 1 ) ( s 2 , t 2 ) ) + ( ν B 1 ν B 2 ) ( ( s 2 , t 1 ) ( s 1 , t 2 ) ) = = ν A 1 ( s 2 ) + ν B 2 ( t 1 t 2 ) 2 ν A 1 ( s 2 ) ν B 2 ( t 1 t 2 ) 1 ν A 1 ( s 2 ) ν B 2 ( t 1 t 2 ) + ν B 1 ( s 1 s 2 ) + ν B 2 ( t 1 t 2 ) 2 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) 1 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) = 0 .
Thus, ( D ) G 1 G 2 ( s 2 , t 1 ) = ( 1.3 , 0 ) .
Further, by using Definition 10, we have:
( TD μ ) G 1 G 2 ( s 2 , t 1 ) = ( D μ ) G 1 G 2 ( s 2 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 1 ) = 1.3 + μ A 1 ( s 2 ) μ A 2 ( t 1 ) μ A 1 ( s 2 ) + μ A 2 ( t 1 ) μ A 1 ( s 2 ) μ A 2 ( t 1 ) = 2.3 ,
( TD ν ) G 1 G 2 ( s 2 , t 1 ) = ( D ν ) G 1 G 2 ( s 2 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 1 ) = 0 + ν A 1 ( s 2 ) + ν A 2 ( t 1 ) 2 ν A 1 ( s 2 ) ν A 2 ( t 1 ) 1 ν A 1 ( s 2 ) ν A 2 ( t 1 ) = 0 .
Thus, ( TD ) G 1 G 2 ( s 2 , t 1 ) = ( 2.3 , 0 ) .
Remark 3.
The semi-strong product G 1 G 2 of strong PDFGs G 1 and G 2 is not a PDFG. This is justified in the following example.
Consider strong PDFGs G 1 and G 2 . Their G 1 G 2 is displayed in Figure 8.
Since for the membership and non-membership grade of ( s 1 , t 1 ) ( s 1 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.33 0.22 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.78 0.86 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) .
Likewise, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.27 = 0.27 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.82 = 0.82 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) .
Hence, it is concluded that G 1 G 2 is not a PDFG of underlying crisp graph G 1 G 2 .
Proposition 7.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are strong PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the semi-strong product G 1 G 2 of G 1 and G 2 is also a strong PDFEG of G 1 G 2 .

2.4. Strong Product of Pythagorean Dombi Fuzzy Graphs

Definition 11.
Let A j and B j be the Pythagorean fuzzy subsets of V j and E j ( j = 1 , 2 ) , respectively. The strong product of PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, is represented by G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) , defined as:
(i)
( μ A 1 μ A 2 ) ( s 1 , s 2 ) = μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 )
for all ( s 1 , s 2 ) V 1 V 2 ,
(ii)
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = μ A 1 ( s ) μ B 2 ( s 2 t 2 ) μ A 1 ( s ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = ν A 1 ( s ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s ) ν B 2 ( s 2 t 2 )
for all s V 1 and s 2 t 2 E 2 ,
(iii)
( μ B 1 μ B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = μ B 1 ( s 1 t 1 ) μ A 2 ( s ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s ) μ B 1 ( s 1 t 1 ) μ A 2 ( s ) ( ν B 1 ν B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = ν B 1 ( s 1 t 1 ) + ν A 2 ( s ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s )
for all s 1 t 1 E 1 and s V 2 .
(iv)
( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 )
for all s 1 t 1 E 1 and s 2 t 2 E 2 .
Proposition 8.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the strong product G 1 G 2 of G 1 and G 2 is the PDFEG of G 1 G 2 .
Proof. 
This proposition can be easily proven in the same way as Proposition 1 and Proposition 4 has been proved. □
Example 7.
Consider PDFEGs G 1 and G 2 as in Example 3. Then, G 1 G 2 is displayed in Figure 9.
By routine computations, one can view from Figure 9 that G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) is a PDFEG of underlying crisp graph G 1 G 2 = ( V 1 V 2 , E 1 E 2 ) .
Definition 12.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( D μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) ,
( D ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) .
Definition 13.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( TD μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( μ A 1 μ A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) + μ B 2 ( s 2 t 2 ) μ B 1 ( s 1 t 1 ) μ B 2 ( s 2 t 2 ) + μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ,
( TD ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 E 2 ν B 1 ( s 1 t 1 ) + ν B 2 ( s 2 t 2 ) 2 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) 1 ν B 1 ( s 1 t 1 ) ν B 2 ( s 2 t 2 ) + ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 ) .
Example 8.
Consider PDFEGs G 1 and G 2 as in Example 3; their G 1 G 2 is given in Figure 9. Then, by Definition 12, we must have:
( D μ ) G 1 G 2 ( s 1 , t 1 ) = = ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) + ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) + μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) + μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) + μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) + μ B 2 ( t 1 t 2 ) μ B 1 ( s 1 s 2 ) μ B 2 ( t 1 t 2 ) = 0.7 + 0.8 + 0.6 = 2.1 ,
( D ν ) G 1 G 2 ( s 1 , t 1 ) = ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) + ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = ν A 1 ( s 1 ) + ν B 2 ( t 1 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) + ν B 1 ( s 1 s 2 ) + ν A 2 ( t 1 ) 2 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) 1 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) + ν B 1 ( s 1 s 2 ) + ν B 2 ( t 1 t 2 ) 2 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) 1 ν B 1 ( s 1 s 2 ) ν B 2 ( t 1 t 2 ) = 0 + 0 + 0 = 0 .
Thus, ( D ) G 1 G 2 ( s 1 , t 1 ) = ( 2.1 , 0 ) .
Further, by using Definition 13, we have:
( TD μ ) G 1 G 2 ( s 1 , t 1 ) = ( D μ ) G 1 G 2 ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 1 ) = 2.1 + μ A 1 ( s 1 ) μ A 2 ( t 1 ) μ A 1 ( s 1 ) + μ A 2 ( t 1 ) μ A 1 ( s 1 ) μ A 2 ( t 1 ) = 3.1 ,
( TD ν ) G 1 G 2 ( s 1 , t 1 ) = ( D ν ) G 1 G 2 ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 1 ) = 0 + ν A 1 ( s 1 ) + ν A 2 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 2 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 2 ( t 1 ) = 0 .
Thus, ( TD ) G 1 G 2 ( s 1 , t 1 ) = ( 3.1 , 0 ) .
Remark 4.
The strong product G 1 G 2 of two strong PDFGs G 1 and G 2 is not a PDFG. It is justified in the following example.
Consider two strong PDFGs G 1 and G 2 . Their G 1 G 2 is displayed in Figure 10.
Since for the membership and non-membership grade of ( s 1 , t 1 ) ( s 1 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.33 0.22 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.78 0.86 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) .
Likewise, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 1 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.28 0.25 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.81 0.84 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) .
Further, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.27 = 0.27 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.82 = 0.82 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) .
Hence, it is concluded that G 1 G 2 is not a PDFG of underlying crisp graph G 1 G 2 .
Proposition 9.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are strong PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the strong product G 1 G 2 of G 1 and G 2 is also a strong PDFEG of G 1 G 2 .

2.5. Composition of Pythagorean Dombi Fuzzy Graphs

Definition 14.
Let A j and B j be the Pythagorean fuzzy subsets of V j and E j ( j = 1 , 2 ) , respectively. The composition of PDFGs G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, is represented by G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) , defined as:
(i)
( μ A 1 μ A 2 ) ( s 1 , s 2 ) = μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 )
for all ( s 1 , s 2 ) V 1 × V 2 ,
(ii)
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = μ A 1 ( s ) μ B 2 ( s 2 t 2 ) μ A 1 ( s ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s ) μ B 2 ( s 2 t 2 ) ( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) = ν A 1 ( s ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s ) ν B 2 ( s 2 t 2 )
for all s V 1 and s 2 t 2 E 2 ,
(iii)
( μ B 1 μ B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = μ B 1 ( s 1 t 1 ) μ A 2 ( s ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s ) μ B 1 ( s 1 t 1 ) μ A 2 ( s ) ( ν B 1 ν B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) = ν B 1 ( s 1 t 1 ) + ν A 2 ( s ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s )
for all s 1 t 1 E 1 and s V 2 .
(iv)
( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + μ B 1 ( s 1 t 1 ) μ A 2 ( t 2 ) + μ A 2 ( s 2 ) μ A 2 ( t 2 ) 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 3 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 )
for all s 1 t 1 E 1 and s 2 t 2 .
Proposition 10.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the composition G 1 G 2 of G 1 and G 2 is the PDFEG of G 1 G 2 .
Proof. 
From Proposition 4, if s 1 = t 1 = s and s 2 t 2 E 2 , then we have:
( μ B 1 μ B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) ( μ A 1 μ A 2 ) ( s , s 2 ) ( μ A 1 μ A 2 ) ( s , t 2 ) ( μ A 1 μ A 2 ) ( s , s 2 ) + ( μ A 1 μ A 2 ) ( s , t 2 ) ( μ A 1 μ A 2 ) ( s , s 2 ) ( μ A 1 μ A 2 ) ( s , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s , s 2 ) ( s , t 2 ) ) ( ν A 1 ν A 2 ) ( s , s 2 ) + ( ν A 1 ν A 2 ) ( s , t 2 ) 2 ( ν A 1 ν A 2 ) ( s , s 2 ) ( ν A 1 ν A 2 ) ( s , t 2 ) 1 ( ν A 1 ν A 2 ) ( s , s 2 ) ( ν A 1 ν A 2 ) ( s , t 2 ) .
If s 1 t 1 E 1 and s 2 = t 2 = s , then we have:
( μ B 1 μ B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) ( μ A 1 μ A 2 ) ( s 1 , s ) ( μ A 1 μ A 2 ) ( t 1 , s ) ( μ A 1 μ A 2 ) ( s 1 , s ) + ( μ A 1 μ A 2 ) ( t 1 , s ) ( μ A 1 μ A 2 ) ( s 1 , s ) ( μ A 1 μ A 2 ) ( t 1 , s ) ,
( ν B 1 ν B 2 ) ( ( s 1 , s ) ( t 1 , s ) ) ( ν A 1 ν A 2 ) ( s 1 , s ) + ( ν A 1 ν A 2 ) ( t 1 , s ) 2 ( ν A 1 ν A 2 ) ( s 1 , s ) ( ν A 1 ν A 2 ) ( t 1 , s ) 1 ( ν A 1 ν A 2 ) ( s 1 , s ) ( ν A 1 ν A 2 ) ( t 1 , s ) .
In similar manner, if s 1 t 1 E 1 and s 2 t 2 , then we have:
( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = T ( T ( μ A 2 ( s 2 ) , μ A 2 ( t 2 ) ) , μ B 1 ( s 1 t 1 ) ) = T ( T ( 1 , 1 ) , μ B 1 ( s 1 t 1 ) ) = T ( 1 , μ B 1 ( s 1 t 1 ) ) = μ B 1 ( s 1 t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) μ A 1 ( s 1 ) + μ A 1 ( t 1 ) μ A 1 ( s 1 ) μ A 1 ( t 1 ) = ( μ A 1 μ A 2 ) ( s 1 , s 2 ) ( μ A 1 μ A 2 ) ( t 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , s 2 ) + ( μ A 1 μ A 2 ) ( t 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , s 2 ) ( μ A 1 μ A 2 ) ( t 1 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = S ( S ( ν A 2 ( s 2 ) , ν A 2 ( t 2 ) ) ν B 1 ( s 1 t 1 ) ) = S ( S ( 0 , 0 ) , ν B 1 ( s 1 t 1 ) ) = S ( 0 , ν B 1 ( s 1 t 1 ) ) = ν B 1 ( s 1 t 1 ) ν A 1 ( s 1 ) + ν A 1 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 1 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 1 ( t 1 ) = ( ν A 1 ν A 2 ) ( s 1 , s 2 ) + ( ν A 1 ν A 2 ) ( t 1 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , s 2 ) ( ν A 1 ν A 2 ) ( t 1 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , s 2 ) ( ν A 1 ν A 2 ) ( t 1 , t 2 ) .
Hence, it is concluded that G 1 G 2 is a PDFEG of G 1 G 2 .
Example 9.
Consider PDFEGs G 1 and G 2 as in Example 3. Then, G 1 G 2 is displayed in Figure 11.
By routine computations, one can view from Figure 11 that G 1 G 2 = ( A 1 A 2 , B 1 B 2 ) is a PDFEG of underlying crisp graph G 1 G 2 = ( V 1 V 2 , E 1 E 2 ) .
Definition 15.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( D μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + μ B 1 ( s 1 t 1 ) μ A 2 ( t 2 ) + μ A 2 ( s 2 ) μ A 2 ( t 2 ) 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) ,
( D ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 3 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) .
Definition 16.
Consider G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) to be two PDFEGs. Then, for any vertex ( s 1 , s 2 ) V 1 V 2 ,
( TD μ ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( μ B 1 μ B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( μ A 1 μ A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( s 2 t 2 ) μ A 1 ( s 1 ) μ B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) + μ A 2 ( s 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + μ B 1 ( s 1 t 1 ) μ A 2 ( t 2 ) + μ A 2 ( s 2 ) μ A 2 ( t 2 ) 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) + μ A 1 ( s 1 ) μ A 2 ( s 2 ) μ A 1 ( s 1 ) + μ A 2 ( s 2 ) μ A 1 ( s 1 ) μ A 2 ( s 2 ) ,
( TD ν ) G 1 G 2 ( s 1 , s 2 ) = ( s 1 , s 2 ) ( t 1 , t 2 ) E 1 E 2 ( ν B 1 ν B 2 ) ( ( s 1 , s 2 ) ( t 1 , t 2 ) ) + ( ν A 1 ν A 2 ) ( s 1 , s 2 ) = s 1 = t 1 , s 2 t 2 E 2 ν A 1 ( s 1 ) + ν B 2 ( s 2 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( s 2 t 2 ) + s 1 t 1 E 1 , s 2 = t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) + s 1 t 1 E 1 , s 2 t 2 ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 3 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) + ν A 1 ( s 1 ) + ν A 2 ( s 2 ) 2 ν A 1 ( s 1 ) ν A 2 ( s 2 ) 1 ν A 1 ( s 1 ) ν A 2 ( s 2 ) .
Example 10.
Consider PDFEGs G 1 and G 2 as in Example 3; their composition is given in Figure 11. Then, by Definition 15, we must have:
( D μ ) G 1 G 2 ( s 1 , t 1 ) = ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) + ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) + μ B 2 ( t 1 t 2 ) μ A 1 ( s 1 ) μ B 2 ( t 1 t 2 ) + μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) + μ A 2 ( t 1 ) μ B 1 ( s 1 s 2 ) μ A 2 ( t 1 ) + μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) + μ B 1 ( s 1 t 1 ) μ A 2 ( t 2 ) + μ A 2 ( s 2 ) μ A 2 ( t 2 ) 2 μ B 1 ( s 1 t 1 ) μ A 2 ( s 2 ) μ A 2 ( t 2 ) = 0.7 + 0.8 + 0.8 = 2.3 ,
( D ν ) G 1 G 2 ( s 1 , t 1 ) = ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) + ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) + ( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = ν A 1 ( s 1 ) + ν B 2 ( t 1 t 2 ) 2 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) 1 ν A 1 ( s 1 ) ν B 2 ( t 1 t 2 ) + ν B 1 ( s 1 s 2 ) + ν A 2 ( t 1 ) 2 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) 1 ν B 1 ( s 1 s 2 ) ν A 2 ( t 1 ) + ν B 1 ( s 1 t 1 ) + ν A 2 ( s 2 ) + ν A 2 ( t 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) 2 ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) 2 ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 3 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) 1 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν B 1 ( s 1 t 1 ) ν A 2 ( t 2 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) + 2 ν B 1 ( s 1 t 1 ) ν A 2 ( s 2 ) ν A 2 ( t 2 ) = 0 + 0 + 0 = 0 .
Thus, ( D ) G 1 G 2 ( s 1 , t 1 ) = ( 2.3 , 0 ) .
Further, by using Definition 16, we have:
( TD μ ) G 1 G 2 ( s 1 , t 1 ) = ( D μ ) G 1 G 2 ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 1 ) = 2.3 + μ A 1 ( s 1 ) μ A 2 ( t 1 ) μ A 1 ( s 1 ) + μ A 2 ( t 1 ) μ A 1 ( s 1 ) μ A 2 ( t 1 ) = 3.3 ,
( TD ν ) G 1 G 2 ( s 1 , t 1 ) = ( D ν ) G 1 G 2 ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 1 ) = 0 + ν A 1 ( s 1 ) + ν A 2 ( t 1 ) 2 ν A 1 ( s 1 ) ν A 2 ( t 1 ) 1 ν A 1 ( s 1 ) ν A 2 ( t 1 ) = 0 .
Thus, ( TD ) G 1 G 2 ( s 1 , t 1 ) = ( 3.3 , 0 ) .
Remark 5.
The composition G 1 G 2 of strong PDFGs G 1 and G 2 is not a PDFG. It is justified in the following example.
Consider strong PDFGs G 1 and G 2 . Their G 1 G 2 is displayed in Figure 12.
Since for the membership and non-membership grade of ( s 1 , t 1 ) ( s 1 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.33 0.22 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 1 , t 2 ) ) = 0.78 0.86 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 1 , t 2 ) .
Likewise, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 1 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.28 0.25 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 1 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 1 ) ) = 0.81 0.84 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 1 ) .
Further, for the membership and non-membership grade of ( s 1 , t 1 ) ( s 2 , t 2 ) :
( μ B 1 μ B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.27 = 0.27 = ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) + ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ( μ A 1 μ A 2 ) ( s 1 , t 1 ) ( μ A 1 μ A 2 ) ( s 2 , t 2 ) ,
( ν B 1 ν B 2 ) ( ( s 1 , t 1 ) ( s 2 , t 2 ) ) = 0.82 = 0.82 = ( ν A 1 ν A 2 ) ( s 1 , t 1 ) + ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 2 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) 1 ( ν A 1 ν A 2 ) ( s 1 , t 1 ) ( ν A 1 ν A 2 ) ( s 2 , t 2 ) .
Hence, it is concluded that G 1 G 2 is not a PDFG of underlying crisp graph G 1 G 2 .
Proposition 11.
If G 1 = ( A 1 , B 1 ) and G 2 = ( A 2 , B 2 ) are strong PDFEGs of underlying crisp graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) , respectively, then the composition G 1 G 2 of G 1 and G 2 is also a strong PDFEG of G 1 G 2 .

3. Numerical Approach

In this section, we solve a decision-making problem concerning the “selection of a leading textile industry” to clarify the suitability of the proposed concept of PDFGs in a realistic scenario. Within the Pythagorean fuzzy preference relation (PFPR) [29] framework, the algorithm for the selection of a leading textile industry is summarized in Algorithm 1. Further, a comparison with existing MCDM techniques is given in Table 7, which interprets the authenticity of our proposed technique.

3.1. Selection of a Leading Textile Industry

The clothing and textile industry is very essential in social and economic terms for the growth and development of various countries. According to existing trends, the ability of planning and designing clothes, footwear, and accessories is a pivotal tool for any leading industry. To contribute to the long term development, the capability of the textile industry depends on the criteria of investors, as well as the quality of their items and products. Different places have their unique trends of fabric, and this varies with the passage of time. A newly graduated designer is planning to start her boutique in a town. As the fabric itself is the most integral part, therefore on account of the fine fabric, she pays attention to four textile industries F l ( l = 1 , 2 , 3 , 4 ) that are doing really well on the market. To select the finest option among all industries with limited effort and time, she discusses this matter with an analytical textile technologist E . The decision-making expert makes a comparison between four industries with respect to four criteria C g ( g = 1 , 2 , 3 , 4 ) which are given as:
  • C 1 = durability of fabric ;
  • C 2 = price of fabric ;
  • C 3 = moisture absorption and heat conductivity ;
  • C 4 = appearance and style of the fabric ;
with the respective weight vector W = ( 0.4 , 0.3 , 0.2 , 0.1 ) T and presents his preferable information (PFPRs [29]) Q ( g ) = ( q l p ( g ) ) 4 × 4 ( g = 1 , 2 , 3 , 4 ) , where q l p ( g ) = ( μ l p ( g ) , ν l p ( g ) ) is the PFN assigned by the decision-making expert with μ l p and ν l p as the degree to which the textile industry F l is preferred and not preferred over the textile industry F p regarding the given criteria, respectively. The PFPRs Q ( g ) = ( q l p ( g ) ) 4 × 4 are outlined in the following tables (Table 1, Table 2, Table 3 and Table 4).
The Pythagorean fuzzy directed network (PFDN) D g concerning PFPRs Q ( g ) ( g = 1 , 2 , 3 , 4 ) provided in Table 1, Table 2, Table 3 and Table 4 is displayed in Figure 13.
With the purpose to compute the clumped PFN q l p = ( μ l p , ν l p ) ( l , p = 1 , 2 , 3 , 4 ) of the textile industry F l over the textile industry F p regarding all considered criteria C ( g ) ( g = 1 , 2 , 3 , 4 ) , the Pythagorean Dombi fuzzy weighted arithmetic averaging (PDFWAA) operator [47] defined in Equation (1) is utilized.
q l p = PDFWAA ( q l p ( 1 ) , q l p ( 2 ) , , q l p ( n ) )
= ( 1 1 1 + g = 1 n W g ( μ l p ( g ) ) 2 1 ( μ l p ( g ) ) 2 γ 1 γ , 1 1 + g = 1 n W g 1 ν l p ( g ) ν l p ( g ) γ 1 γ ) .
In Equation (1), we considered γ = 1 as in Dombi’s t-norm and t-conorm, and we have chosen γ = 1 , to obtain the corresponding clumped PFPR Q = ( q l p ) 4 × 4 , which is shown in Table 5.
The PFDN D , corresponding to clumped PFPR Q , is drawn in Figure 14.
Under the condition μ l p 0.5 ( l , p = 1 , 2 , 3 , 4 ) , a partial directed network D ˙ is drawn in Figure 15.
The out-degrees out-d ( F l ) ( l = 1 , 2 , 3 , 4 ) of all textile industries in the partial graph are calculated as:
out d ( F 1 ) = ( 2.4349 , 0.4987 ) , out d ( F 2 ) = ( 1.2169 , 0.8890 ) ,
out d ( F 2 ) = ( 0 , 0 ) , out d ( F 4 ) = ( 1.5968 , 0.6218 ) .
According to the membership value of out-degrees out-d ( F l ) ( l = 1 , 2 , 3 , 4 ) , we get the optimal ranking order of the four leading textile industries F l as:
F 1 F 4 F 2 F 3 .
On the basis of ranking, we conclude that F 1 is the most profitable textile industry among all.
If the geometric averaging (PDFWGA) operator [47] is utilized in place of the PDFWAA operator, then the clumped PFN q l p = ( μ l p , ν l p ) ( l , p = 1 , 2 , 3 , 4 ) of the textile industry F l over textile industry F p regarding all considered criteria C ( g ) ( g = 1 , 2 , 3 , 4 , is obtained by using Equation (2).
q l p = PDFWGA ( q l p ( 1 ) , q l p ( 2 ) , , q l p ( n ) )
= ( 1 1 + g = 1 n W g 1 μ l p ( g ) μ l p ( g ) γ 1 γ , 1 1 1 + g = 1 n W g ( ν l p ( g ) ) 2 1 ( ν l p ( g ) ) 2 γ 1 γ ) .
For γ = 1 , the corresponding clumped PFPR Q = ( q l p ) 4 × 4 is represented in Table 6.
The PFDN D , concerning clumped PFPR Q , is drawn in Figure 16.
Under the condition μ l p 0.5 ( l , p = 1 , 2 , 3 , 4 ) , a partial directed network D ˙ is drawn in Figure 17.
The out-degrees out-d ( F l ) ( l = 1 , 2 , 3 , 4 ) of all textile industries in the partial graph are calculated as:
out d ( F 1 ) = ( 2.4026 , 0.5635 ) , out d ( F 2 ) = ( 0 , 0 ) ,
out d ( F 3 ) = ( 0 , 0 ) , out d ( F 4 ) = ( 1.4993 , 0.7780 ) .
According to the membership value of out-degrees out-d ( F l ) ( l = 1 , 2 , 3 , 4 ) , we get the optimal ranking order of the four leading textile industries F l as:
F 1 F 4 F 2 F 3 .
On the basis of ranking, we conclude that F 1 is the most profitable textile industry among all.
Our proposed technique for multi-criteria decision making is displayed in the following Algorithm 1.
Algorithm 1 The algorithm for the selection of a leading textile industry.
INPUT: A discrete set of feasible alternatives F = { f 1 , f 2 , , f m } , a set of conflicting criteria C = { c 1 , c 2 , , c n } in order to achieve the target with weight vector W = { w 1 , w 2 , , w n } , and construction of PFPR Q ( g ) = ( q l p ( g ) ) m × m corresponding to each considered criteria.
OUTPUT: The selection of the optimal alternative.
  • begin
  • Aggregate all q l p ( g ) = ( μ l p ( g ) , ν l p ( g ) ) ( l , p = 1 , 2 , , m ) regarding criteria C g ( g = 1 , 2 , 3 , 4 ) , and get the PFPR Q = ( q l p ) m × m , where q l p = ( μ l p , ν l p ) is the PFE of the alternative f l over the alternative f p with respect to all the considered criteria C g by using the PDFWAA operator:
    q l p = PDFWAA ( q l p ( 1 ) , q l p ( 2 ) , , q l p ( n ) ) = 1 1 1 + g = 1 n W g ( μ l p ( g ) ) 2 1 ( μ l p ( g ) ) 2 γ 1 γ , 1 1 + g = 1 n W g 1 ν l p ( g ) ν l p ( g ) γ 1 γ , l , p = 1 , 2 , 3 , , m .
    or the PDFWGA operator:
    q l p = PDFWGA ( q l p ( 1 ) , q l p ( 2 ) , , q l p ( n ) ) = 1 1 + g = 1 n W g 1 μ l p ( g ) μ l p ( g ) γ 1 γ , 1 1 1 + g = 1 n W g ( ν l p ( g ) ) 2 1 ( ν l p ( g ) ) 2 γ 1 γ , l , p = 1 , 2 , 3 , , m .
  • Draw the PFDN D , regarding the aggregated PFPR Q .
  • Under the condition μ l p 0.5 ( l , p = 1 , 2 , , m ) , draw the Pythagorean fuzzy partial directed graph D ˙ .
  • Calculate the out degrees out-d( f l ) ( l = 1 , 2 , , m ) of all the alternatives f l in the Pythagorean fuzzy partial directed graph D ˙ .
  • Put alternatives f l ( l = 1 , 2 , , m ) in order with regard to decreasing values of the membership degrees of out-d( f l ).
  • Alternative with the maximum membership degree of out-d( f l ) is the optimal alternative.
  • end
Algorithm 1 is also presented by a flowchart (Figure 18) for better understanding of the technique.
One can see that the ranking in Section 3.1 is with respect to a particular value of operational parameter γ = 1 . For distinct values of operational parameter γ , the stability of the ranking methodology may be noted and studied by considering a simulation study over the variety of values of the operational parameter depending on the needs.

3.2. Comparative Analysis

In this subsection, a comparative analysis is made between the newly proposed and exiting MCDM techniques. The Pythagorean fuzzy weighted average (PFWA) operator and the Pythagorean fuzzy weighted geometric (PFWG) operator introduced by Yager [16] are applied for solving the above decision-making problem. The ranking based on the techniques used is given in the following Table 7.
Furthermore, Table 7 exhibits that the decision results based on the existing PFWA and PFWG techniques were consistent with our proposed PDFWAA and PDFWGA technique, which depicts the reliability of the technique.

4. Conclusions

Graph models are extensively found everywhere in natural and human made structures such as process dynamics in physical, biological, and social systems and for modeling relations. PF models are more versatile and practical. It is seen that restrictions 0 μ 1 , 0 μ + ν 1 on FG and IFG, respectively, confine the area of these graphs to describe uncertain information that appears in the real world. PFGs with a constraint 0 μ 2 + ν 2 1 , a generalized form, have extra spaces between membership and non-membership grades. This model gives more compatibility and precision to the system as compared to the fuzzy and intuitionistic fuzzy models. In this research article, the excellent flexibility of operational parameter λ of Dombi operators in graph theoretical conceptions under the PF environment was observed. As the graph product is a technique that merges two graphs and produces a unique graph, hence on the basis of this, some basic graph products, in particular the direct product, semi-strong product, Cartesian product, strong product, and composition, for unifying two PDFGs, were introduced. By utilizing these products, various kinds of structural forms and models could be fused to provide a better one. For the organization process of space structures, these products may be very helpful. Further, we showed that the Cartesian product, strong product, semi-strong product, and the composition of two PDFGs were not PDFGs. Despite that if these graph products had crisp vertices, they were PDFGs. Meanwhile, these outcomes were taken on PDFGs maintaining the strongness property. Many decision-making situations can be easily solved by considering a variety of values of operational parameters. An incentive approach towards a decision-making problem related to the selection of a leading textile industry was adopted in our work. We hope this paper will help researchers to see the field of PDFGs at a glance. For further research, the vertex and edge regularity of these graph operations can be discussed.

Author Contributions

Investigation, M.A., J.M.D. and S.S.; Writing—original draft, M.A. and J.M.D.; Writing—review and editing, S.S.

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. Hamacher, H. On Logical Aggregations of Non-Binar Explicit Decision Criteria; Rita, G., Ed.; Fischer Verlag: Frankfurt, Germany, 1978. [Google Scholar]
  3. Kuwagaki, A. Sur l’équation fonctionnelle f(x + y) = R{f(x), f(y)}. Mem. Coll. Sci. Univ. Kyoto Ser. A Math. 1950, 26, 139–144. Available online: https://projecteuclid.org/download/pdf_1/euclid.kjm/1250777986 (accessed on 13 December 2019). [CrossRef]
  4. Menger, K. Statistical metrics. J. Natl. Acad. Sci. 1942, 28, 535–537. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  5. Schweizer, B.; Sklar, S. Probabilistic Metric Spaces; Elsevier: Amsterdam, The Netherlands, 1983. [Google Scholar]
  6. Alsina, C.; Trillas, E.; Valverde, L. On some logical connectives for fuzzy sets theory. J. Math. Anal. Appl. 1983, 93, 15–26. [Google Scholar] [CrossRef] [Green Version]
  7. Klement, P.E.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic: Dordrecht, The Netherlands, 2000. [Google Scholar]
  8. Hamacher, H. Logical combinations of fuzzy statements and their relative valuation functions. Cybern. Syst. Res. 1978, 3, 276–288. [Google Scholar]
  9. Dubois, D.; Ostasiewicz, W.; Prade, H. Fuzzy Sets: History and Basic Notions; Springer: Boston, MA, USA, 2000. [Google Scholar]
  10. Rosenfeld, A. Fuzzy graphs. In Fuzzy Sets and Their Applications to Cognitive and Decision Processes; Zadeh, L.A., Fu, K.S., Shimura, M., Eds.; Academic Press: Cambridge, MA, USA, 1975; pp. 77–95. [Google Scholar]
  11. Mordeson, J.N.; Peng, C.S. Operations on fuzzy graphs. Inf. Sci. 1994, 79, 159–170. [Google Scholar] [CrossRef]
  12. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  13. Shannon, A.; Atanassov, K.T. A first step to a theory of intuitioistic fuzzy graphs. In Proceedings of the First Workshop on Fuzzy Based Expert Systems, Sofia, Bulgaria, 28–30 September 1994; pp. 59–61. [Google Scholar]
  14. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  15. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  16. Yager, R.R. Pythagorean membership grades in multi-criteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  17. Zhang, X.; Xu, Z. Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  18. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  19. Akram, M.; Dudek, W.A.; Ilyas, F. Group decision-making based on Pythagorean fuzzy TOPSIS method. Int. J. Intell. Syst. 2019. [Google Scholar] [CrossRef]
  20. Akram, M.; Ilyas, F.; Garg, H. Multi-criteria group decision making based on ELECTRIC I method in Pythagorean fuzzy information. Soft Comput. 2019. [Google Scholar] [CrossRef]
  21. Rangasamy, P.; Palaniappan, N. Some operations on intuitionistic fuzzy sets of second type. Notes Intuitionistic Fuzzy Sets 2003, 10, 1–19. [Google Scholar]
  22. Ren, P.; Xu, Z.; Gou, X. Pythagorean fuzzy TODIM approach to multi-criteria decision making. Appl. Soft Comput. 2016, 42, 246–259. [Google Scholar] [CrossRef]
  23. Peng, X.; Selvachandran, G. Pythagorean fuzzy set: State of the art and future directions. Artifical Intell. Rev. 2017. [Google Scholar] [CrossRef]
  24. Garg, H. A new exponential operational laws and their aggregation operators of interval-valued Pythagorean fuzzy information. Int. J. Intell. Syst. 2018, 33, 653–683. [Google Scholar] [CrossRef]
  25. Garg, H. Some methods for strategic decision-making problems with immediate probabilities in Pythagorean fuzzy environment. Int. J. Intell. Syst. 2018, 33, 687–712. [Google Scholar] [CrossRef]
  26. Garg, H. Linguistic Pythagorean fuzzy sets and its applications in multi attribute decision making process. Int. J. Intell. Syst. 2018, 33, 1234–1263. [Google Scholar] [CrossRef]
  27. Garg, H. Hesitant Pythagorean fuzzy sets and their aggregation operators in multiple-attribute decision-making. Int. J. Uncertain. Quantif. 2018, 8, 267–289. [Google Scholar] [CrossRef]
  28. Garg, H. A novel correlation coefficients between Pythagorean fuzzy sets and its applications to decision-making processes. Int. J. Intell. Syst. 2016, 31, 1234–1253. [Google Scholar] [CrossRef]
  29. Naz, S.; Ashraf, S.; Akram, M. A novel approach to decision-making with Pythagorean fuzzy information. Mathematics 2018, 6, 95. [Google Scholar] [CrossRef] [Green Version]
  30. Verma, R.; Merigo, J.M.; Sahni, M. Pythagorean fuzzy graphs: Some results. arXiv 2018, arXiv:1806.06721v1. [Google Scholar]
  31. Akram, M.; Naz, S. Energy of Pythagorean fuzzy graphs with applications. Mathematics 2018, 6, 136. [Google Scholar] [CrossRef] [Green Version]
  32. Akram, M.; Habib, A.; Ilyas, F.; Dar, J.M. Specific types of Pythagorean fyzzy graphs and application to decision-making. Math. Comput. Appl. 2018, 23, 42. [Google Scholar] [CrossRef] [Green Version]
  33. Akram, M.; Dar, J.M.; Naz, S. Certain graphs under Pythagorean fuzzy environment. Complex Intell. Syst. 2019, 5, 127–144. [Google Scholar] [CrossRef]
  34. Akram, M.; Dar, J.M.; Farooq, A. Planar graphs under Pythagorean fuzzy environment. Mathematics 2018, 6, 278. [Google Scholar] [CrossRef] [Green Version]
  35. Akram, M.; Ilyas, F.; Saeid, A.B. Certain notions of Pythagorean fuzzy graphs. J. Intell. Fuzzy Syst. 2019, 36, 5857–5874. [Google Scholar] [CrossRef]
  36. Naz, S.; Rashmanlou, H.; Malik, M.A. Operations on single-valued neutrosophic graphs with application. J. Intell. Fuzzy Syst. 2017, 32, 2137–2151. [Google Scholar] [CrossRef]
  37. Akram, M.; Habib, A. q-Rung picture fuzzy graphs: A creative view on regularity with applications. J. Appl. Math. Comput. 2019, 61, 235–280. [Google Scholar] [CrossRef]
  38. Habib, A.; Akram, M.; Farooq, A. q-Rung orthopair fuzzy competition graphs with application in the soil ecosystem. Mathematics 2019, 7, 91. [Google Scholar] [CrossRef] [Green Version]
  39. Akram, M.; Habib, A.; Koam, A.N. A novel description on edge-regular q-rung picture fuzzy graphs with application. Symmetry 2019, 11, 489. [Google Scholar] [CrossRef] [Green Version]
  40. Dombi, J. A general class of fuzzy operators, the DeMorgan class of fuzzy operators and fuzziness measures induced by fuzzy operators. Fuzzy Sets Syst. 1982, 8, 149–163. [Google Scholar] [CrossRef]
  41. Dombi, J. Towards a general class of operators for fuzzy systems. IEEE Trans. Fuzzy Syst. 2008, 16, 477–484. [Google Scholar] [CrossRef]
  42. Chen, J.; Ye, J. Some single-valued neutrosophic Dombi weighted aggregation operators for multiple attribute decision-making. Symmetry 2017, 9, 82. [Google Scholar] [CrossRef]
  43. Shi, L.; Ye, J. Dombi aggregation operators of neutrosophic cubic sets for multiple attribute decision-making. Algorithms 2018, 11, 29. [Google Scholar] [CrossRef] [Green Version]
  44. Jana, C.; Pal, M.; Wang, J. Bipolar fuzzy Dombi aggregation operators and its application in multiple-attribute decision-making process. J. Ambient Intell. Humaniz. Comput. 2018. [Google Scholar] [CrossRef]
  45. Liu, P.D.; Liu, J.L.; Chen, S.M. Some intuitionistic fuzzy Dombi Bonferroni mean operators and their application to multi-attribute group decision making. J. Oper. Res. Soc. 2018, 69, 1–24. [Google Scholar] [CrossRef]
  46. He, X. Typhoon disaster assessment based on Dombi hesitant fuzzy information aggregation operators. Nat. Hazards 2018, 90, 1153–1175. [Google Scholar] [CrossRef]
  47. Akram, M.; Dudek, W.A.; Dar, J.M. Pythagorean Dombi fuzzy aggregation operators with application in multi-criteria decision-making. Int. J. Intell. Syst. 2019. [Google Scholar] [CrossRef]
  48. Ashraf, S.; Naz, S.; Kerre, E.E. Dombi fuzzy graphs. Fuzzy Inf. Eng. 2018, 10, 58–79. [Google Scholar] [CrossRef] [Green Version]
  49. Akram, M.; Dar, J.M.; Naz, S. Pythagorean Dombi fuzzy graphs. Complex Intell. Syst. 2019, 1–26. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Pythagorean Dombi fuzzy graphs.
Figure 1. Pythagorean Dombi fuzzy graphs.
Mca 24 00102 g001
Figure 2. Direct product of two PDFGs.
Figure 2. Direct product of two PDFGs.
Mca 24 00102 g002
Figure 3. Cartesian product of two PDFGs.
Figure 3. Cartesian product of two PDFGs.
Mca 24 00102 g003
Figure 4. Pythagorean Dombi fuzzy edge graphs.
Figure 4. Pythagorean Dombi fuzzy edge graphs.
Mca 24 00102 g004
Figure 5. Cartesian product of two PDFEGs.
Figure 5. Cartesian product of two PDFEGs.
Mca 24 00102 g005
Figure 6. G 1 G 2 is not a PDFG.
Figure 6. G 1 G 2 is not a PDFG.
Mca 24 00102 g006
Figure 7. Semi-strong product of two PDFEGs.
Figure 7. Semi-strong product of two PDFEGs.
Mca 24 00102 g007
Figure 8. G 1 G 2 is not a PDFG.
Figure 8. G 1 G 2 is not a PDFG.
Mca 24 00102 g008
Figure 9. Strong product of two PDFEGs.
Figure 9. Strong product of two PDFEGs.
Mca 24 00102 g009
Figure 10. G 1 G 2 is not a PDFG.
Figure 10. G 1 G 2 is not a PDFG.
Mca 24 00102 g010
Figure 11. Composition of two PDFEGs.
Figure 11. Composition of two PDFEGs.
Mca 24 00102 g011
Figure 12. G 1 G 2 is not a PDFG.
Figure 12. G 1 G 2 is not a PDFG.
Mca 24 00102 g012
Figure 13. Directed network of PFPRs.
Figure 13. Directed network of PFPRs.
Mca 24 00102 g013
Figure 14. Directed network of clumped PFPR.
Figure 14. Directed network of clumped PFPR.
Mca 24 00102 g014
Figure 15. Partial directed network of clumped PFPR.
Figure 15. Partial directed network of clumped PFPR.
Mca 24 00102 g015
Figure 16. Directed network of clumped PFPR.
Figure 16. Directed network of clumped PFPR.
Mca 24 00102 g016
Figure 17. Partial directed network of clumped PFPR.
Figure 17. Partial directed network of clumped PFPR.
Mca 24 00102 g017
Figure 18. Flowchart of the proposed technique.
Figure 18. Flowchart of the proposed technique.
Mca 24 00102 g018
Table 1. Pythagorean fuzzy preference relation (PFPR) regarding the criterion “durability of fabric”.
Table 1. Pythagorean fuzzy preference relation (PFPR) regarding the criterion “durability of fabric”.
Q ( 1 ) F 1 F 2 F 3 F 4
F 1      ( 0.5 , 0.5 )      ( 0.8 , 0.2 )      ( 0.9 , 0.1 )      ( 0.8 , 0.1 )
F 2      ( 0.2 , 0.8 )      ( 0.5 , 0.5 )      ( 0.7 , 0.3 )      ( 0.5 , 0.7 )
F 3      ( 0.1 , 0.9 )      ( 0.3 , 0.7 )      ( 0.5 , 0.5 )      ( 0.3 , 0.8 )
F 4      ( 0.1 , 0.8 )      ( 0.7 , 0.5 )      ( 0.8 , 0.3 )      ( 0.5 , 0.5 )
Table 2. PFPR regarding the criterion “price of fabric”.
Table 2. PFPR regarding the criterion “price of fabric”.
Q ( 2 ) F 1 F 2 F 3 F 4
F 1      ( 0.5 , 0.5 )      ( 0.7 , 0.3 )      ( 0.0 , 0.2 )      ( 0.8 , 0.2 )
F 2      ( 0.3 , 0.7 )      ( 0.5 , 0.5 )      ( 0.8 , 0.1 )      ( 0.6 , 0.6 )
F 3      ( 0.2 , 0.9 )      ( 0.1 , 0.8 )      ( 0.5 , 0.5 )      ( 0.1 , 0.9 )
F 4      ( 0.2 , 0.8 )      ( 0.6 , 0.6 )      ( 0.9 , 0.1 )      ( 0.5 , 0.5 )
Table 3. PFPR regarding the criterion “moisture absorption and heat conductivity”.
Table 3. PFPR regarding the criterion “moisture absorption and heat conductivity”.
Q ( 3 ) F 1 F 2 F 3 F 4
F 1      ( 0.5 , 0.5 )      ( 0.7 , 0.2 )      ( 0.8 , 0.1 )      ( 0.7 , 0.2 )
F 2      ( 0.2 , 0.7 )      ( 0.5 , 0.5 )      ( 0.5 , 0.6 )      ( 0.4 , 0.7 )
F 3      ( 0.1 , 0.8 )      ( 0.6 , 0.5 )      ( 0.5 , 0.5 )      ( 0.1 , 0.9 )
F 4      ( 0.2 , 0.7 )      ( 0.7 , 0.4 )      ( 0.9 , 0.1 )      ( 0.5 , 0.5 )
Table 4. PFPR regarding the criterion “appearance and style of the fabric”.
Table 4. PFPR regarding the criterion “appearance and style of the fabric”.
Q ( 4 ) F 1 F 2 F 3 F 4
F 1      ( 0.5 , 0.5 )      ( 0.8 , 0.3 )      ( 0.9 , 0.2 )      ( 0.8 , 0.2 )
F 2      ( 0.3 , 0.8 )      ( 0.5 , 0.5 )      ( 0.4 , 0.7 )      ( 0.3 , 0.9 )
F 3      ( 0.2 , 0.9 )      ( 0.7 , 0.4 )      ( 0.5 , 0.5 )      ( 0.5 , 0.6 )
F 4      ( 0.2 , 0.8 )      ( 0.9 , 0.3 )      ( 0.6 , 0.5 )      ( 0.5 , 0.5 )
Table 5. Clumped Pythagorean fuzzy preference relation.
Table 5. Clumped Pythagorean fuzzy preference relation.
Q F 1 F 2 F 3 F 4
F 1      ( 0.5000 , 0.5000 )      ( 0.7602 , 0.2308 )      ( 0.8889 , 0.1250 )      ( 0.7858 , 0.1429 )
F 2      ( 0.2463 , 0.7467 )      ( 0.5000 , 0.5000 )      ( 0.7077 , 0.2079 )      ( 0.5092 , 0.6811 )
F 3      ( 0.1490 , 0.8781 )      ( 0.4481 , 0.6264 )      ( 0.5000 , 0.5000 )      ( 0.2688 , 0.8182 )
F 4      ( 0.1682 , 0.7778 . )      ( 0.7345 , 0.4687 )      ( 0.8623 , 0.1531 )      ( 0.5000 , 0.5000 )
Table 6. Clumped Pythagorean fuzzy preference relation.
Table 6. Clumped Pythagorean fuzzy preference relation.
Q F 1 F 2 F 3 F 4
F 1      ( 05000 , 0.5000 )      ( 0.7467 , 0.2463 )      ( 0.8781 , 0.1490 )      ( 0.7778 , 0.1682 )
F 2      ( 0.2308 , 0.7602 )      ( 0.5000 , 0.5000 )      ( 0.6264 , 0.4481 )      ( 0.4687 , 0.7345 )
F 3      ( 0.1250 , 0.8889 )      ( 0.2079 , 0.7077 )      ( 0.5000 , 0.5000 )      ( 0.1531 , 0.8623 )
F 4      ( 0.1429 , 0.7858 )      ( 0.6811 , 0.5092 )      ( 0.8182 , 0.2688 )      ( 0.5000 , 0.5000 )
Table 7. Different techniques for the decision results of the alternatives. PFWA, Pythagorean fuzzy weighted average; PFWG, Pythagorean fuzzy weighted geometric operator; PDFWAA, Pythagorean Dombi fuzzy weighted arithmetic averaging operator; PDFWGA, Pythagorean Dombi fuzzy weighted geometric averaging operator.
Table 7. Different techniques for the decision results of the alternatives. PFWA, Pythagorean fuzzy weighted average; PFWG, Pythagorean fuzzy weighted geometric operator; PDFWAA, Pythagorean Dombi fuzzy weighted arithmetic averaging operator; PDFWGA, Pythagorean Dombi fuzzy weighted geometric averaging operator.
Techniques Ranking of Alternatives
Existing PFWA Technique [16] F 1 F 4 F 2 F 3
  Existing PFWG Technique [16] F 1 F 4 F 2 F 3
Our Proposed PDFWAA Technique F 1 F 4 F 2 F 3
Our Proposed PDFWGA Technique F 1 F 4 F 2 F 3

Share and Cite

MDPI and ACS Style

Akram, M.; Mohsan Dar, J.; Shahzadi, S. Decision Making Approach under Pythagorean Dombi Fuzzy Graphs for Selection of Leading Textile Industry. Math. Comput. Appl. 2019, 24, 102. https://doi.org/10.3390/mca24040102

AMA Style

Akram M, Mohsan Dar J, Shahzadi S. Decision Making Approach under Pythagorean Dombi Fuzzy Graphs for Selection of Leading Textile Industry. Mathematical and Computational Applications. 2019; 24(4):102. https://doi.org/10.3390/mca24040102

Chicago/Turabian Style

Akram, Muhammad, Jawaria Mohsan Dar, and Sundas Shahzadi. 2019. "Decision Making Approach under Pythagorean Dombi Fuzzy Graphs for Selection of Leading Textile Industry" Mathematical and Computational Applications 24, no. 4: 102. https://doi.org/10.3390/mca24040102

Article Metrics

Back to TopTop