Energy of Pythagorean Fuzzy Graphs with Applications

: 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.


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 c n 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: characterized by a membership function µ P and a non-membership function ν P , where: is called a Pythagorean fuzzy index or degree of hesitancy of z in P.
For computational convenience, β = (µ β , ν β ) is called a PFN [4], where 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 so the space of PFS's membership degree is greater than the space of IFS's membership degree, as shown in Figure 1.
Comparison of spaces of the IFNs and the Pythagorean fuzzy numbers (PFNs).

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: 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.

Definition 3. The adjacency matrix
, 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: Example 2. The adjacency matrix of a PFG given in Figure 2 is: .
The spectrum and the energy of a PFG G, given in Figure 2, are as follows: Now, E(µ Q (z i z j )) = 3.8369 and E(ν Q (z i z j )) = 6.3190.
Theorem 1.Let G = (P, Q) be a PFG and A(G) be its adjacency matrix.If , respectively, then:

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: Hence: Analogously, we can show that 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: 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: Proof By comparing the coefficients of λ n−2 in the characteristic polynomial: we have: Substituting (3) in (2), we obtain: Substituting ( 4) in (1), we obtain: Therefore, Lower bound: Analogously, we can show that The following result gives us the upper bound of the energy of a PFG, with the conditions 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. 2 , then: Applying the Cauchy-Schwarz inequality to the vectors (1, 1, . . ., 1) and (|λ 1 |, |λ 2 |, . . ., |λ n |) with n − 1 entries, we get: Substituting ( 5) in ( 6), we must have: Now, since the function: decreases on the interval: Therefore, Equation (7) implies: Analogously, we can show that: by routine calculus, it is easy to show that f (y

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, , 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: . 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.
, respectively, then: Proof.(i) Since L(G) is a symmetric matrix with non-negative Laplacian eigenvalues, such that: Similarly, it is easy to show that, (ii) By the definition of Laplacian matrix, we have: .
By the trace properties of a matrix, we have: where: Analogously, we can show that Definition 9.The Laplacian energy of a PFG G = (P, Q) is defined as: Theorem 6.Let G = (P, Q) be a PFG, and let L(G) be the Laplacian matrix of G.
Therefore, Laplacian Spec(G) = {(0, 0), (0.4877, 0.9099), (0.8810, Therefore, LE(G) = (6.8454,11.5615).Furthermore, we have: 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, Proof.Applying the Cauchy-Schwarz inequality to the n numbers 1, 1, . . ., 1 and Analogously, it is easy to show that 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: Similarly, it is easy to show that 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: Proof.Using the Cauchy-Schwarz inequality, we get: . Therefore: Similarly, we can show that LE(ν Q (z i z j )) Theorem 10.If the PFG G = (P, Q) is regular, then: Proof.Let G be a regular PFG, then: Substituting ( 9) in ( 8), we get Similarly, it is easy to show that LE(ν Q (z i z j ))

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: where Re(t i ) and Re(w i ) represent the real part of eigenvalues t i and w i , respectively.
The spectrum and the energy of a PFDG D given in Figure 4 are:

Now, E(µ−
We now discuss the Laplacian energy of Pythagorean fuzzy digraphs.
of D is a n × n diagonal matrix defined as: Definition 13.The Laplacian matrix of a PFDG D = (P, , 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.

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.
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.

Aggregate all p
(k) ij (j = 1, 2, . . ., n) corresponding to the testing venue z i , and get the PFE p (k) i of the testing venue z i over all the other testing venues for the expert e k by using the PFA operator.5. Aggregate all p (k) i (k = 1, 2, . . ., s) into a collective PFE p i for the testing venue z i using the PFWA operator.6. Compute the score functions s(p i ) of p i (i = 1, 2, . . ., n). 7. Rank all the testing venues z i (i = 1, 2, . . ., n) according to s(p i )(i = 1, 2, . . ., n). 8. Output the optimal testing venue.9. end

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.z 1 : Maximum plant output, enough supply of water used in the Tao River basin, lower and higher supply for society and the economy; z 2 : 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; z 3 : 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; z 4 : 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; z 5 : 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.

Algorithm 2
The algorithm for the selection of the most important scheme of reservoir operation.7. Rank all the schemes z i (i = 1, 2, . . ., n) according to the net flows φ(z i )(i = 1, 2, . . ., n). 8. Output the best scheme.9. end

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.

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 (k) ij ) n×n for each expert.OUTPUT: The selection of the optimal testing venue.1. begin 2. Calculate the energy and Laplacian energy of each PFDG D k (k = 1, 2, . . ., s). 3. Determine the wight vector for experts based on the energy of PFDGs by utilizing w