Next Article in Journal
Computing Topological Indices and Polynomials for Line Graphs
Previous Article in Journal
Explicit Baker–Campbell–Hausdorff Expansions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Energy of Pythagorean Fuzzy Graphs with Applications

Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(8), 136; https://doi.org/10.3390/math6080136
Submission received: 6 July 2018 / Revised: 29 July 2018 / Accepted: 7 August 2018 / Published: 10 August 2018

Abstract

:
Pythagorean fuzzy sets (PFSs), an extension of intuitionistic fuzzy sets (IFSs), inherit the duality property of IFSs and have a more powerful ability than IFSs to model the obscurity in practical decision-making problems. In this research study, we compute the energy and Laplacian energy of Pythagorean fuzzy graphs (PFGs) and Pythagorean fuzzy digraphs (PFDGs). Moreover, we derive the lower and upper bounds for the energy and Laplacian energy of PFGs. Finally, we present numerical examples, including the design of a satellite communication system and the evaluation of the schemes of reservoir operation to illustrate the applications of our proposed concepts in decision making.

1. Introduction

Yager recently [1,2] introduced the concept of the Pythagorean fuzzy set (PFS) as a generalization of the intuitionistic fuzzy set (IFS) [3], to manage the complex impreciseness and uncertainty in practical decision-making problems. The prominent characteristic of the Pythagorean fuzzy model is to relax the condition that the sum of its membership degree and non-membership degree is no greater than one with the square sum of its membership degree and non-membership degree no greater than one. After the inception of PFS by Yager [2], Zhang and Xu [4] presented the mathematical form of the PFS and introduced the concept of the Pythagorean fuzzy number (PFN). Meanwhile, they presented a series of basic operational laws of PFNs and proposed the Pythagorean fuzzy aggregation operators. PFS, a novel class of the non-standard fuzzy set, has a wide range of applications in different fields, such as medical diagnosis [5], Internet stock investment [6], the service quality of domestic airlines [4] and the governor selection of the Asian Infrastructure Investment Bank [7].
Graph representations are generally used for dealing with structural information, in different domains such as operations research, networks, systems analysis, pattern recognition, economics and image interpretation. Gutman [8] introduced the notion of the energy of a graph in chemistry, because of its relevance to the total π -electron energy of certain molecules and found upper and lower bounds for the energy of graphs [9]. In chemistry, the energy of a given molecular graph is interesting because of its relation to the total π -electron energy of the molecule represented by that graph. A graph with all isolated vertices K n c has zero energy, while the complete graph K n with n vertices has energy 2 ( n 1 ) . Later, Gutman and Zhou [10] defined the Laplacian energy of a graph as the sum of the absolute values of the differences of the average vertex degree of G to the Laplacian eigenvalues of G. When there is obscureness in the description of the objects, or in their relations, or in both, the fuzzy graph model is put forward naturally. The concept of fuzzy graphs was initiated by Kaufmann [11], based on Zadeh’s fuzzy relations [12]. Rosenfeld [13] discussed the concept of the fuzzy graph and developed its structure. The energy of a fuzzy graph was investigated in [14] by Anjali and Mathew. The Laplacian energy of a fuzzy graph was defined by Sharbaf and Fayazi [15]. Parvathi and Karunambigai [16] generalized the concept of a fuzzy graph to an intuitionistic fuzzy graph (IFG). Later, IFGs were discussed by Akram and Davvaz [17]. Praba et al. [18] defined the energy of IFGs as an extension of [14]. Basha and Kartheek [19] generalized the concept of the Laplacian energy of a fuzzy graph to the Laplacian energy of an IFG. Akram et al. [20,21,22,23,24,25,26] put forward many new concepts concerning the extended structures of fuzzy graphs and provided their pertinent applications in decision-making. Recently, Naz et al. [27] proposed the concept of Pythagorean fuzzy graphs (PFGs), a generalization of the notion of Akram and Davvaz IFGs [17], along with its applications in decision-making. The Pythagorean fuzzy model is more flexible and practical than fuzzy and intuitionistic fuzzy models. Therefore, in this research study, we introduce certain novel concepts, including the energy and Laplacian energy of PFGs, as well as the energy and Laplacian energy of Pythagorean fuzzy digraphs (PFDGs). We illustrate these concepts with examples. We investigate some of their interesting properties. In particular, we solve decision-making problems concerning the design of a satellite communication system and the evaluation of the schemes of reservoir operation to illustrate the applicability and effectiveness of our proposed notions.
The paper is structured as follows: Section 2 proposes the concept of the energy of a PFG and investigates its properties. Section 3 puts forward the Laplacian energy of a PFG based on its Laplacian eigenvalues. Section 4 generalizes the concepts of energy and Laplacian energy to PFDGs. Section 5 is reserved for demonstrating the use of the proposed concepts of energy and Laplacian energy in decision-making, and finally, we draw conclusions in Section 6.
Throughout this paper, Z represents a crisp universe of generic elements, G stands for the crisp graph, G is the PFG and D is the PFDG.
Definition 1
([2,28]). Let Z be a fixed set. A PFS P in Z is expressed as the following mathematical symbol:
P = { z , μ P ( z ) , ν P ( z ) | z Z } ,
characterized by a membership function μ P and a non-membership function ν P , where:
μ P : Z [ 0 , 1 ] , z Z μ P ( z ) [ 0 , 1 ] ν P : Z [ 0 , 1 ] , z Z ν P ( z ) [ 0 , 1 ]
such that 0 μ P 2 ( z ) + ν P 2 ( z ) 1 for all z Z . Moreover, for all z Z , π P ( z ) = 1 μ P 2 ( z ) ν P 2 ( z ) is called a Pythagorean fuzzy index or degree of hesitancy of z in P .
For computational convenience, β = ( μ β , ν β ) is called a PFN [4], where μ β , ν β [ 0 , 1 ] , μ β 2 + ν β 2 1 and π β = 1 μ β 2 ν β 2 .
The key difference between the intuitionistic fuzzy number (IFN) [29] and PFN is their different constraint conditions, that is the constraint conditions of IFN and PFN are μ α + ν α 1 and μ β 2 + ν β 2 1 , respectively. Since for any point ( r , s ) ( r , s [ 0 , 1 ] ) , if r + s 1 , then r 2 + s 2 1 , so the space of PFS’s membership degree is greater than the space of IFS’s membership degree, as shown in Figure 1.
For more definitions and terminologies, the readers are referred to [30,31,32,33,34,35,36,37,38,39,40,41].

2. Energy of Pythagorean Fuzzy Graphs

In this section, we define the energy of a graph under Pythagorean fuzzy circumstances and investigate its properties.
Definition 2
([27]). A PFG on a non-empty set Z is a pair G = ( P , Q ) , where P is a PFS on Z and Q is a Pythagorean fuzzy relation on Z such that:
μ Q ( y z ) min { μ P ( y ) , μ P ( z ) } , ν Q ( y z ) max { ν P ( y ) , ν P ( z ) }
and 0 μ Q 2 ( y z ) + ν Q 2 ( y z ) 1 for all y , z Z . We call P and Q the Pythagorean fuzzy vertex set and the Pythagorean fuzzy edge set of G , respectively. Here, Q is a symmetric Pythagorean fuzzy relation on P . If Q is not symmetric on P , then D = ( P , Q ) is called PFDG.
Example 1.
Consider a graph G = ( V , E ) , where V = { z 1 , z 2 , z 3 , z 4 , z 5 , z 6 } is the vertex set and E = { z 1 z 2 , z 1 z 3 , z 1 z 4 , z 1 z 5 , z 1 z 6 , z 2 z 3 , z 3 z 4 , z 4 z 5 , z 5 z 6 } is the edge set of G. Let G = ( P , Q ) be a PFG on V, as shown in Figure 2, defined by:
P = z 1 0.8 , z 2 0.7 , z 3 0.5 , z 4 0.8 , z 5 0.7 , z 6 0.4 , z 1 0.5 , z 2 0.4 , z 3 0.6 , z 4 0.3 , z 5 0.4 , z 6 0.3 , Q = z 1 z 2 0.3 , z 1 z 3 0.4 , z 1 z 4 0.7 , z 1 z 5 0.4 , z 1 z 6 0.3 , z 2 z 3 0.4 , z 3 z 4 0.5 , z 4 z 5 0.6 , z 5 z 6 0.4 , z 1 z 2 0.8 , z 1 z 3 0.7 , z 1 z 4 0.6 , z 1 z 5 0.5 , z 1 z 6 0.6 , z 2 z 3 0.9 , z 3 z 4 0.7 , z 4 z 5 0.6 , z 5 z 6 0.9 .
Definition 3.
The adjacency matrix A ( G ) = ( A ( μ Q ( z i z j ) ) , A ( ν Q ( z i z j ) ) ) of a PFG G = ( P , Q ) is defined as a square matrix A ( G ) = [ a i j ] , a i j = ( μ Q ( z i z j ) , ν Q ( z i z j ) ) , where μ Q ( z i z j ) and ν Q ( z i z j ) represent the strength of relationship and strength of non-relationship between z i and z j , respectively.
Definition 4.
The spectrum of adjacency matrix of a PFG A ( G ) is defined as ( S , T ) , where S and T are the sets of eigenvalues of A ( μ Q ( z i z j ) ) and A ( ν Q ( z i z j ) ) , respectively.
Definition 5.
The energy of a PFG G = ( P , Q ) is defined as:
E ( G ) = E ( μ Q ( z i z j ) ) , E ( ν Q ( z i z j ) ) = i = 1 λ i S n | λ i | , i = 1 ζ i T n | ζ i | .
Example 2.
The adjacency matrix of a PFG given in Figure 2 is:
A ( G ) = ( 0 , 0 ) ( 0.3 , 0.8 ) ( 0.4 , 0.7 ) ( 0.7 , 0.6 ) ( 0.4 , 0.5 ) ( 0.3 , 0.6 ) ( 0.3 , 0.8 ) ( 0 , 0 ) ( 0.4 , 0.9 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0.4 , 0.9 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.7 , 0.6 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0 , 0 ) ( 0.6 , 0.6 ) ( 0 , 0 ) ( 0.4 , 0.5 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.6 ) ( 0 , 0 ) ( 0.4 , 0.9 ) ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.9 ) ( 0 , 0 ) .
The spectrum and the energy of a PFG G , given in Figure 2, are as follows:
S p e c ( μ Q ( z i z j ) ) = { 0.9522 , 0.5665 , 0.3997 , 0.0031 , 0.4017 , 1.5137 } , S p e c ( ν Q ( z i z j ) ) = { 1.3553 , 0.9082 , 0.8959 , 0.0534 , 0.9017 , 2.2044 } .
Therefore,
S p e c ( G ) = { ( 0.9522 , 1.3553 ) , ( 0.5665 , 0.9082 ) , ( 0.3997 , 0.8959 ) , ( 0.0031 , 0.0534 ) , ( 0.4017 , 0.9017 ) , ( 1.5137 , 2.2044 ) } .
Now, E ( μ Q ( z i z j ) ) = 3.8369 and E ( ν Q ( z i z j ) ) = 6.3190 .
Therefore, E ( G ) = ( 3.8369 , 6.3190 ) .
Theorem 1.
Let G = ( P , Q ) be a PFG and A ( G ) be its adjacency matrix. If λ 1 λ 2 λ n and ζ 1 ζ 2 ζ n are the eigenvalues of A ( μ Q ( z i z j ) ) and A ( ν Q ( z i z j ) ) , respectively, then:
(i) 
i = 1 λ i S n λ i = 0 and i = 1 ζ i T n ζ i = 0 .
(ii) 
i = 1 λ i S n λ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 and i = 1 ζ i T n ζ i 2 = 2 1 i < j n ( ν Q ( z i z j ) ) 2 .
Proof. 
(i) 
Since A ( G ) is a symmetric matrix with zero trace, its eigenvalues are real with the sum equal to zero.
(ii) 
By the trace properties of a matrix, we have:
t r ( ( A ( μ Q ( z i z j ) ) ) 2 ) = i = 1 λ i S n λ i 2
where:
t r ( ( A ( μ Q ( z i z j ) ) ) 2 ) = 0 + ( μ Q ( z 1 z 2 ) ) 2 + + ( μ Q ( z 1 z n ) ) 2 + ( μ Q ( z 2 z 1 ) ) 2 + 0 + + ( μ Q ( z 2 z n ) ) 2 + ( μ Q ( z n z 1 ) ) 2 + ( μ Q ( z n z 2 ) ) 2 + + 0 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 .
Hence:
i = 1 λ i S n λ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 .
Analogously, we can show that i = 1 ζ i T n ζ i 2 = 2 1 i < j n ( ν Q ( z i z j ) ) 2 . ☐
Example 3.
Consider a PFG G = ( P , Q ) on V = { z 1 , z 2 , z 3 , z 4 , z 5 , z 6 } , as shown in Figure 2. Then:
i = 1 λ i S 6 λ i = 0 , i = 1 ζ i T 6 ζ i = 0 . i = 1 λ i S 6 λ i 2 = 3.8400 = 2 ( 1.92 ) = 2 1 i < j 6 ( μ Q ( z i z j ) ) 2 , i = 1 ζ i T 6 ζ i 2 = 9.1400 = 2 ( 4.57 ) = 2 1 i < j 6 ( ν Q ( z i z j ) ) 2 .
We now find upper and lower bounds of the energy of a PFG G , in terms of the number of vertices and the sum of squares of membership and non-membership values of edges.
Theorem 2.
Let G = ( P , Q ) be a PFG on n vertices and A ( G ) = ( A ( μ Q ( z i z j ) ) , A ( ν Q ( z i z j ) ) ) be the adjacency matrix of G . Then:
(i) 
2 1 i < j n ( μ Q ( z i z j ) ) 2 + n ( n 1 ) | det ( A ( μ Q ( z i z j ) ) ) | 2 n E ( μ Q ( z i z j ) ) 2 n 1 i < j n ( μ Q ( z i z j ) ) 2 ;
(ii) 
2 1 i < j n ( ν Q ( z i z j ) ) 2 + n ( n 1 ) | det ( A ( ν Q ( z i z j ) ) ) | 2 n E ( ν Q ( z i z j ) ) 2 n 1 i < j n ( ν Q ( z i z j ) ) 2 .
Proof. 
(i) Upper bound:
Applying the Cauchy–Schwarz inequality to the vectors ( 1 , 1 , , 1 ) and ( | λ 1 | , | λ 2 | , , | λ n | ) with n entries, we get:
i = 1 n | λ i | n i = 1 n | λ i | 2
i = 1 n λ i 2 = i = 1 n | λ i | 2 + 2 1 i < j n λ i λ j
By comparing the coefficients of λ n 2 in the characteristic polynomial:
i = 1 n ( λ λ i ) = | A ( G ) λ I | ,
we have:
1 i < j n λ i λ j = 1 i < j n ( μ Q ( z i z j ) ) 2 .
Substituting (3) in (2), we obtain:
i = 1 n | λ i | 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 .
Substituting (4) in (1), we obtain:
i = 1 n | λ i | n 2 1 i < j n ( μ Q ( z i z j ) ) 2 = 2 n 1 i < j n ( μ Q ( z i z j ) ) 2 .
Therefore,
E ( μ Q ( z i z j ) ) 2 n 1 i < j n ( μ Q ( z i z j ) ) 2
Lower bound:
( E ( μ Q ( z i z j ) ) ) 2 = i = 1 n | λ i | 2 = i = 1 n | λ i | 2 + 2 1 i < j n | λ i λ j | = 2 1 i < j n ( μ Q ( z i z j ) ) 2 + 2 n ( n 1 ) 2 A M { | λ i λ j | }
Since A M { | λ i λ j | } G M { | λ i λ j | } , 1 i < j n , so,
E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + n ( n 1 ) G M { | λ i λ j | }
also since:
G M { | λ i λ j | } = 1 i < j n | λ i λ j | 2 n ( n 1 ) = i = 1 n | λ i | n 1 2 n ( n 1 ) = i = 1 n | λ i | 2 n = | det ( A ( μ Q ( z i z j ) ) ) | 2 n
so,
E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + n ( n 1 ) | det ( A ( μ Q ( z i z j ) ) ) | 2 n .
Thus, 2 1 i < j n ( μ Q ( z i z j ) ) 2 + n ( n 1 ) | det ( A ( μ Q ( z i z j ) ) ) | 2 n E ( μ Q ( z i z j ) ) 2 n 1 i < j n ( μ Q ( z i z j ) ) 2 .
Analogously, we can show that
2 1 i < j n ( ν Q ( z i z j ) ) 2 + n ( n 1 ) | det ( A ( ν Q ( z i z j ) ) ) | 2 n E ( ν Q ( z i z j ) ) 2 n 1 i < j n ( ν Q ( z i z j ) ) 2 .  ☐
The following result gives us the upper bound of the energy of a PFG, with the conditions n 2 1 i < j n ( μ Q ( z i z j ) ) 2 and n 2 1 i < j n ( ν Q ( z i z j ) ) 2 .
Theorem 3.
Let G = ( P , Q ) be a PFG on n vertices and A ( G ) = ( A ( μ Q ( z i z j ) ) , A ( ν Q ( z i z j ) ) ) be the adjacency matrix of G . If n 2 1 i < j n ( μ Q ( z i z j ) ) 2 and n 2 1 i < j n ( ν Q ( z i z j ) ) 2 , then:
(i) 
E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 n + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 2 1 i < j n ( μ Q ( z i z j ) ) 2 n 2 ;
(ii) 
E ( ν Q ( z i z j ) ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 n + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 2 1 i < j n ( ν Q ( z i z j ) ) 2 n 2 .
Proof. 
If A = [ a i j ] n × n is a symmetric matrix with zero trace, then λ max 2 1 i < j n a i j n , where, λ max is the maximum eigenvalue of A. If A ( G ) is the adjacency matrix of a PFG G , then λ 1 2 1 i < j n μ Q ( z i z j ) n , where λ 1 λ 2 λ n . Moreover, since:
i = 1 n λ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2
i = 2 n λ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 λ 1 2
Applying the Cauchy–Schwarz inequality to the vectors ( 1 , 1 , , 1 ) and ( | λ 1 | , | λ 2 | , , | λ n | ) with n 1 entries, we get:
E ( μ Q ( z i z j ) ) λ 1 = i = 2 n | λ i | ( n 1 ) i = 2 n | λ i | 2 .
Substituting (5) in (6), we must have:
E ( μ Q ( z i z j ) ) λ 1 ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 λ 1 2
E ( μ Q ( z i z j ) ) λ 1 + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 λ 1 2 .
Now, since the function:
F ( z ) = z + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 z 2
decreases on the interval:
2 1 i < j n ( μ Q ( z i z j ) ) 2 n , 2 1 i < j n ( μ Q ( z i z j ) ) 2 ,
also n 2 1 i < j n ( μ Q ( z i z j ) ) 2 , 1 2 1 i < j n ( μ Q ( z i z j ) ) 2 n . Therefore,
2 1 i < j n ( μ Q ( z i z j ) ) 2 n 2 1 i < j n ( μ Q ( z i z j ) ) 2 n 2 1 i < j n μ Q ( z i z j ) n λ 1 2 1 i < j n ( μ Q ( z i z j ) ) 2 .
Therefore, Equation (7) implies:
E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 n + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 2 1 i < j n ( μ Q ( z i z j ) ) 2 n 2 .
Analogously, we can show that:
E ( ν Q ( z i z j ) ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 n + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 2 1 i < j n ( ν Q ( z i z j ) ) 2 n 2 .
 ☐
Theorem 4.
Let G = ( P , Q ) be a PFG on n vertices. Then, E ( G ) n 2 ( 1 + n ) .
Proof. 
Suppose that G = ( P , Q ) is a PFG with n vertices. If n 2 1 i < j n ( μ Q ( z i z j ) ) 2 = 2 y , then by routine calculus, it is easy to show that f ( y ) = 2 y n + ( n 1 ) ( 2 y ( 2 y n ) 2 ) is maximized when y = n 2 + n n 4 . Substituting this value of y in place of y = 1 i < j n ( μ Q ( z i z j ) ) 2 in Theorem 3, we must have E ( μ Q ( z i z j ) ) n 2 ( 1 + n ) . Similarly, it is easy to show that E ( ν Q ( z i z j ) ) n 2 ( 1 + n ) . Hence, E ( G ) n 2 ( 1 + n ) .  ☐

3. Laplacian Energy of Pythagorean Fuzzy Graphs

This section defines and investigates the Laplacian energy of a PFG and provides its properties in detail.
Definition 6.
Let G = ( P , Q ) be a PFG on n vertices. The degree matrix, D ( G ) = ( D ( μ Q ( z i z j ) ) , D ( ν Q ( z i z j ) ) ) = [ d i j ] , of G is a n × n diagonal matrix defined as:
d i j = d G ( z i ) if i = j , 0 otherwise
Definition 7.
The Laplacian matrix of a PFG G = ( P , Q ) is defined as L ( G ) = ( L ( μ Q ( z i z j ) ) , L ( ν Q ( z i z j ) ) ) = D ( G ) A ( G ) , where A ( G ) is an adjacency matrix and D ( G ) is a degree matrix of a PFG G .
Example 4.
Consider a graph G = ( V , E ) , where V = { z 1 , z 2 , z 3 , z 4 , z 5 , z 6 , z 7 , z 8 } and E = { z 1 z 2 , z 2 z 3 , z 3 z 4 , z 1 z 4 , z 2 z 4 , z 2 z 8 , z 4 z 6 , z 1 z 8 , z 4 z 5 , z 5 z 6 , z 6 z 7 , z 7 z 8 , z 5 z 8 , z 6 z 8 } . Let G = ( P , Q ) be a PFG on V, as shown in Figure 3.
The adjacency matrix, degree matrix and Laplacian matrix of the PFG shown in Figure 3 are as follows:
A ( G ) = ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0.6 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0.4 , 0.6 ) ( 0.5 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.7 ) ( 0 , 0 ) ( 0.4 , 0.6 ) ( 0 , 0 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.7 ) ( 0.5 , 0.6 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0.4 , 0.9 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.8 ) ( 0.4 , 0.9 ) ( 0 , 0 ) ( 0.4 , 0.8 ) ( 0.3 , 0.9 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.8 ) ( 0 , 0 ) ( 0.2 , 0.6 ) ( 0.5 , 0.7 ) ( 0.3 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0.3 , 0.9 ) ( 0.2 , 0.6 ) ( 0 , 0 ) .
D ( G ) = ( 1.5 , 2.1 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.6 , 2.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.0 , 1.4 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 2.7 , 3.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.1 , 2.2 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.7 , 3.4 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 1.4 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.6 , 3.5 ) .
L ( G ) = ( 1.5 , 2.1 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0.6 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0.4 , 0.7 ) ( 1.6 , 2.6 ) ( 0.4 , 0.6 ) ( 0.5 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.7 ) ( 0 , 0 ) ( 0.4 , 0.6 ) ( 1.0 , 1.4 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.7 ) ( 0.5 , 0.6 ) ( 0.6 , 0.8 ) ( 2.7 , 3.6 ) ( 0.4 , 0.7 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 1.1 , 2.2 ) ( 0.4 , 0.9 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.8 ) ( 0.4 , 0.9 ) ( 1.7 , 3.4 ) ( 0.4 , 0.8 ) ( 0.3 , 0.9 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.8 ) ( 0.6 , 1.4 ) ( 0.2 , 0.6 ) ( 0.5 , 0.7 ) ( 0.3 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0.3 , 0.9 ) ( 0.2 , 0.6 ) ( 1.6 , 3.5 ) .
Definition 8.
The spectrum of Laplacian matrix of a PFG L ( G ) is defined as ( S L , T L ) , where S L and T L are the sets of Laplacian eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively.
Theorem 5.
Let G = ( P , Q ) be a PFG, and let L ( G ) be the Laplacian matrix of G . If ϑ 1 ϑ 2 ϑ n and φ 1 φ 2 φ n are the eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively, then:
(i) 
i = 1 ϑ i S L n ϑ i = 2 1 i < j n μ Q ( z i z j ) , i = 1 φ i T L n φ i = 2 1 i < j n ν Q ( z i z j ) .
(ii) 
i = 1 ϑ i S L n ϑ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 + i = 1 n d μ Q ( z i z j ) 2 ( z i ) , i = 1 φ i T L n φ i 2 = 2 1 i < j n ( ν Q ( z i z j ) ) 2 + i = 1 n d ν Q ( z i z j ) 2 ( z i ) .
Proof. 
(i) 
Since L ( G ) is a symmetric matrix with non-negative Laplacian eigenvalues, such that:
i = 1 ϑ i S L n ϑ i = t r ( L ( G ) ) = i = 1 n d μ Q ( z i z j ) ( z i ) = 2 1 i < j n μ Q ( z i z j ) .
Therefore, i = 1 ϑ i S L n ϑ i = 2 1 i < j n μ Q ( z i z j ) .
Similarly, it is easy to show that, i = 1 φ i T L n φ i = 2 1 i < j n ν Q ( z i z j ) .
(ii) 
By the definition of Laplacian matrix, we have:
L ( μ Q ( z i z j ) ) = d μ Q ( z i z j ) ( z 1 ) μ Q ( z 1 z 2 ) μ Q ( z 1 z n ) μ Q ( z 2 z 1 ) d μ Q ( z i z j ) ( z 2 ) μ Q ( z 2 z n ) μ Q ( z n z 1 ) μ Q ( z n z 2 ) d μ Q ( z i z j ) ( z n ) .
By the trace properties of a matrix, we have:
t r ( ( L ( μ Q ( z i z j ) ) ) 2 ) = i = 1 ϑ i S L n ϑ i 2
where:
t r ( ( L ( μ Q ( z i z j ) ) ) 2 ) = ( d μ Q ( z i z j ) 2 ( z 1 ) + μ Q 2 ( z 1 z 2 ) + + μ Q 2 ( z 1 z n ) ) + ( μ Q 2 ( z 2 z 1 ) + d μ Q ( z i z j ) 2 ( z 2 ) + + μ Q 2 ( z 2 z n ) ) + + ( μ Q 2 ( z n z 1 ) + μ Q 2 ( z n z 2 ) + + d μ Q ( z i z j ) 2 ( z n ) ) = 2 1 i < j n ( μ Q ( z i z j ) ) 2 + i = 1 n d μ Q ( z i z j ) 2 ( z i ) .
Therefore,
i = 1 ϑ i S L n ϑ i 2 = 2 1 i < j n ( μ Q ( z i z j ) ) 2 + i = 1 n d μ Q ( z i z j ) 2 ( z i ) .
Analogously, we can show that i = 1 φ i T L n φ i 2 = 2 1 i < j n ( ν Q ( z i z j ) ) 2 + i = 1 n d ν Q ( z i z j ) 2 ( z i ) . ☐
Definition 9.
The Laplacian energy of a PFG G = ( P , Q ) is defined as:
L E ( G ) = L E ( μ Q ( z i z j ) ) , L E ( ν Q ( z i z j ) ) = i = 1 n | ϱ i | , i = 1 n | ξ i |
where:
ϱ i = ϑ i 2 1 i < j n μ Q ( z i z j ) n , ξ i = φ i 2 1 i < j n ν Q ( z i z j ) n .
Theorem 6.
Let G = ( P , Q ) be a PFG, and let L ( G ) be the Laplacian matrix of G . If ϑ 1 ϑ 2 ϑ n and φ 1 φ 2 φ n are the eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively, and ϱ i = ϑ i 2 1 i < j n μ Q ( z i z j ) n ,   ξ i = φ i 2 1 i < j n ν Q ( z i z j ) n , then:
i = 1 n ϱ i = 0 , i = 1 n ξ i = 0 , i = 1 n ϱ i 2 = 2 M μ , i = 1 n ξ i 2 = 2 M ν ,
where:
M μ = 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 , M ν = 1 i < j n ( ν Q ( z i z j ) ) 2 + 1 2 i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 ,
Example 5.
The Laplacian spectrum and the Laplacian energy of a PFG G , given in Figure 3, are as follows:
Laplacian   Spec ( μ Q ( z i z j ) ) = { 0.0000 , 0.4877 , 0.8810 , 1.1086 , 1.9047 , 1.9763 , 2.0436 , 3.3981 } , Laplacian   Spec ( ν Q ( z i z j ) ) = { 0.0000 , 0.9099 , 1.6080 , 1.8014 , 3.1573 , 3.8148 , 3.8634 , 5.0453 } .
Therefore, Laplacian Spec ( G ) = { ( 0 , 0 ) ,   ( 0.4877 , 0.9099 ) ,   ( 0.8810 , 1.6080 ) ,   ( 1.1086 , 1.8014 ) ,   ( 1.9047 , 3.1573 ) ,   ( 1.9763 , 3.8148 ) ,   ( 2.0436 , 3.8634 ) ,   ( 3.3981 , 5.0453 ) } . Now,
L E ( μ Q ( z i z j ) ) = 6.8454 , L E ( ν Q ( z i z j ) ) = 11.5615 .
Therefore, L E ( G ) = ( 6.8454 , 11.5615 ) .
Furthermore, we have:
i = 1 8 ϱ i = 0 , i = 1 8 ξ i = 0 .
i = 1 8 ϱ i 2 = 8.0952 = 2 ( 4.05 ) = 2 M μ , i = 1 8 ξ i 2 = 20.5555 = 2 ( 10.28 ) = 2 M ν .
Theorem 7.
Let G = ( P , Q ) be a PFG on n vertices, and let L ( G ) = ( L ( μ Q ( z i z j ) ) , L ( ν Q ( z i z j ) ) ) be the Laplacian matrix of G . Then,
(i) 
L E ( μ Q ( z i z j ) ) 2 n 1 i < j n ( μ Q ( z i z j ) ) 2 + n i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 ;
(ii) 
L E ( ν Q ( z i z j ) ) 2 n 1 i < j n ( ν Q ( z i z j ) ) 2 + n i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 .
Proof. 
Applying the Cauchy–Schwarz inequality to the n numbers 1 , 1 , , 1 and | ϱ 1 | , | ϱ 2 | , , | ϱ n | , we have:
i = 1 n | ϱ i | n i = 1 n | ϱ i | 2
L E ( μ Q ( z i z j ) ) n 2 M μ = 2 n M μ .
Since M μ = 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 , therefore L E ( μ Q ( z i z j ) ) 2 n 1 i < j n ( μ Q ( z i z j ) ) 2 + n i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 .
Analogously, it is easy to show that
L E ( ν Q ( z i z j ) ) 2 n 1 i < j n ( ν Q ( z i z j ) ) 2 + n i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 . ☐
Theorem 8.
Let G = ( P , Q ) be a PFG on n vertices, and let L ( G ) = ( L ( μ Q ( z i z j ) ) , L ( ν Q ( z i z j ) ) ) be the Laplacian matrix of G . Then:
(i) 
L E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 ;
(ii) 
L E ( ν Q ( z i z j ) ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 + 1 2 i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 .
Proof. 
i = 1 n | ϱ i | 2 = i = 1 n | ϱ i | 2 + 2 1 i < j n | ϱ i ϱ i | 4 M μ
L E ( μ Q ( z i z j ) ) 2 M μ
Since M μ = 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 , therefore L E ( μ Q ( z i z j ) ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 .
Similarly, it is easy to show that
L E ( ν Q ( z i z j ) ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 + 1 2 i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 . ☐
Theorem 9.
Let G = ( P , Q ) be a PFG on n vertices, and let L ( G ) = ( L ( μ Q ( z i z j ) ) , L ( ν Q ( z i z j ) ) ) be the Laplacian matrix of G .
Then:
(i) 
L E ( μ Q ( z i z j ) ) | ϱ 1 | + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 ϱ 1 2 ;
(ii) 
L E ( ν Q ( z i z j ) ) | ξ 1 | + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 + i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 ξ 1 2 .
Proof. 
Using the Cauchy–Schwarz inequality, we get:
i = 1 n | ϱ i | n i = 1 n | ϱ i | 2
i = 2 n | ϱ i | ( n 1 ) i = 2 n | ϱ i | 2
L E ( μ Q ( z i z j ) ) | ϱ 1 | ( n 1 ) ( 2 M μ ϱ 1 2 )
L E ( μ Q ( z i z j ) ) | ϱ 1 | + ( n 1 ) ( 2 M μ ϱ 1 2 )
Since M μ = 1 i < j n ( μ Q ( z i z j ) ) 2 + 1 2 i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 . Therefore:
L E ( μ Q ( z i z j ) ) | ϱ 1 | + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 + i = 1 n d μ Q ( z i z j ) ( z i ) 2 1 i < j n μ Q ( z i z j ) n 2 ϱ 1 2 .
Similarly, we can show that L E ( ν Q ( z i z j ) ) | ξ 1 | + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 + i = 1 n d ν Q ( z i z j ) ( z i ) 2 1 i < j n ν Q ( z i z j ) n 2 ξ 1 2 . ☐
Theorem 10.
If the PFG G = ( P , Q ) is regular, then:
(i) 
L E ( μ Q ( z i z j ) ) | ϱ 1 | + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 ϱ 1 2 ;
(ii) 
L E ( ν Q ( z i z j ) ) | ξ 1 | + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 ξ 1 2 .
Proof. 
Let G be a regular PFG, then:
d μ Q ( z i z j ) ( z i ) = 2 1 i < j n μ Q ( z i z j ) n
Substituting (9) in (8), we get
L E ( μ Q ( z i z j ) ) | ϱ 1 | + ( n 1 ) 2 1 i < j n ( μ Q ( z i z j ) ) 2 ϱ 1 2 .
Similarly, it is easy to show that L E ( ν Q ( z i z j ) ) | ξ 1 | + ( n 1 ) 2 1 i < j n ( ν Q ( z i z j ) ) 2 ξ 1 2 . ☐

4. Energy and Laplacian Energy of Pythagorean Fuzzy Digraphs

This section generalizes the concept of energy to PFDGs. The eigenvalues of a PFDG may be complex numbers, as its adjacency matrix is not necessarily symmetric.
Definition 10.
The spectrum of the adjacency matrix of a PFDG A ( D ) is defined as ( S , T ) , where S and T are the sets of eigenvalues of A ( μ Q ( z i z j ) ) and A ( ν Q ( z i z j ) ) , respectively.
Definition 11.
Let D = ( P , Q ) be a PFDG on n vertices. The energy of D is defined as:
E ( D ) = E ( μ Q ( z i z j ) ) , E ( ν Q ( z i z j ) ) = i = 1 t i S n | R e ( t i ) | , i = 1 w i T n | R e ( w i ) |
where R e ( t i ) and R e ( w i ) represent the real part of eigenvalues t i and w i , respectively.
Theorem 11.
Let D = ( P , Q ) be a PFDG and A ( D ) be its adjacency matrix. If t 1 t 2 t n and w 1 w 2 w n are the eigenvalues of A ( μ Q ( z i z j ) ) and A ( ν Q ( z i z j ) ) , respectively, then:
i = 1 t i S n R e ( t i ) = 0 and i = 1 w i T n R e ( w i ) = 0 .
Example 6.
Consider a digraph D = ( V , E ) , where V = { z 1 , z 2 , z 3 , z 4 , z 5 , z 6 } and E = { z 1 z 4 , z 1 z 5 , z 2 z 4 , z 2 z 6 , z 3 z 5 , z 3 z 6 , , z 4 z 6 } . Let D = ( P , Q ) be a PFDG on V, as shown in Figure 4.
The adjacency matrix of a PFDG given in Figure 4 is:
A ( D ) = ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.5 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.2 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.6 ) ( 0.2 , 0.9 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.9 ) ( 0.6 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) .
The spectrum and the energy of a PFDG D given in Figure 4 are:
S p e c ( μ Q ( z i z j ) ) = { 0.4237 , 0.2281 + 0.3107 i , 0.2281 0.3107 i , 0.0162 + 0.2133 i , 0.0162 0.2133 i , 0 } , S p e c ( ν Q ( z i z j ) ) = { 0.8881 , 0.5478 + 0.5900 i , 0.5478 0.5900 i , 0.1037 + 0.5975 i , 0.1037 0.5975 i , 0 } .
Therefore,
S p e c ( D ) = { ( 0.4237 , 0.8881 ) , ( 0.2281 + 0.3107 i , 0.5478 + 0.5900 i ) , ( 0.2281 0.3107 i , 0.5478 0.5900 i ) , ( 0.0162 + 0.2133 i , 0.1037 + 0.5975 i ) , ( 0.0162 0.2133 i , 0.1037 0.5975 i ) , ( 0 , 0 ) } .
Now, E ( μ Q ( z i z j ) ) = 0.9123 and E ( ν Q ( z i z j ) ) = 2.1910 .
Therefore, E ( D ) = ( 0.9123 , 2.1910 ) .
Furthermore,
i = 1 t i S 6 R e ( t i ) = 0 and i = 1 w i T 6 R e ( w i ) = 0 .
We now discuss the Laplacian energy of Pythagorean fuzzy digraphs.
Definition 12.
Let D = ( P , Q ) be a PFDG on n vertices. The degree matrix, D ( D ) = ( D ( μ Q ( z i z j ) ) , D ( ν Q ( z i z j ) ) ) = [ d i j ] , of D is a n × n diagonal matrix defined as:
d i j = d D out ( z i ) if i = j , 0 otherwise
Definition 13.
The Laplacian matrix of a PFDG D = ( P , Q ) is defined as L ( D ) = ( L ( μ Q ( z i z j ) ) , L ( ν Q ( z i z j ) ) ) = D out ( D ) A ( D ) , where A ( D ) is an adjacency matrix and D out ( D ) is an out-degree matrix of a PFDG D .
Definition 14.
The spectrum of the Laplacian matrix of a PFDG L ( D ) is defined as ( S L , T L ) , where S L and T L are the sets of Laplacian eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively.
Theorem 12.
Let D = ( P , Q ) be a PFDG, and let L ( D ) be the Laplacian matrix of D . If g 1 g 2 g n and h 1 h 2 h n are the eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively, then:
i = 1 g i S L n R e ( g i ) = 1 i < j n μ Q ( z i z j ) , i = 1 h i T L n R e ( h i ) = 1 i < j n ν Q ( z i z j ) .
Definition 15.
The Laplacian energy of a PFDG D = ( P , Q ) is defined as:
L E ( D ) = L E ( μ Q ( z i z j ) ) , L E ( ν Q ( z i z j ) ) = i = 1 n | r i | , i = 1 n | s i |
where:
r i = R e ( g i ) 1 i < j n μ Q ( z i z j ) n , s i = R e ( h i ) 1 i < j n ν Q ( z i z j ) n .
Theorem 13.
Let D = ( P , Q ) be a PFDG, and let L ( D ) be the Laplacian matrix of D . If g 1 g 2 g n and h 1 h 2 h n are the eigenvalues of L ( μ Q ( z i z j ) ) and L ( ν Q ( z i z j ) ) , respectively, and r i = R e ( g i ) 1 i < j n μ Q ( z i z j ) n , s i = R e ( h i ) 1 i < j n ν Q ( z i z j ) n , then i = 1 n r i = 0 , i = 1 n s i = 0 .
Example 7.
Consider a PFDG D = ( P , Q ) on V = { z 1 , z 2 , z 3 , z 4 , z 5 , z 6 } , as shown in Figure 5.
The adjacency matrix, out-degree matrix and Laplacian matrix of the PFDG shown in Figure 5 are as follows:
A ( D ) = ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0.3 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0.3 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.5 ) ( 0 , 0 ) ( 0.7 , 0.5 ) ( 0.6 , 0.8 ) ( 0.6 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) .
D out ( D ) = ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.7 , 1.5 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.9 , 1.4 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 1.4 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.3 , 1.0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.2 , 1.5 ) .
L ( D ) = ( 0.3 , 0.6 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0.4 , 0.7 ) ( 0.7 , 1.5 ) ( 0.3 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.5 , 0.7 ) ( 0.9 , 1.4 ) ( 0 , 0 ) ( 0.4 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.3 , 0.6 ) ( 0.6 , 1.4 ) ( 0.3 , 0.8 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 0.6 , 0.5 ) ( 1.3 , 1.0 ) ( 0.7 , 0.5 ) ( 0.6 , 0.8 ) ( 0.6 , 0.7 ) ( 0 , 0 ) ( 0 , 0 ) ( 0 , 0 ) ( 1.2 , 1.5 ) .
The Laplacian spectrum and the Laplacian energy of a PFDG D , given in Figure 5, are as follows:
Laplacian   Spec ( μ Q ( z i z j ) ) = { 0 , 0.2757 , 0.6371 , 1.2317 + 0.3555 i , 1.2317 0.3555 i , 1.6237 } , Laplacian   Spec ( ν Q ( z i z j ) ) = { 0 , 0.4036 , 2.1629 , 1.8081 + 0.3173 i , 1.8081 0.3173 i , 1.2174 } .
Therefore, Laplacian Spec ( D ) = { ( 0 , 0 ) , ( 0.2757 , 0.4036 ) , ( 0.6371 , 2.1629 ) , ( 1.2317 + 0.3555 i , 1.8081 + 0.3173 i ) , ( 1.2317 0.3555 i , 1.8081 0.3173 i ) , ( 1.6237 , 1.2174 ) } .
Now,
L E ( μ Q ( z i z j ) ) = 3.1744 , L E ( ν Q ( z i z j ) ) = 4.1582 .
Therefore, L E ( D ) = ( 3.1744 , 4.1582 ) .
Furthermore, we have:
i = 1 6 r i = 0 , i = 1 6 s i = 0 .

5. Applications of the Energy of PFGs in Decision-Making

In this section, we use two practical examples of the satellite communication system design and the evaluation of the schemes of reservoir operation to illustrate our proposed concepts of the Pythagorean fuzzy graph theory in decision-making.

5.1. Designing of a Satellite Communication System

Communication is closely related to social development. In particular, satellite communication [42] has wide coverage area for communication, without geographical restrictions, and is less susceptible to the impact of land disasters. There is a unique advantage of satellite communication in many application areas, such as remote areas, islands, mountains, voyage aircraft and oceangoing vessels. Therefore, satellite communication not only effectively supplements the lack of other means of communication, but also has an irreplaceable role as the primary method of communication in mass media, especially the military. In modern warfare, it is very important to quantify the quality of the communication service. Suppose that a communication joint department in China plans to design a satellite communication system. Thus, a new test methodology for the synthetic communication system needs to be investigated, in order to provide evidence for building satellite Earth stations in the future. According to the expeditions, there are four possible testing venues z i ( i = 1 , 2 , 3 , 4 ) to choose from (Xichang z 1 , Chengdu z 2 , Nanjing z 3 and Lhasa z 4 ). However, due to resources, funds, and other factors, only the most suitable of these would be selected. A decision-making group composed of six experts e k ( k = 1 , 2 , , 6 ) provides the judgments with six individual Pythagorean fuzzy preference relations (PFPRs) [27] R k = ( r i j ( k ) ) 4 × 4 ( k = 1 , 2 , , 6 ) as follows:
R 1 = ( 0.5 , 0.5 ) ( 0.6 , 0.5 ) ( 0.3 , 0.6 ) ( 0.7 , 0.5 ) ( 0.5 , 0.6 ) ( 0.5 , 0.5 ) ( 0.7 , 0.6 ) ( 0.8 , 0.5 ) ( 0.6 , 0.3 ) ( 0.6 , 0.7 ) ( 0.5 , 0.5 ) ( 0.4 , 0.8 ) ( 0.5 , 0.7 ) ( 0.5 , 0.8 ) ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) , R 2 = ( 0.5 , 0.5 ) ( 0.7 , 0.5 ) ( 0.3 , 0.8 ) ( 0.4 , 0.5 ) ( 0.5 , 0.7 ) ( 0.5 , 0.5 ) ( 0.6 , 0.4 ) ( 0.6 , 0.7 ) ( 0.8 , 0.3 ) ( 0.4 , 0.6 ) ( 0.5 , 0.5 ) ( 0.3 , 0.9 ) ( 0.5 , 0.4 ) ( 0.7 , 0.6 ) ( 0.9 , 0.3 ) ( 0.5 , 0.5 ) ,
R 3 = ( 0.5 , 0.5 ) ( 0.4 , 0.7 ) ( 0.8 , 0.2 ) ( 0.6 , 0.5 ) ( 0.7 , 0.4 ) ( 0.5 , 0.5 ) ( 0.7 , 0.5 ) ( 0.4 , 0.7 ) ( 0.2 , 0.8 ) ( 0.5 , 0.7 ) ( 0.5 , 0.5 ) ( 0.3 , 0.5 ) ( 0.5 , 0.6 ) ( 0.7 , 0.4 ) ( 0.5 , 0.3 ) ( 0.5 , 0.5 ) , R 4 = ( 0.5 , 0.5 ) ( 0.3 , 0.5 ) ( 0.7 , 0.4 ) ( 0.6 , 0.7 ) ( 0.5 , 0.3 ) ( 0.5 , 0.5 ) ( 0.2 , 0.9 ) ( 0.4 , 0.5 ) ( 0.4 , 0.7 ) ( 0.9 , 0.2 ) ( 0.5 , 0.5 ) ( 0.4 , 0.8 ) ( 0.7 , 0.6 ) ( 0.5 , 0.4 ) ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) ,
R 5 = ( 0.5 , 0.5 ) ( 0.4 , 0.6 ) ( 0.9 , 0.2 ) ( 0.6 , 0.6 ) ( 0.6 , 0.4 ) ( 0.5 , 0.5 ) ( 0.7 , 0.6 ) ( 0.5 , 0.7 ) ( 0.2 , 0.9 ) ( 0.6 , 0.7 ) ( 0.5 , 0.5 ) ( 0.3 , 0.4 ) ( 0.6 , 0.6 ) ( 0.7 , 0.5 ) ( 0.4 , 0.3 ) ( 0.5 , 0.5 ) , R 6 = ( 0.5 , 0.5 ) ( 0.4 , 0.8 ) ( 0.9 , 0.3 ) ( 0.6 , 0.2 ) ( 0.8 , 0.4 ) ( 0.5 , 0.5 ) ( 0.5 , 0.7 ) ( 0.4 , 0.3 ) ( 0.3 , 0.9 ) ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) ( 0.6 , 0.5 ) ( 0.2 , 0.6 ) ( 0.3 , 0.4 ) ( 0.5 , 0.6 ) ( 0.5 , 0.5 ) .
The PFDGs D k corresponding to PFPRs given in matrices R k ( k = 1 , 2 , , 6 ) are shown in Figure 6.
The energy of each PFDG is calculated as:
E ( D 1 ) = ( 3.5008 , 3.5008 ) , E ( D 2 ) = ( 3.3021 , 3.3021 ) , E ( D 3 ) = ( 3.0706 , 3.0706 ) , E ( D 4 ) = ( 3.1675 , 3.1675 ) , E ( D 5 ) = ( 3.1860 , 3.1860 ) , E ( D 6 ) = ( 3.0656 , 3.0656 ) .
Then, the weight of each expert can be calculated as:
w k = ( ( w μ ) k , ( w ν ) k ) = E ( ( D μ ) k ) l = 1 s E ( ( D μ ) l ) , E ( ( D ν ) k ) l = 1 s E ( ( D ν ) l ) , k = 1 , 2 , , s ,
w 1 = ( 0.1815 , 0.1815 ) , w 2 = ( 0.1712 , 0.1712 ) , w 3 = ( 0.1592 , 0.1592 ) , w 4 = ( 0.1642 , 0.1642 ) , w 5 = ( 0.1651 , 0.1651 ) , w 6 = ( 0.1589 , 0.1589 ) .
Therefore, the weight vector of six experts e k (k = 1, 2, …, 6) is:
w = ( ( 0.1815 , 0.1815 ) , ( 0.1712 , 0.1712 ) , ( 0.1592 , 0.1592 ) , ( 0.1642 , 0.1642 ) , ( 0.1651 , 0.1651 ) , ( 0.1589 , 0.1589 ) ) T .
Compute the averaged Pythagorean fuzzy element (PFE) p i ( k ) of the testing venue z i over all the other testing venues for the experts e k ( k = 1 , 2 , , 6 ) by the Pythagorean fuzzy averaging (PFA) operator:
p i ( k ) = P F A ( p i 1 ( k ) , p i 2 ( k ) , , p i n ( k ) ) = 1 j = 1 n 1 μ i j 2 1 / n , j = 1 n ν i j 1 / n , i = 1 , 2 , 3 , , n ,
The aggregation results are listed in Table 1:
Compute a collective PFE p i ( i = 1 , 2 , 3 , 4 ) of the testing venue z i over all the other testing venues using the Pythagorean fuzzy weighted averaging (PFWA) operator [2].
p i = PFWA ( p i ( 1 ) , p i ( 2 ) , , p i ( s ) ) = 1 k = 1 s 1 ( μ k 2 ) w k , k = 1 s ( ν k ) w k .
That is , p 1 = ( 0.6110 , 0.4752 ) , p 2 = ( 0.5803 , 0.5203 ) , p 3 = ( 0.5415 , 0.5550 ) , p 4 = ( 0.6061 , 0.4814 ) .
Compute the score functions s ( p i ) = μ i 2 ν i 2 [4] of p i ( i = 1 , 2 , 3 , 4 ) , and rank all the testing venues z i ( i = 1 , 2 , 3 , 4 ) according to the values of s ( p i ) ( i = 1 , 2 , 3 , 4 ) .
s ( p 1 ) = 0.1475 , s ( p 2 ) = 0.0660 , s ( p 3 ) = 0.0148 , s ( p 4 ) = 0.1356 .
Then, z 1 z 4 z 2 z 3 .
Thus, the best testing venue is z 1 .
Now, the Laplacian matrices of the PFDGs L ( D k ) = R k L ( k = 1 , 2 , , 6 ) shown in Figure 6 are:
R 1 L = ( 1.6 , 1.6 ) ( 0.6 , 0.5 ) ( 0.3 , 0.6 ) ( 0.7 , 0.5 ) ( 0.5 , 0.6 ) ( 2.0 , 1.7 ) ( 0.7 , 0.6 ) ( 0.8 , 0.5 ) ( 0.6 , 0.3 ) ( 0.6 , 0.7 ) ( 1.6 , 1.8 ) ( 0.4 , 0.8 ) ( 0.5 , 0.7 ) ( 0.5 , 0.8 ) ( 0.8 , 0.4 ) ( 1.8 , 1.9 ) ,
R 2 L = ( 1.4 , 1.8 ) ( 0.7 , 0.5 ) ( 0.3 , 0.8 ) ( 0.4 , 0.5 ) ( 0.5 , 0.7 ) ( 1.7 , 1.8 ) ( 0.6 , 0.4 ) ( 0.6 , 0.7 ) ( 0.8 , 0.3 ) ( 0.4 , 0.6 ) ( 1.5 , 1.8 ) ( 0.3 , 0.9 ) ( 0.5 , 0.4 ) ( 0.7 , 0.6 ) ( 0.9 , 0.3 ) ( 2.1 , 1.3 ) ,
R 3 L = ( 1.8 , 1.4 ) ( 0.4 , 0.7 ) ( 0.8 , 0.2 ) ( 0.6 , 0.5 ) ( 0.7 , 0.4 ) ( 1.8 , 1.6 ) ( 0.7 , 0.5 ) ( 0.4 , 0.7 ) ( 0.2 , 0.8 ) ( 0.5 , 0.7 ) ( 1.0 , 2.0 ) ( 0.3 , 0.5 ) ( 0.5 , 0.6 ) ( 0.7 , 0.4 ) ( 0.5 , 0.3 ) ( 1.7 , 1.3 ) ,
R 4 L = ( 1.6 , 1.6 ) ( 0.3 , 0.5 ) ( 0.7 , 0.4 ) ( 0.6 , 0.7 ) ( 0.5 , 0.3 ) ( 1.1 , 1.7 ) ( 0.2 , 0.9 ) ( 0.4 , 0.5 ) ( 0.4 , 0.7 ) ( 0.9 , 0.2 ) ( 1.7 , 1.7 ) ( 0.4 , 0.8 ) ( 0.7 , 0.6 ) ( 0.5 , 0.4 ) ( 0.8 , 0.4 ) ( 2.0 , 1.4 ) ,
R 5 L = ( 1.9 , 1.4 ) ( 0.4 , 0.6 ) ( 0.9 , 0.2 ) ( 0.6 , 0.6 ) ( 0.6 , 0.4 ) ( 1.8 , 1.7 ) ( 0.7 , 0.6 ) ( 0.5 , 0.7 ) ( 0.2 , 0.9 ) ( 0.6 , 0.7 ) ( 1.1 , 2.0 ) ( 0.3 , 0.4 ) ( 0.6 , 0.6 ) ( 0.7 , 0.5 ) ( 0.4 , 0.3 ) ( 1.7 , 1.4 ) ,
R 6 L = ( 1.9 , 1.3 ) ( 0.4 , 0.8 ) ( 0.9 , 0.3 ) ( 0.6 , 0.2 ) ( 0.8 , 0.4 ) ( 1.7 , 1.4 ) ( 0.5 , 0.7 ) ( 0.4 , 0.3 ) ( 0.3 , 0.9 ) ( 0.7 , 0.5 ) ( 1.6 , 1.9 ) ( 0.6 , 0.5 ) ( 0.2 , 0.6 ) ( 0.3 , 0.4 ) ( 0.5 , 0.6 ) ( 1.0 , 1.6 ) .
The Laplacian energy of each PFDG is calculated as:
L E ( D 1 ) = ( 3.5000 , 3.5000 ) ,   L E ( D 2 ) = ( 3.3400 , 3.3400 ) ,   L E ( D 3 ) = ( 3.1400 , 3.1400 ) , L E ( D 4 ) = ( 3.2000 , 3.2000 ) ,   L E ( D 5 ) = ( 3.2400 , 3.2400 ) ,   L E ( D 6 ) = ( 3.1302 , 3.1302 ) .
Then, the weight of each expert can be calculated as:
w k = ( ( w μ ) k , ( w ν ) k ) = L E ( ( D μ ) k ) l = 1 s L E ( ( D μ ) l ) , L E ( ( D ν ) k ) l = 1 s L E ( ( D ν ) l ) , k = 1 , 2 , , s ,
w 1 = ( 0.1790 , 0.1790 ) , w 2 = ( 0.1708 , 0.1708 ) , w 3 = ( 0.1606 , 0.1606 ) , w 4 = ( 0.1637 , 0.1637 ) , w 5 = ( 0.1657 , 0.1657 ) , w 6 = ( 0.1601 , 0.1601 ) .
Based on this, we compute a collective PFE p i ( i = 1 , 2 , 3 , 4 ) of the testing venue z i over all the other testing venues using the PFWA operator:
p i = PFWA ( p i ( 1 ) , p i ( 2 ) , , p i ( s ) )
That is, p 1 = ( 0.6113 , 0.4749 ) ,   p 2 = ( 0.5802 , 0.5202 ) ,   p 3 = ( 0.5412 , 0.5553 ) ,   p 4 = ( 0.6057 , 0.4812 ) .
Compute the score functions s ( p i ) = μ i 2 ν i 2 of p i ( i = 1 , 2 , 3 , 4 ) , and rank all the testing venues z i ( i = 1 , 2 , 3 , 4 ) according to the values of s ( p i ) ( i = 1 , 2 , 3 , 4 ) .
s ( p 1 ) = 0.1482 ,   s ( p 1 ) = 0.0660   , s ( p 3 ) = 0.0155 ,   s ( p 4 ) = 0.1353 .
Then, z 1 z 4 z 2 z 3 .
Thus, the testing venue z 1 is the best among the four given testing venues. We present our scheme for this application in the following Algorithm 1.
Algorithm 1 The algorithm for the selection of the most important testing venue.
INPUT: A discrete set of testing venues (alternatives) Z = { z 1 , z 2 , , z n } , a set of experts e = { e 1 , e 2 , , e s } and construction of PFPR R k = ( p i j ( k ) ) n × n for each expert.
OUTPUT: The selection of the optimal testing venue.
  • begin
  • Calculate the energy and Laplacian energy of each PFDG D k ( k = 1 , 2 , , s ) .
  • Determine the wight vector for experts based on the energy of PFDGs by utilizing w k = E ( ( D μ ) k ) l = 1 s E ( ( D μ ) l ) , E ( ( D ν ) k ) l = 1 s E ( ( D ν ) l ) , and then, based on the Laplacian energy of PFDGs by utilizing w k = L E ( ( D μ ) k ) l = 1 s L E ( ( D μ ) l ) , L E ( ( D ν ) k ) l = 1 s L E ( ( D ν ) l ) , k = 1 , 2 , , s .
  • Aggregate all p i j ( k ) ( j = 1 , 2 , , n ) corresponding to the testing venue z i , and get the PFE p i ( k ) of the testing venue z i over all the other testing venues for the expert e k by using the PFA operator.
  • Aggregate all p i ( k ) ( k = 1 , 2 , , s ) into a collective PFE p i for the testing venue z i using the PFWA operator.
  • Compute the score functions s ( p i ) of p i ( i = 1 , 2 , , n ) .
  • Rank all the testing venues z i ( i = 1 , 2 , , n ) according to s ( p i ) ( i = 1 , 2 , , n ) .
  • Output the optimal testing venue.
  • end

5.2. Evaluation of the Schemes of Reservoir Operation

This section focuses on evaluating the schemes of reservoir operation. It is a water resource system led by Jiudianxia reservoir with a complex condition and multipurpose use along with the Tao River basin and cascaded power stations in the Tao River. The reservoir was designed for many purposes, such as power generation, irrigation, total water supply for agriculture, industry, residents and environment. Due to different requirements for the partition of the amount of water, five reservoir operation schemes z 1 , z 2 , z 3 , z 4 and z 5 are recommended.
z1:
Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy;
z2:
Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy, lower supply for the ecosystem;
z3:
Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy, total supply for the ecosystem and environment, 90% of which is passed down for flushing sands during low water periods;
z4:
Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy, total supply for the ecosystem and environment, 50% of which is passed down for flushing sands during low water periods;
z5:
Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy, total supply for the ecosystem and environment during level and flood periods.
To select the optimal scheme, the government invites four experts e k ( k = 1 , 2 , 3 , 4 ) to evaluate the five schemes. Based on their experience, the experts compare each pair of schemes and give individual judgments using the following PFPRs R k = ( r i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) [43]:
R 1 = ( 0.5 , 0.5 ) ( 0.6 , 0.8 ) ( 0.5 , 0.7 ) ( 0.7 , 0.4 ) ( 0.8 , 0.1 ) ( 0.8 , 0.6 ) ( 0.5 , 0.5 ) ( 0.5 , 0.4 ) ( 0.6 , 0.5 ) ( 0.5 , 0.3 ) ( 0.7 , 0.5 ) ( 0.4 , 0.5 ) ( 0.5 , 0.5 ) ( 0.6 , 0.7 ) ( 0.7 , 0.6 ) ( 0.4 , 0.7 ) ( 0.5 , 0.6 ) ( 0.7 , 0.6 ) ( 0.5 , 0.5 ) ( 0.8 , 0.4 ) ( 0.1 , 0.8 ) ( 0.3 , 0.5 ) ( 0.6 , 0.7 ) ( 0.4 , 0.8 ) ( 0.5 , 0.5 ) ,
R 2 = ( 0.5 , 0.5 ) ( 0.7 , 0.2 ) ( 0.8 , 0.4 ) ( 0.7 , 0.6 ) ( 0.7 , 0.3 ) ( 0.2 , 0.7 ) ( 0.5 , 0.5 ) ( 0.5 , 0.7 ) ( 0.8 , 0.3 ) ( 0.5 , 0.4 ) ( 0.4 , 0.8 ) ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) ( 0.4 , 0.6 ) ( 0.7 , 0.6 ) ( 0.6 , 0.7 ) ( 0.3 , 0.8 ) ( 0.6 , 0.4 ) ( 0.5 , 0.5 ) ( 0.5 , 0.3 ) ( 0.3 , 0.7 ) ( 0.4 , 0.5 ) ( 0.6 , 0.7 ) ( 0.3 , 0.5 ) ( 0.5 , 0.5 ) ,
R 3 = ( 0.5 , 0.5 ) ( 0.6 , 0.7 ) ( 0.8 , 0.3 ) ( 0.6 , 0.4 ) ( 0.7 , 0.2 ) ( 0.7 , 0.6 ) ( 0.5 , 0.5 ) ( 0.7 , 0.4 ) ( 0.1 , 0.8 ) ( 0.5 , 0.6 ) ( 0.3 , 0.8 ) ( 0.4 , 0.7 ) ( 0.5 , 0.5 ) ( 0.5 , 0.7 ) ( 0.7 , 0.4 ) ( 0.4 , 0.6 ) ( 0.8 , 0.1 ) ( 0.7 , 0.5 ) ( 0.5 , 0.5 ) ( 0.5 , 0.3 ) ( 0.2 , 0.7 ) ( 0.6 , 0.5 ) ( 0.4 , 0.7 ) ( 0.3 , 0.5 ) ( 0.5 , 0.5 ) ,
R 4 = ( 0.5 , 0.5 ) ( 0.8 , 0.6 ) ( 0.7 , 0.1 ) ( 0.8 , 0.3 ) ( 0.4 , 0.7 ) ( 0.6 , 0.8 ) ( 0.5 , 0.5 ) ( 0.5 , 0.3 ) ( 0.4 , 0.3 ) ( 0.7 , 0.6 ) ( 0.1 , 0.7 ) ( 0.3 , 0.5 ) ( 0.5 , 0.5 ) ( 0.9 , 0.2 ) ( 0.5 , 0.3 ) ( 0.3 , 0.8 ) ( 0.3 , 0.4 ) ( 0.2 , 0.9 ) ( 0.5 , 0.5 ) ( 0.8 , 0.4 ) ( 0.7 , 0.4 ) ( 0.6 , 0.7 ) ( 0.3 , 0.5 ) ( 0.4 , 0.8 ) ( 0.5 , 0.5 ) .
The PFDGs D k corresponding to PFPRs given in matrices R k ( k = 1 , 2 , 3 , 4 ) are shown in Figure 7:
The energy of each PFDG is calculated as:
E ( D 1 ) = ( 3.3053 , 3.3053 ) ,   E ( D 2 ) = ( 2.9252 , 2.9252 ) ,   E ( D 3 ) = ( 2.8510 , 2.8510 ) ,   E ( D 4 ) = ( 3.0081 , 3.0081 ) .
Then, the weight of each expert can be calculated as:
w k = ( ( w μ ) k , ( w ν ) k ) = E ( ( D μ ) k ) l = 1 4 E ( ( D μ ) l ) , E ( ( D ν ) k ) l = 1 4 E ( ( D ν ) l ) , k = 1 , 2 , , 4 ,
w 1 = ( 0.2734 , 0.2734 ) , w 2 = ( 0.2420 , 0.2420 ) , w 3 = ( 0.2358 , 0.2358 ) , w 4 = ( 0.2488 , 0.2488 ) .
Utilize the aggregation operator to fuse all the individual PFPRs R k = ( r i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) into the collective PFPR R = ( r i j ) 5 × 5 . Here, we apply the Pythagorean fuzzy weighted averaging (PFWA) operator [2] to fuse the individual PFPR. Thus, we have:
PFWA ( r i j ( 1 ) , r i j ( 2 ) , , r i j ( s ) ) = 1 k = 1 s 1 ( μ i j 2 ) ( k ) w k , k = 1 s ν i j ( k ) w k .
R = ( 0.5000 , 0.5000 ) ( 0.6892 , 0.5160 ) ( 0.7212 , 0.3085 ) ( 0.7118 , 0.4108 ) ( 0.6892 , 0.2493 ) ( 0.6544 , 0.6690 ) ( 0.5000 , 0.5000 ) ( 0.5614 , 0.4264 ) ( 0.5828 , 0.4347 ) ( 0.5645 , 0.4500 ) ( 0.4712 , 0.6805 ) ( 0.4905 , 0.5413 ) ( 0.5000 , 0.5000 ) ( 0.6895 , 0.4938 ) ( 0.6623 , 0.4589 ) ( 0.4446 , 0.6978 ) ( 0.5535 , 0.3811 ) ( 0.6078 , 0.5763 ) ( 0.5000 , 0.5000 ) ( 0.6991 , 0.3486 ) ( 0.4284 , 0.6317 ) ( 0.4974 , 0.5437 ) ( 0.5051 , 0.6438 ) ( 0.3567 , 0.6391 ) ( 0.5000 , 0.5000 ) .
Calculate their scores using the score function s i j = μ i j 2 ν i j 2 :
R = 0.0000 0.2088 0.4250 0.3379 0.4129 0.0194 0.0000 0.1334 0.1507 0.1161 0.2411 0.0524 0.0000 0.2316 0.2280 0.2893 0.1611 0.0372 0.0000 0.3672 0.2155 0.0481 0.1593 0.2812 0.0000 .
The net flow of z i [44], i.e., the net degree of preference of z i over the other schemes is:
ϕ ( z i ) = k = 1 s w k j = 1 j i n ( r i j ( k ) r j i ( k ) ) , i = 1 , 2 , , n .
Therefore, the net flows of the five schemes are:
Φ = ( ϕ ( z 1 ) , ϕ ( z 2 ) , ϕ ( z 3 ) , ϕ ( z 4 ) , ϕ ( z 5 ) ) T = ( 2.1499 , 0.1114 , 0.2702 , 0.1628 , 1.8283 ) T
which gives the ranking of z 1 z 2 z 4 z 3 z 5 . Thus, the best scheme is z 1 .
Now, the Laplacian matrices of the PFDGs L ( D k ) = R k L ( k = 1 , 2 , 3 , 4 ) shown in Figure 7 are:
R 1 L = ( 2.6 , 2.0 ) ( 0.6 , 0.8 ) ( 0.5 , 0.7 ) ( 0.7 , 0.4 ) ( 0.8 , 0.1 ) ( 0.8 , 0.6 ) ( 2.4 , 1.8 ) ( 0.5 , 0.4 ) ( 0.6 , 0.5 ) ( 0.5 , 0.3 ) ( 0.7 , 0.5 ) ( 0.4 , 0.5 ) ( 2.4 , 2.3 ) ( 0.6 , 0.7 ) ( 0.7 , 0.6 ) ( 0.4 , 0.7 ) ( 0.5 , 0.6 ) ( 0.7 , 0.6 ) ( 2.4 , 2.3 ) ( 0.8 , 0.4 ) ( 0.1 , 0.8 ) ( 0.3 , 0.5 ) ( 0.6 , 0.7 ) ( 0.4 , 0.8 ) ( 1.4 , 2.8 ) ,
R 2 L = ( 2.9 , 1.5 ) ( 0.7 , 0.2 ) ( 0.8 , 0.4 ) ( 0.7 , 0.6 ) ( 0.7 , 0.3 ) ( 0.2 , 0.7 ) ( 2.0 , 2.1 ) ( 0.5 , 0.7 ) ( 0.8 , 0.3 ) ( 0.5 , 0.4 ) ( 0.4 , 0.8 ) ( 0.7 , 0.5 ) ( 2.2 , 2.5 ) ( 0.4 , 0.6 ) ( 0.7 , 0.6 ) ( 0.6 , 0.7 ) ( 0.3 , 0.8 ) ( 0.6 , 0.4 ) ( 2.0 , 2.2 ) ( 0.5 , 0.3 ) ( 0.3 , 0.7 ) ( 0.4 , 0.5 ) ( 0.6 , 0.7 ) ( 0.3 , 0.5 ) ( 1.6 , 2.4 ) ,
R 3 L = ( 2.7 , 1.6 ) ( 0.6 , 0.7 ) ( 0.8 , 0.3 ) ( 0.6 , 0.4 ) ( 0.7 , 0.2 ) ( 0.7 , 0.6 ) ( 2.0 , 2.4 ) ( 0.7 , 0.4 ) ( 0.1 , 0.8 ) ( 0.5 , 0.6 ) ( 0.3 , 0.8 ) ( 0.4 , 0.7 ) ( 1.9 , 2.6 ) ( 0.5 , 0.7 ) ( 0.7 , 0.4 ) ( 0.4 , 0.6 ) ( 0.8 , 0.1 ) ( 0.7 , 0.5 ) ( 2.4 , 1.5 ) ( 0.5 , 0.3 ) ( 0.2 , 0.7 ) ( 0.6 , 0.5 ) ( 0.4 , 0.7 ) ( 0.3 , 0.5 ) ( 1.5 , 2.4 ) ,
R 4 L = ( 2.7 , 1.7 ) ( 0.8 , 0.6 ) ( 0.7 , 0.1 ) ( 0.8 , 0.3 ) ( 0.4 , 0.7 ) ( 0.6 , 0.8 ) ( 2.2 , 2.0 ) ( 0.5 , 0.3 ) ( 0.4 , 0.3 ) ( 0.7 , 0.6 ) ( 0.1 , 0.7 ) ( 0.3 , 0.5 ) ( 1.8 , 1.7 ) ( 0.9 , 0.2 ) ( 0.5 , 0.3 ) ( 0.3 , 0.8 ) ( 0.3 , 0.4 ) ( 0.2 , 0.9 ) ( 1.6 , 2.5 ) ( 0.8 , 0.4 ) ( 0.7 , 0.4 ) ( 0.6 , 0.7 ) ( 0.3 , 0.5 ) ( 0.4 , 0.8 ) ( 2.0 , 2.4 ) .
The Laplacian energy of each PFDG is calculated as:
L E ( D 1 ) = ( 4.7399 , 4.4800 ) , L E ( D 2 ) = ( 4.2800 , 4.2800 ) , L E ( D 3 ) = ( 4.2000 , 4.2000 ) , L E ( D 4 ) = ( 4.1200 , 4.1200 ) .
Then, the weights can be calculated as:
w k = ( ( w μ ) k , ( w ν ) k ) = L E ( ( D μ ) k ) l = 1 s L E ( ( D μ ) l ) , L E ( ( D ν ) k ) l = 1 s L E ( ( D ν ) l ) , k = 1 , 2 , , s ,
w 1 = ( 0.2734 , 0.2734 ) , w 2 = ( 0.2468 , 0.2468 ) , w 3 = ( 0.2422 , 0.2422 ) , w 4 = ( 0.2376 , 0.2376 ) .
Based on this, we utilize the PFWA operator to fuse all the individual PFPRs R k = ( r i j ( k ) ) 5 × 5 ( k = 1 , 2 , 3 , 4 ) into the collective PFPR R = ( r i j ) 5 × 5 :
R = ( 0.5000 , 0.5000 ) ( 0.6872 , 0.5138 ) ( 0.7225 , 0.3127 ) ( 0.7099 , 0.4129 ) ( 0.6913 , 0.2463 ) ( 0.6542 , 0.6674 ) ( 0.5000 , 0.5000 ) ( 0.5629 , 0.4289 ) ( 0.5845 , 0.4375 ) ( 0.5618 , 0.4491 ) ( 0.4723 , 0.6816 ) ( 0.4930 , 0.5425 ) ( 0.5000 , 0.5000 ) ( 0.6834 , 0.5004 ) ( 0.6641 , 0.4613 ) ( 0.4466 , 0.6961 ) ( 0.5572 , 0.3790 ) ( 0.6108 , 0.5719 ) ( 0.5000 , 0.5000 ) ( 0.6961 , 0.3475 ) ( 0.4218 , 0.6356 ) ( 0.4964 , 0.5416 ) ( 0.5068 , 0.6462 ) ( 0.3556 , 0.6357 ) ( 0.5000 , 0.5000 ) .
Calculate their scores using the score function:
R = 0.0000 0.2082 0.4242 0.3335 0.4173 0.0174 0.0000 0.1329 0.1503 0.1139 0.2415 0.0512 0.0000 0.2167 0.2283 0.2851 0.1668 0.0460 0.0000 0.3638 0.2261 0.0469 0.1608 0.2777 0.0000 .
The net flows of the five alternatives are:
Φ = ( ϕ ( z 1 ) , ϕ ( z 2 ) , ϕ ( z 3 ) , ϕ ( z 4 ) , ϕ ( z 5 ) ) T = ( 2.1533 , 0.1028 , 0.2900 , 0.1313 , 1.8348 ) T
which gives the ranking of z 1 z 2 z 4 z 3 z 5 . Thus, the best scheme is z 1 . We present our proposed method in the following Algorithm 2.
Algorithm 2 The algorithm for the selection of the most important scheme of reservoir operation.
INPUT: A discrete set of schemes (alternatives) Z = { z 1 , z 2 , , z n } , a set of experts e = { e 1 , e 2 , , e s } and construction of PFPR R k = ( p i j ( k ) ) n × n for each expert.
OUTPUT: The selection of the optimal scheme.
  • begin
  • Calculate the energy and Laplacian energy of each PFDG D k ( k = 1 , 2 , , s ) .
  • Determine the wight vector for experts based on the energy of PFDGs by utilizing w k = E ( ( D μ ) k ) l = 1 s E ( ( D μ ) l ) , E ( ( D ν ) k ) l = 1 s E ( ( D ν ) l ) , and then, based on the Laplacian energy of PFDGs by utilizing w k = L E ( ( D μ ) k ) l = 1 s L E ( ( D μ ) l ) , L E ( ( D ν ) k ) l = 1 s L E ( ( D ν ) l ) , k = 1 , 2 , , s .
  • Utilize the PFWA operator to fuse all the individual PFPRs R k = ( r i j ( k ) ) n × n ( k = 1 , 2 , , s ) into the collective PFPR R = ( r i j ) n × n .
  • Calculate their scores using the score function s i j = μ i j 2 ν i j 2 .
  • Determine the net degree of preference of scheme z i over the other schemes by utilizing:
    ϕ ( z i ) = k = 1 s w k j = 1 j i n ( r i j ( k ) r j i ( k ) ) , i = 1 , 2 , , n .
  • Rank all the schemes z i ( i = 1 , 2 , , n ) according to the net flows ϕ ( z i ) ( i = 1 , 2 , , n ) .
  • Output the best scheme.
  • end

6. Conclusions

A Pythagorean fuzzy set model is suitable for modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary and human evaluation needed. Pythagorean fuzzy models give more precision, flexibility and compatibility to the system as compared to the classical, fuzzy and intuitionistic fuzzy models. A PFG can describe the uncertainty of all kinds of networks well. In this paper, we have introduced the concepts of energy and Laplacian energy of graphs in Pythagorean fuzzy circumstances and investigated their interesting properties. We have derived the lower and upper bounds for the energy and Laplacian energy of a PFG. We have also introduced the concept of the energy and Laplacian energy of a PFDG along with its applications in decision making problems. We are planing to extend our research work to: (1) interval-valued Pythagorean fuzzy graphs; (2) simplified interval-valued Pythagorean fuzzy graphs; and (3) hesitant Pythagorean fuzzy graphs.

Author Contributions

M.A. and S.N. conceived of the presented idea. S.N. developed the theory and performed the computations. M.A. verified the analytical methods.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. 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. [Google Scholar]
  2. Yager, R.R. Pythagorean membership grades in multi-criteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  3. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. 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]
  5. Peng, X.; Yuan, H.; Yang, Y. Pythagorean fuzzy information measures and their applications. Int. J. Intell. Syst. 2017, 32, 991–1029. [Google Scholar] [CrossRef]
  6. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  7. 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]
  8. Gutman, I. The energy of a graph. Ber. Math. Statist. Sekt. Forsch-Ungszentram Graz. 1978, 103, 1–22. [Google Scholar]
  9. Gutman, I. The energy of a graph: Old and new results. In Algebraic Combinatorics and Applications; Springer: Berlin, Germany, 2001; pp. 196–211. [Google Scholar]
  10. Gutman, I.; Zhou, B. Laplacian energy of a graph, Linear Algebra and its Application. J. Linear Algebra Appl. 2006, 414, 29–37. [Google Scholar] [CrossRef]
  11. Kaufmann, A. Introduction a la Theorie des Sour-Ensembles Flous; Masson et Cie: Paris, France, 1973. [Google Scholar]
  12. Zadeh, L.A. Similarity relations and fuzzy orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  13. Rosenfeld, A. Fuzzy graphs, Fuzzy Sets and their Applications; Zadeh, L.A., Fu, K.S., Shimura, M., Eds.; Academic Press: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
  14. Anjali, N.; Mathew, S. Energy of a fuzzy graph. Ann. Fuzzy Math. Inf. 2013, 6, 455–465. [Google Scholar]
  15. Sharbaf, S.R.; Fayazi, F. Laplacian energy of a fuzzy graph. Iran. J. Math. Chem. 2014, 5, 1–10. [Google Scholar]
  16. Parvathi, R.; Karunambigai, M.G. Intuitionistic fuzzy graphs. In Computational Intelligence, Theory and Applications; Springer: Berlin, Germany, 2006; pp. 139–150. [Google Scholar]
  17. Akram, M.; Davvaz, B. Strong intuitionistic fuzzy graphs. Filomat 2012, 26, 177–196. [Google Scholar] [CrossRef]
  18. Praba Chandrasekaran, B.V.M.; Deepa, G. Energy of an intutionistic fuzzy graph. Italian J. Pure Appl. Math. 2014, 32, 431–444. [Google Scholar]
  19. Basha, S.S.; Kartheek, E. Laplacian energy of an intuitionistic fuzzy graph. J. Sci. Technol. 2015, 8, 1–7. [Google Scholar]
  20. Akram, M.; Ishfaq, N.; Sayed, S.; Smarandache, F. Decision-making approach based on neutrosophic rough information. Algorithms 2018, 11, 59. [Google Scholar] [CrossRef]
  21. Akram, M.; Zafar, F. Rough fuzzy digraphs with application. J. Appl. Math. Comput. 2018, 11, 1–37. [Google Scholar] [CrossRef]
  22. Akram, M.; Luqman, A. Certain networks models using single-valued neutrosophic directed hypergraphs. J. Intell. Fuzzy Syst. 2017, 33, 575–588. [Google Scholar] [CrossRef]
  23. Akram, M.; Shahzadi, S.; Smarandache, F. Multi-attribute decision-making method based on neutrosophic soft rough information. Axioms 2018, 7, 19. [Google Scholar] [CrossRef]
  24. Sarwar, M.; Akram, M. An algorithm for computing certain metrics in intuitionistic fuzzy graphs. J. Intell. Fuzzy Syst. 2016, 30, 2405–2416. [Google Scholar] [CrossRef]
  25. Shahzadi, S.; Akram, M. Graphs in an intuitionistic fuzzy soft environment. Axioms 2018, 7, 20. [Google Scholar] [CrossRef]
  26. Naz, S.; Akram, M.; Smarandache, F. Certain notions of energy in single-valued neutrosophic graphs. Axioms 2018, 7, 50. [Google Scholar] [CrossRef]
  27. Naz, S.; Ashraf, S.; Akram, M. A novel approach to decision-making with Pythagorean fuzzy information. Mathematics 2018, 6, 95. [Google Scholar] [CrossRef]
  28. 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]
  29. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  30. Ashraf, S.; Naz, S.; Rashmanlou, H.; Malik, M.A. Regularity of graphs in single-valued neutrosophic environment. J. Intell. Fuzzy Syst. 2017, 33, 529–542. [Google Scholar] [CrossRef]
  31. 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]
  32. Naz, S.; Malik, M.A.; Rashmanlou, H. Hypergraphs and transversals of hypergraphs in interval-valued intuitionistic fuzzy setting. J. Mult.-Valued Logic Soft Comput. 2018, 30, 399–417. [Google Scholar]
  33. Dey, A.; Pal, A. Vertex coloring of a fuzzy graph using alpa cut. Int. J. Manag. IT Eng. 2012, 2, 340–352. [Google Scholar]
  34. Dey, A.; Pradhan, R.; Pal, A.; Pal, T. In the fuzzy robust graph coloring problem. In Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA), Bhubaneswar, Odisha, India, November 2014; Springer International Publishing: Cham, Switzerland, 2014; pp. 805–813. [Google Scholar]
  35. Dey, A.; Pal, A.; Pal, T. Interval type 2 fuzzy set in fuzzy shortest path problem. Mathematics 2016, 4, 62. [Google Scholar] [CrossRef]
  36. Dey, A.; Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F. A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs. Granul. Comput. 2018, 3, 1–7. [Google Scholar] [CrossRef]
  37. Broumi, S.; Dey, A.; Bakali, A.; Talea, M.; Smarandache, F.; Son, L.H.; Koley, D. Uniform single valued neutrosophic graphs. Neutrosophic Sets Syst. 2017, 17, 42–49. [Google Scholar]
  38. Estrada, E.; Hameed, E.; Langer, M.; Puchalska, A. Path Laplacian operators and superdiffusive processes on graphs. II. Two-dimensional lattice. Linear Algebra Its Appl. 2018, 555, 373–397. [Google Scholar] [CrossRef]
  39. Mathew, S.; Mordeson, J.N. Connectivity concepts in fuzzy incidence graphs. Inf. Sci. 2017, 382, 326–333. [Google Scholar] [CrossRef]
  40. Malik, D.S.; Mathew, S.; Mordeson, J.N. Fuzzy Incidence Graphs: Applications to Human Trafficking. Inf. Sci. 2018, 447, 244–255. [Google Scholar] [CrossRef]
  41. Mathew, S.; Mordeson, J.N. Fuzzy incidence blocks and their applications in illegal migration problems. New Math. Nat. Comput. 2017, 13, 245–260. [Google Scholar] [CrossRef]
  42. Jiang, Y.; Xu, Z.; Shu, Y. Interval-valued intuitionistic multiplicative aggregation in group decision making. Granul. Comput. 2017, 2, 387–407. [Google Scholar] [CrossRef] [Green Version]
  43. Xu, K.; Zhou, J.; Gu, R.; Qin, H. Approach for aggregating interval-valued intuitionistic fuzzy information and its application to reservoir operation. Expert Syst. Appl. 2011, 38, 9032–9035. [Google Scholar] [CrossRef]
  44. Wang, Y.M.; Fan, Z.P. Fuzzy preference relations: Aggregation and weight determination. Comput. Ind. Eng. 2007, 53, 163–172. [Google Scholar] [CrossRef]
Figure 1. Comparison of spaces of the IFNs and the Pythagorean fuzzy numbers (PFNs).
Figure 1. Comparison of spaces of the IFNs and the Pythagorean fuzzy numbers (PFNs).
Mathematics 06 00136 g001
Figure 2. Pythagorean fuzzy graph.
Figure 2. Pythagorean fuzzy graph.
Mathematics 06 00136 g002
Figure 3. Pythagorean fuzzy graph.
Figure 3. Pythagorean fuzzy graph.
Mathematics 06 00136 g003
Figure 4. Pythagorean fuzzy digraph.
Figure 4. Pythagorean fuzzy digraph.
Mathematics 06 00136 g004
Figure 5. Pythagorean fuzzy digraph.
Figure 5. Pythagorean fuzzy digraph.
Mathematics 06 00136 g005
Figure 6. Pythagorean fuzzy digraphs.
Figure 6. Pythagorean fuzzy digraphs.
Mathematics 06 00136 g006
Figure 7. Pythagorean fuzzy digraphs.
Figure 7. Pythagorean fuzzy digraphs.
Mathematics 06 00136 g007
Table 1. The aggregation results of the experts e k ( k = 1 , 2 , , 6 ) .
Table 1. The aggregation results of the experts e k ( k = 1 , 2 , , 6 ) .
Experts The Overall Results of the Experts
e 1 p 1 ( 1 ) ( 0.5595 , 0.5233 )
p 2 ( 1 ) ( 0.6581 , 0.5477 )
p 3 ( 1 ) ( 0.5360 , 0.5384 )
p 4 ( 1 ) ( 0.6130 , 0.5785 )
e 2 p 1 ( 2 ) ( 0.5145 , 0.5623 )
p 2 ( 2 ) ( 0.5542 , 0.5595 )
p 3 ( 2 ) ( 0.5709 , 0.5335 )
p 4 ( 2 ) ( 0.7189 , 0.4356 )
e 3 p 1 ( 3 ) ( 0.6187 , 0.4325 )
p 2 ( 3 ) ( 0.6031 , 0.5144 )
p 3 ( 3 ) ( 0.4034 , 0.6117 )
p 4 ( 3 ) ( 0.5647 , 0.4356 )
e 4 p 1 ( 4 ) ( 0.5595 , 0.5144 )
p 2 ( 4 ) ( 0.4235 , 0.5097 )
p 3 ( 4 ) ( 0.6610 , 0.4865 )
p 4 ( 4 ) ( 0.6581 , 0.4681 )
e 5 p 1 ( 5 ) ( 0.6884 , 0.4356 )
p 2 ( 5 ) ( 0.5877 , 0.5384 )
p 3 ( 5 ) ( 0.4419 , 0.5958 )
p 4 ( 5 ) ( 0.5715 , 0.4606 )
e 6 p 1 ( 6 ) ( 0.6884 , 0.3936 )
p 2 ( 6 ) ( 0.5982 , 0.4527 )
p 3 ( 6 ) ( 0.5595 , 0.5791 )
p 4 ( 6 ) ( 0.4034 , 0.5180 )

Share and Cite

MDPI and ACS Style

Akram, M.; Naz, S. Energy of Pythagorean Fuzzy Graphs with Applications. Mathematics 2018, 6, 136. https://doi.org/10.3390/math6080136

AMA Style

Akram M, Naz S. Energy of Pythagorean Fuzzy Graphs with Applications. Mathematics. 2018; 6(8):136. https://doi.org/10.3390/math6080136

Chicago/Turabian Style

Akram, Muhammad, and Sumera Naz. 2018. "Energy of Pythagorean Fuzzy Graphs with Applications" Mathematics 6, no. 8: 136. https://doi.org/10.3390/math6080136

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