Abstract
Picture fuzzy graph, belonging to fuzzy graphs family, has good capabilities at times when we are faced with problems that cannot be expressed by fuzzy graphs and intuitionistic fuzzy graphs. When an element membership is not clear, neutrality is a good option that can be well-supported by a picture fuzzy graph. The previous definitions limitations in fuzzy graph energy have led us to offer new definitions in picture fuzzy graphs. In this article, we expanded the energy concept on the picture fuzzy graph and sought to use this concept in modeling issues related to this graph and solving some problems including the neutrality state. We were able to show that neutrality, as part of total energy, is effective in energy-based decisions. This is noticeable in some types of energy and is more pronounced. We were looking for a way to rank the available options using the picture fuzzy graph and its Laplacian energy/energy in decision making. We studied some types of energy including Laplacian and skew Laplacian in both picture fuzzy graphs and picture fuzzy digraphs, and discussed some of its properties. We discussed some energy boundaries in this graph, and finally, the applications of energy were presented.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Graphs have long been used to describe objects and the relationships between them. Many of the issues and phenomena around us are associated with complexities and ambiguities that make it difficult to express certainty. These difficulties were alleviated by the introduction of fuzzy sets by Zadeh [48]. This concept established well-grounded allocation membership degree to elements of a set. The existence of a single degree for a membership could not resolve the ambiguity on uncertain issues, so the need for a degree of membership was felt. Afterward, to overcome the existing ambiguities, Atanassov [7] introduced non-membership degrees and defined an intuitionistic fuzzy set as the sum of degrees not greater than 1. This set is used in image processing [11], robotic system [17], decision making [23], medical diagnosis [43] and etc. Fuzzy graphs were presented in different types, and researchers conducted many studies about their properties and characteristics [3132, 34, 35, 37, 38, 40, 44,45,46]. Liu et al. [24] presented t-spherical fuzzy 2-tuple linguistic muirhead mean aggregation operators. Naz et al. [26] explained decision analysis under the hesitant dual fuzzy environment q-rung orthopair. An extension of social network group decision-making based on trust rank and personas was proposed by Cai et al. [10]. Pal et al. [25] investigated new concepts in neutrosophic graphs. Certain properties of single-valued neutrosophic graph, presented by Zeng et al. [49]. Rao et al. [33], studied intuitionistic fuzzy tree.
Intuitionistic fuzzy graphs have only two modes of membership and non-membership, but in some issues such as voting, medical diagnosis, and etc., we also face a state of neutrality. When it comes to the climate impact on the human environment in different climatic conditions, ineffectiveness, in addition to being effective or not, can be proposed. To resolve this case, Cuong and Kreinevich [14] presented the concept of picture fuzzy set (PFS) as a combination of the fuzzy set (FS) and intuitionistic fuzzy set (IFS). Any element in this set is inclusive of three degrees of being a member, neutral, and non-member, where the sum of degrees is not greater than 1. Some PFS properties were studied by Cuong [13]. Phong et al. [30] investigated some picture fuzzy relations combinations. A fuzzy inference system on PFSs was proposed by Son et al. [42]. Akram et al. [3] examined the q-Rung PFG. Zuo et al. [51] gave some operations on PFG, i.e., union, joint, and Cartesian products. Meanwhile, Xiao et al. [47] studied regular PFGs and Garg [19] studied some picture fuzzy aggregation operations. Khan et al. [22] introduced bipolar PFGs. Amanathulla et al. [5] initiated the concept of balanced PFGs. An approach to decision-making via picture fuzzy soft graphs was introduced by Chellamani et al. [12]. Certain operations on picture fuzzy graph were studied by Shoaib et al. [41]. Picture fuzzy incidence graphs were introduced by Nazeer and Rashid [28].
On the advent of graph theory over algebraic graph theory, algebraic methods were used to study graphs. The main branch of algebraic graph theory is the spectral graph theory, which studies the characteristics of polynomial properties, eigenvalues, and eigenvectors related to graph matrices. Conceptual energy is related to the spectrum of a graph that plays an important role in recognizing patterns, modeling virus spread in computer networks, and securing personal data in databases. The energy of a graph is a useful tool in deciding which option to choose. When searching for the best option in decisions, the application of energy, because of the expression of the strength of the graph obtained from the selected vertices, is a great help in determining the desired option. This was a good incentive for researchers to study graph energies. Gutman [20] introduced the concept of a graph energy. He found this concept in the study of the electrons energy of specific molecules. In fact, the energy of a given molecular graph compared to the total energy of the electrons of a molecule is of interest to chemists. Obviously, the energy of a graph with all isolated vertices is zero, but for a complete graph with n vertices, it is \(2(n - 1)\). The energy of a graph is used for entropy [16], properties of proteins [18], Alzheimer’s disease [15], etc. The Laplacian energy (LE) of a graph is defined by Gutman and Zhou [21]. This was obtained from the sum of the absolute values of the differences of the mean degree vertices of a graph with its Laplacian eigenvalues. The LE is applied in image analysis [50], brain activity [9], etc. Pena and Rada analyzed the digraph energy [29]. The digraph skew energy was introduced by Adiga and Balakrishnan [2]. The skew Laplacian energy (SLE) of a digraph was defined by Adiga and Smitha [1]. Other types of energy were later introduced by researchers. The energy of pythagorean fuzzy graphs was proposed by Akram and Naz [4]. Certain notions of energy in single-valued neutrosophic graphs were introduced by Naz et al. [27].
The fuzzy graph (FG) energy was introduced by Anjali and Mathew [6]. The LE of an FG was defined by Sharbaf and Fayazi [39]. Basha and Kartheek [8] generalized the LE concept of an FG to the Laplacian energy (LE) of an IFG. Simultaneously, with the variety of FGs, different energies of fuzzy graphs were introduced. The limitation of previous definitions of energy in FGs and IFGs led us to define energy in a PFG. Since PFG is a good tool in fuzzy modeling of uncertain problems, for its degree of neutrality, it is a good incentive to examine the energy in it, especially in decisions based on the degree of neutrality. This shows that neutrality, as part of total energy, is effective in energy-based decisions.
In this research, with the aim of developing energy on a PFG and examining its properties, we sought to use the energy applications of this graph to solve real problems. We studied the PFG energy, PFG Laplacian energy and picture fuzzy digraph (PFDG) Laplacian energy. We also introduced the PFDG skew Laplacian energy. We compared three types of energy in varying degrees with examples. In addition, considering the decision making, a method was proposed to rank the available options using the PFG and its Laplacian energy/energy. Some of the energy boundaries were examined, and finally, the applications of energy were presented.
2 Preliminaries
In this section, we have an overview of the concepts we need in this article.
A graph \(G=(V,E)\) is a mathematical model consisting of a set of vertices V and a set of edges E, where each is an unordered pair of distinct vertices. If G is a graph with n vertices and m edges, Its adjacency matrix (AM) M is the \(n\times n\) matrix whose ij-th entry is the number of edges joining vertices i and j. The eigenvalues \(\lambda _i\), \(i=1,2,\ldots ,n\), of the AM of G are the eigenvalues of G. The spectrum \(\lbrace \lambda _1,\lambda _2,\ldots ,\lambda _n\rbrace\) of the AM of G is the spec(G). The eigenvalues of a graph satisfy the following relations:
The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of the eigenvalues of G, i.e., \(E(G)=\sum _{i=1}^n \mid \lambda _i \mid\). The energy of a digraph D, denoted by E(D), is defined as the sum of the absolute values of the real part of eigenvalues of D, i.e., \(E(D)=\sum _{i=1}^n \mid Re(z_i)\mid\). A graph with all isolated vertices \(K_n^c\) has zero energy while the complete graph \(K_n\) with n vertices has \(2(n-1)\) energy. The LE of a graph G with n vertex and m edge is \(\mathrm{LE}(G)=\sum _{i=1}^n \mid \lambda _i-\frac{2m}{n} \mid\) where \(\lambda _i\) relates to the eigenvalues of LM of G. The skew energy of G is some of the absolute values [8] of eigenvalues. The skew adjacency matrix (SAM) of the digraph G is a matrix so that the (i, j)-entry of the SAM is \(+1\) if an edge is directed from the i-th vertex to the j-th vertex, vice versa the (j, i)-entry is \(-1\). If there is no directed edge between the nodes i and j, then, the respective matrix element is zero.
The SLE of the digraph G is defined as:
where \(\lambda _i\) refers to the eigenvalues of the LM of the digraph G.
Definition 1
[48] An FS \(\nu\) on a set V is defined through its membership function \(\nu :V\rightarrow [0,1]\), where \(\nu (x)\) represents the degree to which point \(x\in V\) belongs to the FS. The smallest and largest elements are the functions constantly equal to 0 and 1, respectively.
A fuzzy relation on a set V is a mapping \(\eta :V\times V\rightarrow [0,1]\) so that \(\eta (x,y)\le \min \lbrace \nu (x),\nu (y)\rbrace\) for all \(x,y\in V\). A fuzzy relation \(\eta\) is symmetric if \(\eta (x,y)=\eta (y,x)\), for all \(x,y\in V\).
Definition 2
[36] An FG \(Z=(V,\nu ,\eta )\) is a non-empty set V together with a pair of functions \(\nu :V\rightarrow [0,1]\) and \(\eta :V\times V\rightarrow [0,1]\) so that \(\eta (xy)\le \min \lbrace \nu (x),\nu (y)\rbrace\), for all \(x,y\in V\). Here \(\eta\) is a symmetric fuzzy relation on \(V\times V\).
Definition 3
[14] A PFS A on X is specified as follow
so that
and
where \(\mu _A(x)\), \(\eta _A(x)\) and \(\nu _A(x)\) are called the degrees of positive, neutral, and negative membership of x in A.
Definition 4
[51] A picture fuzzy relation B is a PFS of \(X\times Y\) as shown by
so that
and
Definition 5
[51] A pair \(G=(A,B)\) is called a PFG on \(G^*=(V, {\mathcal {E}})\) where A is a PFS on V and B is a picture fuzzy relation on \({\mathcal {E}}\subseteq V\times V\) so that for each \(xy\in {\mathcal {E}}\)
Definition 6
[51] The degree of a vertex x on PFG \(G=(A,B)\) is specified as follow:
where for every \(xy\in {\mathcal {E}}\)
Example 1
Consider a PFG as shown in Fig. 1. The vertex degree z is (1, 3, 0.2, 0.8) while the vertex degree y is (0.8, 0.3, 0.4) .
Some notations are listed in the table of abbreviations.
3 Energy of Picture Fuzzy Graph
In this section, some of the most important PFG energies will be studied and their properties will be examined.
Definition 7
The AM M(G) of a PFG \(G=(A,B)\) is specified as a square matrix \(M(G)=[m_{ij}]\), \(m_{ij}=(\mu _B(x_ix_j),\eta _B(x_ix_j),\nu _B(x_ix_j))\), and this can be written as three matrices \(M(\mu _B(x_ix_j))\), \(M(\eta _B(x_ix_j))\), and \(M(\nu _B(x_ix_j))\), thus,
Definition 8
The energy of a PFG \(G=(A,B)\) is specified as the follow:
in other words,
where \(\alpha _i\), \(\beta _i\), and \(\gamma _i\) are eigenvalues of \(M(\mu _B(x_ix_j))\), \(M(\eta _B(x_ix_j))\), and \(M(\nu _B(x_ix_j))\), respectively.
Example 2
Consider a PFG \(G=(A,B)\) given in Fig. 2. The AM M is as follows:
The AMs and eigenvalues of each degree of G are obtained as follows:
So, the energy of a PFG \(G=(A,B)\) is equal to \(E(G)=(1.852, 1.821, 2.514)\).
Theorem 1
Let \(G=(A,B)\) be a PFG and M(G) be its AM. If \(\alpha _1 \ge \alpha _2 \ge \dots \ge \alpha _n\), \(\beta _1 \ge \beta _2 \ge \dots \ge \beta _n\), and \(\gamma _1 \ge \gamma _2 \ge \dots \ge \gamma _n\), are the eigenvalues of \(M(\mu _B(x_ix_j))\), \(M(\eta _B(x_ix_j))\), and \(M(\nu _B(x_ix_j))\), respectively, then,
Proof
(i) is held because M(G) is a symmetric matrix with zero trace.
(ii) According to the trace properties of a matrix, we have
On the other hand,
Therefore,
Similarly, \(\sum _{i=1}^n\beta _i^2=2\sum _{1\le i<j\le n}(\eta _B(x_ix_j))^2\), and \(\sum _{i=1}^n\gamma _i^2=2\sum _{1\le i<j\le n}(\nu _B(x_ix_j))^2\). \(\square\)
Theorem 2
If \(G=(A,B)\) is a PFG on n vertices with the AM M(G), then,
Proof
According to the Cauchy–Schwarz inequality to the vectors \((1,1,\dots , 1)\) and \((\mid \alpha _1\mid , \mid \alpha _2\mid , \dots , \mid \alpha _n\mid )\) with n entries, we have
By comparing the coefficients of \(\alpha ^{n-2}\) in the characteristic
By placing (3) in (2), we have
By placing (4) in (1), we have
Hence,
For lower bound
Since \(AM\{\mid \alpha _i \alpha _j \mid \} \ge \mathrm{GM} \{\mid \alpha _i \alpha _j\mid \}\), \(1\le i< j \le n\), therefore,
Also,
Therefore,
Hence,
Similarly (ii) and (iii) are also established, of course, the upper bound is subjected to the following conditions \(n \le 2 \sum _{1\le i< j\le n } (\mu _\beta (x_i x_j))^2\), \(n \le 2 \sum _{1\le i< j\le n } (\eta _\beta (x_i x_j))^2\), and \(n \le 2 \sum _{1\le i< j\le n } (\gamma _\beta (x_i x_j))^2\). \(\square\)
Theorem 3
Let \(G=(A,B)\) be a PFG on n vertices. If \(n\le 2\sum _{1\le i<j\le n}(\mu _B(x_ix_j))^2\), \(n\le 2\sum _{1\le i<j\le n}(\eta _B(x_ix_j))^2\), and \(n\le 2\sum _{1\le i<j\le n}(\nu _B(x_ix_j))^2\), then
Proof
If \(M=[m_{ij}]_{n \times n}\) is a symmetric matrix with zero trace, then, \(\alpha _{\max } \ge \dfrac{2 \sum _{1\le i< j\le n } m_{ij}}{n}\), where \(\alpha _{\max }\) is the maximum eigenvalue of M(G) and is the AM of a PFG G, then, \(\alpha _1 \ge \dfrac{2 \sum _{1\le i< j\le n }\mu _\beta (x_ix_j)}{n}\), where \(\alpha _1 \ge \alpha _2 \ge \dots \ge \alpha _n\). On the other hand, since
According to the Cauchy–Schwarz inequality to the vectors \((1,1,\dots , 1)\) and \((\mid \alpha _1\mid , \mid \alpha _2\mid , \dots , \mid \alpha _n\mid )\) with \(n-1\) entries, we have
Since the least value of the function \(F(x) = x+ \sqrt{(n-1) \left( 2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2 - x^2 \right) }\) is in the interval \(\left( \sqrt{\dfrac{2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2}{n}} , \sqrt{2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2} \right)\),
\(n \le 2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2\), \(1\le \dfrac{2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2}{n}\). So,
Therefore, the inequality (7) holds
Similarly, we can show (ii) and (iii). \(\square\)
Theorem 4
If \(G=(A,B)\) is a PFG on n vertices, then \(E(G)\le \dfrac{n}{2}(1+\sqrt{n})\).
Proof
Suppose that \(G=(A,B)\) is a PFG on n nodes and \(n \le 2 \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2 = 2 z\). It can be easily shown that \(f(z) = \dfrac{2z}{n} + \sqrt{(n-1) \left( 2 z - \left( \dfrac{2z}{n} \right) ^2 \right) }\) is maximized when \(z= \dfrac{n^2 + n \sqrt{n}}{4}\). By placing this value of z in Theorem 3; we have
Similarly,
Therefore, \(E(G) \le \dfrac{n}{2} (1+\sqrt{n})\). \(\square\)
Definition 9
Let \(G=(A,B)\) be a PFG on n nodes. The degree matrix \(K(G)=[k_{ij}]\) of G is a \(n\times n\) diagonal matrix which is defined as:
Definition 10
The LM of a PFG \(G=(A, B)\) is defined as \(L(G)=K(G)-M(G)\), where K(G) and M(G) are the degrees matrix and AM of a PFG, respectively.
Definition 11
The LE of PFG \(G=(A,B)\) is specified as the following:
where
\(\varphi _i^*\), \(\psi _i^*\) and \(\omega _i^*\), \(i=1,2,\ldots ,n\) are the eigenvalues of \(L(\mu _B(x_ix_j))\), \(L(\eta _B(x_ix_j))\) and \(L(\nu _B(x_ix_j))\), respectively.
Example 3
Consider a PFG G given in Fig. 3.
The AM, degree matrix, and LM are as follows, respectively.
After computing we have \(\mathrm{LE}(\mu _B(x_ix_j))=1.681\), \(\mathrm{LE}(\eta _B(x_ix_j))=1.516\) and \(\mathrm{LE}(\nu _B(x_ix_j))=3.806\).
So, \(\mathrm{LE}(G)=(1.681,1.516.3.806)\).
Theorem 5
Let \(G=(A,B)\) be a PFG and L(G) be the LM of G. If \(\varphi _1^*\ge \varphi _2^*\ge \cdots \ge \varphi _n^*\), \(\psi _1^*\ge \psi _2^*\ge \cdots \ge \psi _n^*\) and \(\omega _1^*\ge \omega _2^*\ge \cdots \ge \omega _n^*\) are the eigenvalues of \(L(\mu _B(x_ix_j))\), \(L(\eta _B(x_ix_j))\) and \(L(\nu _B(x_ix_j))\), respectively, then,
Proof
(i) Since L(G) is a symmetric matrix with non-negative Laplacian eigenvalues, therefore,
Then, \(\sum _{i=1}^n \varphi _i^* =2 \sum _{1\le i< j\le n } \mu _\beta (x_i x_j)\). Similarly, \(\sum _{i=1}^n \psi _i^* = 2 \sum _{1\le i< j\le n } \eta _\beta (x_i x_j)\) and \(\sum _{i=1}^n \omega _i^* = 2 \sum _{1\le i< j\le n } \nu _\beta (x_i x_j)\).
(ii) According to the trace properties of a matrix, we have
where
Therefore,
Similarly, the other equation are fixed. \(\square\)
Proposition 6
Let \(G=(A,B)\) be a PFG and L(G) be the LM of G. If \(\varphi _1^*\ge \varphi _2^*\ge \cdots \ge \varphi _n^*\), \(\psi _1^*\ge \psi _2^*\ge \cdots \ge \psi _n^*\), and \(\omega _1^*\ge \omega _2^*\ge \cdots \ge \omega _n^*\) are the eigenvalues of \(L(\mu _B(x_ix_j))\), \(L(\eta _B(x_ix_j))\), and \(L(\nu _B(x_ix_j))\), respectively, and
then,
where
Theorem 7
Let G be a PFG on n vertices and L(G) be the LM of G, then
Proof
According to the Cauchy–Schwarz inequality to the n numbers \(1,1,\ldots ,1\) and \(\mid \varphi _1\mid ,\mid \varphi _2\mid ,\ldots ,\mid \varphi _n\mid\), we have
because
So, we have
Similarly, we can show other inequalities. \(\square\)
Theorem 8
Let G be a PFG on n vertices and L(G) be the LM of G. Then,
Proof
According to the assumptions we have
which will be demonstrated with situation (i). Similarly, we can prove another inequality. \(\square\)
Theorem 9
Let G be a PFG on n vertices and L(G) be the LM of G. Then,
Proof
Using the Caushy–Schwarz inequality, we get
Since \(M_\mu = \sum _{1\le i< j\le n } (\mu _\beta (x_ix_j))^2 + \dfrac{1}{2} \sum _{i=1}^n \left( d_\mu (x_i) - \dfrac{2 \sum _{1\le i< j\le n } \mu _\beta (x_ix_j)}{n} \right) ^2\), so
Similarly, other inequalities are proved. \(\square\)
Remark
All results from the energy of a PFG are confirmed for a PFDG while eigenvalues are complex numbers we spot real part therefrom. Herein, suffice it to say the following definition.
Definition 12
Let \(D=(A,\overrightarrow{B})\) be a PFDG. The energy of D is defined as follow:
Here, we survey the LE of the PFDGs.
Definition 13
The out-degree matrix of a PFG is shown with symbol \(K^+(D)=[k_{ij}]\) and it is a \(n\times n\) diagonal matrix defined as
Definition 14
The LM of PFDG \(D=(A,\overrightarrow{B})\) is defined as follow:
where \(K^+(D)\) and M(D) are the out-degree matrix and AM of D, respectively.
Definition 15
The LE of a PFDG \(D=( A,\overrightarrow{B})\) is specified as follow:
where
\(t_i^*\), \(w_i^*\), and \(z_i^*\), are real part the eigenvalues of \(L\big (\mu _{\overrightarrow{B}}(x_ix_j)\big )\), \(L\big (\eta _{\overrightarrow{B}}(x_ix_j)\big )\) and \(L\big (\nu _{\overrightarrow{B}}(x_ix_j)\big )\), respectively.
Example 4
Consider a PFDG \(D=( A,\overrightarrow{B})\) which is given in Fig. 4.
So, the energy of PFDG is as follow:
On the other hand,
We have
So, \(\mathrm{LE}(D)=(2.532,0.754,2.018)\).
One of the energies of a digraph is skew energy. Here, we define the SLE of a PFDG.
Definition 16
Let \(D^*=(V,\overrightarrow{{\mathcal {E}}})\) be a simple digraph without any loop and multiple arcs and \(D=(A,\overrightarrow{B})\) be a PFDG on \(D^*\).The SAM of D is the matrix in the form of
where
Definition 17
The SLE of the PFDG \(D=(A,\overrightarrow{B})\) is specified as
where \(p_i\), \(q_i\) and \(r_i\) are eigenvalues of the LM \(L(D)=K^+(D)-S(D)\) of D.
Example 5
Consider a PFDG which is given in Fig. 5.
The SAM of D is as the follow:
The skew Laplacian spectrum of a PFDG D, given in Fig. 5, is
So, the SLE of D is
Theorem 10
If D is a simple PFDG with vertex degrees of \(d(x_1),d(x_2),\ldots ,d(x_n)\) where \(d(x_i)=(d_{\mu }(x_i),d_{\eta }(x_i),d_{\nu }(x_i))\), then,
Proof
Let \(p_1,p_2,\ldots ,p_n\) be the eigenvalues of the LM \(L(\mu _{\overrightarrow{B}}(x_ix_j))=K^+(\mu _{\overrightarrow{B}}(x_ix_j))-S(\mu _{\overrightarrow{B}}(x_ix_j))\) where \(K^+(\mu _{\overrightarrow{B}}(x_ix_j))\) and \(S(\mu _{\overrightarrow{B}}(x_ix_j))\) are out-degree matrix and SAM of membership element of D. We have
Since \(\mu _{ij}^2=\mid \mu _{ij}\mid\) for \(i<j\), so,
Thus,
Similarly, we can show that
This completes the proof. \(\square\)
4 Applications
4.1 Selecting a Suitable Construction Plan in Different Climatic Zone
In studying the characteristics of housing and architecture, not only historical and economic factors should be carefully studied, but also the impact of natural geographical factors on housing architecture in different climatic regions should be considered. Architects have traditionally paid attention to nature and the surrounding environment and have maintained a peaceful relationship with nature in the traditional way, and in architecture, they have always paid attention to the environment and nature around them. The house in the warm and dry climate had dense, introverted plans facing the central courtyard. These houses showed all their beauties to the family. Traditional houses in the cold climate were also built as a central courtyard and had dense and compact plans. In temperate and humid climates, due to the high humidity in traditional houses, the roofs are sloping and the porches around the building have been considered as an important space in the house. The shape of the building is also unlike the hot and dry climate houses which have a central courtyard. This area has been designed extroverted and the view of the windows of the house and the yard has been around it. A construction holding company is considering new plans for housing based on advisers’ opinions. These plans include:
-
(1)
Access to public services.
-
(2)
Architectural style.
-
(3)
Infrastructure networks.
-
(4)
Auxiliary facilities.
-
(5)
Smart systems.
These plans and relations are more important for housing and employment in climate regions. In relation to different climatic regions, carrying out the above plans for the construction company is associated with avail, loss, or neutral states. Doing any of the above projects is directly or indirectly related to other projects. We showed the interactions of the above designs in terms of their location in different climatic points in the form of a PFDG. Therefore, we consider a PFDG at three climate regions of cold, temperate, and warm. Afterward, the energy, LE, and SLE of a PFDG are calculated for each of these regions.
The above plans are considered for the cold regions as a PFDG \(D_1\) shown in Fig. 6. The picture fuzzy numbers for the vertices are the percentage of the impact of each of the construction company’s plans for construction in different climatic zones. These percentages are determined by the opinion of consultants and based on the experiences and statistics available in the company. The relationships between the vertices are the edges that represent the most connection between the plans of the company, and therefore the edges are all strong.
In this digraph, the plan degree \(x_3\) is (0.5, 0.2, 0.1). i.e. in cold regions in which for applying this plan \(50\%\) is avail, \(20\%\) is neutral and \(10\%\) is loss, too, and the degree of impact of infrastructure networks on intelligent systems \((x_3x_5)\) is (0.3, 0.2, 0.3). i.e. \(30\%\) is avail, \(20\%\) is neutral and \(40\%\) is loss.
We calculated energy, LE, and SLE.
So, \(E(D_1)=(0.6603,0.4,0.7113)\). Also,
So, \(LE(D_1)=(1.8,0.72,1.18)\).
So, the SLE \(D_1\) is equal to
The PFDG \(D_2\) shown in Fig. 7 is considered for temperate regions.
After calculation, we have
So, \(E(D_2)=(0.7258,0.2,0.6604)\).
So, \(LE(D_2)=(2.04,0.72,1.14)\).
So, the SLE \(D_2\) is equal to
For warm regions, a PFDG \(D_3\) shown in Fig. 8 is considered.
After calculation, we have
So, \(E(D_3)=(0.8617,0.2518,0.6349)\).
So, \(LE(D_3)=(2.154,0.4,1.16)\).
So, the SLE \(D_3\) is equal to
The figures 9, 10 and 11 represent a comparison between the energy, LE, and SLE of applied plans in three regions corresponding to the avail, neutral, and loss memberships, respectively. From the above bar graphs, the energy, LE and SLE of avail membership for warm regions is high as compared to other regions. This shows that the above designs are more efficient in hot areas and more coherence between the designs can be considered. The energy, LE, and SLE of neutral membership for cold regions is high and the energy, LE, and SLE of loss membership for cold regions is high.
4.2 Choosing the Best Place to Start a Business
Everyone who works in business has heard that one of the most important factors in ensuring the profitability of a business is its location. Basic decision making in this field can transform a startup and lead to growing success. The size, layout, physical location and appearance of the workplace should all serve to develop your operations. The deeper you go into your business plan, the more realistic and tangible your budget for your property and business expenses will be, given the infrastructure, tax laws, facilities, regional laws, environmental regulations, and growth potential. In addition to physical businesses, this also affects Internet businesses.
Four different locations were considered for starting a new business, and a group of four consultants in finance, business, real estate and law were invited to decide on the appropriate location. Each expert made separate judgments based on their experiences and comparisons between the two different locations. These views were based on three factors: appropriate, neutral and inappropriate. The AMs related to picture fuzzy relations to each of the experts are as follows:
The PFDGs \(D_i\) corresponding to picture fuzzy preference relation (PFPR) given in matrices \(M_i\) are shown in Fig. 12\((i = 1, 2, 3, 4)\). The energy of each PFDG is calculated as:
Then, the weight of each expert can be calculated as:
The collective picture fuzzy preference relation (PFPR), aggregated from the four PFPRs, is determined as:
A PFDG corresponding to a collective PFPRA above is drawn, as shown in Fig. 13. Then, under the \(\mu _{j_k} \ge 0.5~~(j,k=1,2,3,4)\) condition, a partial diagram is drawn, as shown in Fig. 14.
Calculate the out-degrees \(d^+(x_i)~~(i=1,2,3,4)\) of all criteria in a partial PFDG as follow:
According to membership degrees of \(d^+(x_i)\,(i=1,2,3,4)\), we get the ranking of the places \(x_i\) as:
Therefore, the best choice is \(x_1\).
The flowchart for the selection of the best choice in business is as follow:
5 Conclusions
The PFG can amplify flexibility and precision to model complex real-time problems better than an FG and IFG. They have several applications in many decision-making processes among solution choice, weather forecasting, prognosis risks in business, etc. In recent years, graph energy has been used in many fields. It is clear that the neutrality degree is associated with more flexibility for the graph energy. In this research, aiming at expanding the concept of energy on the PFG and using its results in modeling and solving the problems ahead, we studied some types of energy and their results in the PFG. We were able to show that neutrality, as part of total energy, is effective in energy-based decisions. Neutral energy is more pronounced in some types of energy and is not always very small compared to membership and non-membership degrees. We have obtained some properties and relations of lower and upper bounds of energy, LE, and SLE of PFG. Despite the energy fluctuations in different degrees of the PFG, no significant relationship was found between the degrees of energy. Finally, we presented applications of energy in decision-making based on superior choice. Examining the energy in the interval-valued intuitionistic fuzzy graph is an interval of the amount of our future work plans.
Availability of data and material
Not applicable.
Abbreviations
- Notation:
-
Meaning
- FS:
-
Fuzzy set
- FG:
-
Fuzzy graph
- PFS:
-
Picture fuzzy set
- PFG:
-
Picture fuzzy graph
- PFDG:
-
Picture fuzzy digraph
- AM:
-
Adjacency matrix
- LM:
-
Laplacian matrix
- SAM:
-
Skew adjacency matrix
- LE:
-
Laplacian energy
- SLE:
-
Skew Laplacian energy
References
Adiga, C., Smitha, M.: On the skew Laplacian energy of a digraph. Int. Math. Forum 4(3), 1907–1914 (2009)
Adiga, C., Balakrishnan, R., So, W.: The skew energy of a digraph. Linear Algebra Appl. 432, 1825–1835 (2010)
Akram, M., Habib, A.: q-Rung picture fuzzy graphs: a creative view on regularity with applications. J. Appl. Math. Comput. 61(1), 235–280 (2019)
Akram, M., Naz, S.: Energy of Pythagorean fuzzy graphs with applications. Mathematics 6(8), 136 (2018)
Amanathulla, S., Bera, B., Pal, M.: Balanced PFG with application. Artif. Intell. Rev. 54, 1–27 (2021)
Anjali, N., Mathew, S.: Energy of a fuzzy graph. Ann. Fuzzy Math. Inf 6, 455–465 (2013)
Atanassov, K.T.: Intuitionistic fuzzy sets. Fuzzy Sets Syst. 20(1), 87–96 (1986)
Basha, S.S., Kartheek, E.: Laplacian energy of an intuitionistic fuzzy graph. J. Sci. Technol. 8, 1–7 (2015)
Bolanos, M. E., Aviyente, S.: Quantifying the functional importance of neuronal assemblies in the brain using Laplacian Huckel graph energy. In: Proceedings of International Conference on Acoustics, Speech and Signal Processing, Prague (2011), 753-756
Cai, M., Wang, Y., Gong, Z.: An extension of social network group decision-making based on trust rank and personas. Int. J. Comput. Intell. Syst. 13(1), 332–340 (2020)
Chaira, T., Ray, A.: A new measure using intuitionistic fuzzy set theory and its application to edge detection. Appl. Soft Comput. 8, 919–927 (2008)
Chellamani, P., Ajay, D., Broumi, S., Ligori, T.: An approach to decision-making via picture fuzzy soft graphs. Granul. Comput. 1–22 (2021)
Cuong, B.C.: Picture fuzzy sets. J. Comput. Sci. Cybern. 30, 409–420 (2014)
Cuong, B. C., Kreinovich, V.: Picture fuzzy sets-a new concept for computational intelligence problems. In: Proceeding of the 2013 Third Word Congress on Information and Communication Technologies (WICT), Honoi, Vietnam 15–18 December 2013, pp. 1–6
Daianu, M., Mezher, A., Jahanshad, N., Hibar, D.P., Nir, T.M., Jack, C.R., Weiner, M., Bernstein, M.A., Thompson, P.M.: Spectral graph theory and graph energy metrics show evidence for the Alzheimers disease disconnection syndrome APOE-4 risk gene carriers. In: Proceedings of the IEEE International Symposium on Biomedical Imaging, vol. 2015, pp. 458–481 (2015)
Dehmer, M., Li, X., Shi, Y.: Connections between generalized graph entropies and graph energy. Complexity 21, 35–41 (2015)
Devi, K.: Extension of VIKOR method in intuitionistic fuzzy environment for robot selection. Expert Syst. Appl. 38, 14163–14168 (2011)
Dipaola, L., Mei, G., Di Venere, A., Giuliani, A.: Exploring the stability of dimers through protein structure topology. Curr. Protein Pept. Sci. 17, 30–36 (2016)
Garg, H.: Some picture fuzzy aggregation operators and their applications to multicriteria decision-making. Arab. J. Sci. Eng. 42, 1–16 (2017)
Gutman, I.: The energy of a graph. Ber. Math. Stat. Sekt. Forsch. Graz 103, 1–22 (1978)
Gutman, I., Zhou, B.: Laplacian energy of a graph. Linear Algebra Appl. 414, 29–37 (2006)
Khan, W.A., Ali, B., Taouti, A.: Bipolar picture fuzzy graphs with application. Symmetry 13(8), 1427 (2021)
Li, D.F.: Multiattribute decision making models and methods using intuitionistic fuzzy sets. J. Comput. Syst. Sci. 70, 73–85 (2005)
Liu, P., Ali, Z., Mahmood, T.: Novel complex T-spherical fuzzy 2-tuple linguistic Muirhead mean aggregation operators and their application to multi-attribute decision-making. Int. J. Comput. Intell. Syst. 14(1), 295–331 (2021)
Mahapatra, R., Samanta, S., Pal, M., Xin, Q.: Link prediction in social networks by neutrosophic graph. Int. J. Comput. Intell. Syst. 13(1), 1699–1713 (2020)
Naz, S., Akram, M., Alsulami, S., Ziaa, F.: Decision-making analysis under interval-valued q-Rung orthopair dual hesitant fuzzy environment. Int. J. Comput. Intell. Syst. 14(1), 332–357 (2021)
Naz, S., Akram, M., Smarandache, F.: Certain notions of energy in single-valued neutrosophic graphs. Axioms 7(3), 50 (2018)
Nazeer, I., Rashid, T.: Picture fuzzy incidence graphs with application. Punjab Univ. J. Math. 53(7), 435–458 (2021)
Pena, I., Rada, J.: Energy of digraphs. Linear Multilinear Algebra 56, 565–579 (2008)
Phong, P.H., Hieu, D.T., Ngan, R.T.H., Them, P.T.: Some compositions of picture fuzzy relations. In: Proceedings of the 7th national conference on fundamental and applied information technology research (FAIR’7), Thai Nguyen, 19–20 (2014)
Praba, B., Chandrasekaran, V.M., Deepa, G.: Energy of an intuitionistic fuzzy graph. Ital. J. Pure Appl. Math. 32, 431–444 (2016)
Rao, Y., Kosari, S., Shao, Z., Qiang, X., Akhoundi, M., Zhang, X.: Equitable domination in vague graphs with application in medical sciences. Front. Phys. 37, 1–8 (2021)
Rao, Y., Kosari, S., Shao, Z., Talebi, A.A., Mahdavi, A., Rashmanlou, H.: New concepts of intuitionistic fuzzy trees with applications. Int. J. Comput. Intell. Syst. 14(1), 1–12 (2021)
Rashmanlou, H., Samanta, S., Pal, M., Borzooei, R.A.: Intuitionistic fuzzy graphs with categorical properties. Fuzzy Inf. Eng. 7(3), 317–334 (2015)
Rashmanlou, H., Samanta, S., Pal, M., Borzooei, R.A.: A study on bipolar fuzzy graphs. J. Intell. Fuzzy Syst. 28, 571–580 (2015)
Rosenfeld, A.: Fuzzy Graphs, Fuzzy Sets and their Applications, pp. 77–95. Academic Press, New York (1975)
Sahoo, S., Pal, M., Rashmanlou, H., Borzooei, R.A.: Covering and paired domination in intuitionistic fuzzy graphs. J. Intell. Fuzzy Syst. 33(6), 4007–4015 (2017)
Shannon, A., Atanassov, K.: On a generalization of intuitionistic fuzzy graphs. NIFS 12, 24–29 (2006)
Sharbaf, S., Fayazi, F.: Laplacian energy of a fuzzy graph. Iran. J. Math. Chem 5, 1–10 (2014)
Shi, X., Kosari, S.: Certain properties of domination in product vague graphs with an application in medicine. Front. Phys 9, 1–8 (2021). https://doi.org/10.3389/fphy.2021.680634
Shoaib, M., Mahmood, W., Xin, Q., Tchier, F.: Certain operations on picture fuzzy graph with application. Symmetry 13(12), 2400 (2021)
Son, L.H., Viet, P., Hai, P.: Picture inference system: a new fuzzy inference system on picture fuzzy set. Appl. Intell. 46, 652–669 (2017)
Szmidt, E., Kacprzyk, J.: A similarity measure for intuitionistic fuzzy sets and its application in supporting medical diagnostic reasoning, In: International Conference on Artificial Intelligence and Soft Computing, pp. 388–393. Springer, Berlin, Heidelberg (2004)
Talebi, A.A., Rashmanlou, H., Sadati, S.H.: Interval-valued intuitionistic fuzzy competition graph. J. Mult. Valued Log. Soft Comput. 34, 335–364 (2020)
Talebi, A.A., Dudek, W.A.: Operations on level graphs of bipolar fuzzy graphs. Bulletin Academiel De Stiinte A Republic Moldova Mathematica 2(81), 107–124 (2016)
Talebi, A.A.: Cayley fuzzy graphs on the fuzzy group. Comput. Appl. Math. 37, 4611–4632 (2018)
Xiao, W., Dey, A., Son, L.H.: A study on regular PFG with applications in communication networks. J. Intell. Fuzzy Syst. 39(3), 3633–3645 (2020). https://doi.org/10.3233/JIFS-191913
Zadeh, L.A.: Fuzzy Sets. Inf. Control 8, 338–356 (1965)
Zeng, S., Shoaib, M., Ali, S., Smarandache, F., Rashmanlou, H., Mofidnakhaei, F.: Certain properties of single-valued neutrosophic graph with application in food and agriculture organization. Int. J. Comput. Intell. Syst. 14(1), 1516–1540 (2021)
Zhang, H., Bai, X., Zheng, H., Zhao, H., Zhou, J., Cheng, J., Lu, H.: Hierarchical remote sensing image analysis via graph Laplacian energy. IEEE Geo. Sci. Remote Sens. Lett. 10, 396–400 (2013)
Zuo, C., Pal, A., Dey, A.: New concepts of picture fuzzy graphs with application. Mathematics 7, 405–470 (2019)
Acknowledgements
This work was supported by the National Key R & D Program of China (Grant 2019YFA0706402), and the National Natural Science Foundation of China under Grant 61772376 and 62072129.
Funding
This work was supported by the National Key R & D Program of China (Grant 2019YFA0706402), and the National Natural Science Foundation of China under Grant 62172302, 62072129 and 61876047.
Author information
Authors and Affiliations
Contributions
XS and AT conceived and designed the experiments; SK performed the experiments; H.R and S.H. analyzed the data; HR and SK contributed reagents/materials/analysis tools; XS wrote the paper. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethics approval and consent to participate
All authors have read and agreed for participate in this paper.
Consent for publication
All authors are agree for possible publication of the manuscript.
Competing interests
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Shi, X., Kosari, S., Talebi, A.A. et al. Investigation of the Main Energies of Picture Fuzzy Graph and its Applications. Int J Comput Intell Syst 15, 31 (2022). https://doi.org/10.1007/s44196-022-00086-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s44196-022-00086-5