Planar Graphs under Pythagorean Fuzzy Environment

: Graph theory plays a substantial role in structuring and designing many problems. A number of structural designs with crossings can be found in real world scenarios. To model the vagueness and uncertainty in graphical network problems, many extensions of graph theoretical ideas are introduced. To deal with such uncertain situations, the present paper proposes the concept of Pythagorean fuzzy multigraphs and Pythagorean fuzzy planar graphs with some of their eminent characteristics by investigating Pythagorean fuzzy planarity value with strong, weak and considerable edges. A close association is developed between Pythagorean fuzzy planar and dual graphs. This paper also includes a brief discussion on non-planar Pythagorean fuzzy graphs and explores the concepts of isomorphism, weak isomorphism and co-weak isomorphism for Pythagorean fuzzy planar graphs. Moreover, it presents a problem that shows applicability of the proposed concept.


Introduction
Graph theory is rapidly moving into the core of mathematics due to its applications in various fields, including physics, biochemistry, biology, electrical engineering, astronomy, operations research and computer science.The theory of planar graphs is based on Euler's polyhedral formula, which is related to the polyhedron edges, vertices and faces.In modern era, the applications of planar graphs occur naturally such as designing and structuring complex radio electronic circuits, railway maps, planetary gearbox and chemical molecules.While modeling an urban city, pipelines, railway lines, subway tunnels, electric transmission lines and metro lines are extremely important.Crossing is beneficial as it helps in utilizing less space and is inexpensive, but there are some drawbacks too.As the crossing of such lines is quite dangerous for human lives, but, by taking certain amount of security measures, it can be made.The crossing between the uncrowded route and crowded route is less risky as compared to the crossing between two crowded routes.In fuzzy graphs, the terms' uncrowded route and crowded route referred to as weak edge and strong edge.The allowance of such crossings leads to fuzzy planar graph theory [1][2][3].
In the long-established mathematical models, the information about the complex phenomena is very precise.However, it is an impractical supposition that the exact information is sufficient to model the real world problems that involve inherent haziness.Fuzzy set theory, originally proposed by Zadeh [4], is the most efficient tool having the capability to deal with imprecise and incomplete information.To cope with imprecise and incomplete information, consisting of doubts in human judgement, the fuzzy set shows some restrictions.Hence, for characterizing the hesitancy more explicitly, fuzzy sets were extended to intuitionistic fuzzy sets (IFSs) by Atanassov [5], which assigns a membership grade µ and a nonmembership grade ν to the objects, satisfying the condition µ + ν ≤ 1 and the hesitancy part π = 1 − µ − ν.The IFSs have gained extensive attention and have been broadly applied in different areas of real life.The limitation µ + ν ≤ 1 confines the choice of the membership and nonmembership grades in IFS.To evade this situation, Yager [6][7][8] initiated the idea of Pythagorean fuzzy set (PFS), depicted by a membership grade µ and a nonmembership grade ν with the condition µ 2 + ν 2 ≤ 1. Zhang and Xu [9] introduced the concept of Pythagorean fuzzy number (PFN) for interpreting the dual aspects of an element.The motivation of PFSs can be described as, in a decision-making environment, a specialist gives the preference information about an alternative with the membership grade 0.6 and the non-membership grade 0.5.It is noted that the IFN fails to address this situation, as 0.6 + 0.5 > 1.However, (0.6) 2 + (0.5) 2 ≤ 1.Thus, PFSs comprise more uncertainties than IFSs and are usually capable of accommodating greater degrees of uncertainty.The comparison between intuitionistic fuzzy number space and Pythagorean fuzzy number space is shown in Figure 1.Graphs are the pictorial representation that bond the objects and highlight their information.To emphasis a real-world problem, the bondedness between the objects occurs due to some relations.However, when there exists uncertainty and haziness in the bonding, then the corresponding graph model can be taken as a fuzzy graph model.In 1973, Kaufmann [10] presented the idea of fuzzy graphs, based on Zadeh's fuzzy relation in 1971.Afterwards, Rosenfeld [11] discussed several basic graphs' theoretical concepts in fuzzy graphs.Some remarks on fuzzy graphs were explored by Bhattacharya [12].Mordeson and Peng [13] discussed fuzzy graphs' operations and their properties.The concept of intuitionistic fuzzy relations and intuitionistic fuzzy graphs was initiated by Shannon and Atanassov [14] and some of their eminent properties were explored in [15].Parvathi et al. [16] described operations on intuitionistic fuzzy graphs.Many new concepts involving intuitionistic fuzzy hypergraphs and strong intuitionistic fuzzy graphs were given by Akram et al. [17,18].On the basis of Akram and Davvaz's IFGs [17], Naz et al. [19] gave the idea of PFGs along with applications.Some results related to PFGs have been discussed in [20].Pythagorean fuzzy graph energy was studied by Naz and Akram [21].Dhavudh and Srinivasan [22,23] coped with IFGs2k.Verma et al. and Akram et al. [24] proposed some operations of PFGs.Recently, Akram et al. [25] introduced certain graphs under Pythagorean fuzzy environment.Abdul-Jabbar et al. [26] put forward the idea of a fuzzy dual graph and investigated some of its crucial properties.Yager [27] used the notation of fuzzy bags to define fuzzy multiset.Pal et al. [1] and Samanta et al. [2] developed the notion of fuzzy planar graphs and studied its properties.Pramanik et al. [3] discussed special planar fuzzy graphs.Furthermore, some extensions of planar fuzzy graph were studied [28][29][30].For other terminologies and applications, one can see [31][32][33][34][35][36][37].Under the Pythagorean fuzzy environment, the graph theoretical results have been extended in this paper.The structure and applicability of planar graphs are full of surprises.For example, in the designing of complex radioelectronic circuits, elements can be arranged in such a manner that the conductors connecting each other do not intersect.This problem can be solved by using the concept of planar graphs.This research paper describes the concept of Pythagorean fuzzy multigraphs (PFMGs), Pythagorean fuzzy planar graphs (PFPGs) and Pythagorean fuzzy dual graphs (PFDGs) that allow the mathematical structuring of a road or communication network.By using these graphs, several real world problems can be analyzed and designed.The work explores a significant property known as planarity.Meanwhile, a critical analysis is done on nonplanar PFGs.A close association is developed between Pythagorean fuzzy planar graphs and Pythagorean fuzzy dual graphs.Furthermore, the concept of isomorphism, co-weak isomorphism and weak isomorphism are established between PFPGs.Some substantial results are investigated.In the end, an application of PFPG is discussed.

Pythagorean Fuzzy Multigraph
Definition 1.A Pythagorean fuzzy multiset (PFMS) A taken from nonempty set X is classified by two functions, 'count membership' and 'count non-membership' of A denoted by CM A and CN A and given as CM A : X → Q and CN A : X → Q, where Q is the set of all crisp multisets taken from the unit interval [0, 1], such that, for each r ∈ X , the degree of membership sequence is described as a decreasingly ordered sequence of objects in CM A (r), represented as (µ 1 A (r), µ 2 A (r), . . ., µ p A (r)), where µ 1 A (r) ≥ µ 2 A (r) ≥ . . .≥ µ p A (r) and the corresponding degree of non-membership sequence will be represented as (ν 1 A (r), ν 2 A (r), . . ., 2 ≤ 1 for all r ∈ X and j = 1, 2, . . ., p.A PFMS A is denoted by Multigraphs play a crucial role for any kind of network design where multiedges are involved.Likewise, in Pythagorean fuzzy graph theory, Pythagorean fuzzy multigraphs have vast usage.As Pythagorean fuzzy planar graph can not be defined without Pythagorean fuzzy multigraph, hence, on the basis of Pythagorean fuzzy multiset, we propose the idea of Pythagorean fuzzy multigraph.

Definition 2. Let
Example 1.Consider a multigraph G * = (V , E ), where V = {r 1 , r 2 , r 3 , r 4 } and E = {r 1 r 2 , r 2 r 3 , r 3 r 4 , r 3 r 4 , r 2 r 4 , r 2 r 4 , r 1 r 4 , r 1 r 4 }.Let A and B be PF vertex set and PF multiedge set defined on V and V × V , respectively, 2. The size of G is represented by S (G ) and defined as 3. The degree of vertex r ∈ V is represented by deg G (r) and defined as 4. The total degree of vertex r ∈ V is represented by tdeg G (s) and defined as tdeg G (r) = ( n j=1 µ B (rs The order of G is represented by O(G ) and defined as The size of G is represented by S (G ) and defined as S (G ) = (∑ n j=1 µ B (rs) j , ∑ n j=1 ν B (rs) j ) for all rs ∈ V × V .3. The degree of vertex r ∈ V is represented by deg G (r) and defined as deg G (r) = (∑ n j=1 µ B (rs) j , ∑ n j=1 ν B (rs) j ) for all s ∈ V .4. The total degree of vertex r ∈ V is represented by tdeg G (s) and defined as tdeg In addition, G is not regular as degree of membership and nonmembership values of the vertices are not equal.
1.The degree of an edge rs ∈ V × V is represented by D G (rs) and defined as 2. The total degree of an edge rs ∈ V × V is represented by D G (rs) and defined as tD G ((rs where (rs) j is the jth edge between r and s.In addition, G is not an edge regular Pythagorean multigraph as degree of the membership and nonmembership values are not the same.
Theorem 1.Let G = (A , B) be a Pythagorean fuzzy multigraph.If G is regular and edge regular Pythagorean fuzzy multigraph, then the membership values µ B (rs) j and nonmembership values ν B (rs) j for each edge rs ∈ V × V are constant.
Proof.Let G = (A , B) be a Pythagorean fuzzy multigraph.Assume that G is regular and edge regular Pythagorean fuzzy multigraph, then there exist constants p 1 , p 2 and q 1 , q 2 , respectively, such that, for each vertex, For each edge rs ∈ V × V , Hence, for the membership and nonmembership values, Thus, we conclude that the membership and nonmembership values of a regular Pythagorean fuzzy multigraph with edge regular are constant.
Theorem 2. Let G = (A , B) be a Pythagorean fuzzy multigraph on a crisp graph G * = (V , E ).If G * is p-regular multigraph, µ B (rs) j and ν B (rs) j are constant for each edge rs ∈ V × V , then G is regular and edge regular Pythagorean fuzzy multigraph.
Proof.Assume that G * = (V , E ) is a p -regular multigraph.Let µ B (rs) j = q 1 and ν B (rs) j = q 2 .Then, for each vertex r ∈ V , Hence, G is regular and edge regular Pythagorean fuzzy multigraph.Definition 7. Let B = {(rs, µ B (rs) j , ν B (rs) j ), j = 1, 2, . . ., n | rs ∈ V × V } be a PF multiedge set in PFMG G .A multiedge rs of G is said to be strong if where j is fixed integer.

Pythagorean Fuzzy Planar Graphs
In planar graph, the intersection between edges is not acceptable.However, in this section, we determine a Pythagorean fuzzy planar graph in an interesting manner with a parameter called 'Pythagorean fuzzy Planarity'.Planarity is an amount that measures how much a graph is planar.It is very useful in connecting different networking models, structuring websites containing many pages, designing electronic chip, etc. Sometimes, crossing between edges can not be avoided so for this purpose we only consider minimum number of crossing.Hence, Pythagorean fuzzy planar graphs are important for these kinds of connections.Some correlated terms are discussed below before going to the main definition.
Definition 10.The strength of the Pythagorean fuzzy edge rs is defined as .
An edge rs of PFMG is known as strong if M rs ≥ 0.5 and N rs ≤ 0.5 otherwise, known as weak.
Let A and B be PF vertex set and PF multiedge set defined on V and V × V , respectively.
edge rs of PFMG is known as strong if M rs ≥ 0.5 and N rs ≤ 0.5 otherwise, known as weak.ample 3.1.Consider a multigraph G * = (V , E ) where V = {r 1 , r 2 , r 3 } and E = {r 1 r 2 , r 1 r 2 , r 2 r 3 , r 1 r 3 }.Let A and B be PF vertex set and PF multiedge set defined on V and V ×V , respective 0.8 and The intersecting value at the point (or cut point) C can be obtained as In Pythagorean fuzzy multigraph, S C is inversely proportional to planarity i.e., if the number of points of intersections increases, planarity decreases.

Definition 12.
Let G be a Pythagorean fuzzy multigraph.Let C 1 ,C 2 ,. . .,C k be the crossing points between the edges for geometric insight.Then, G is known as Pythagorean fuzzy planar graph with Pythagorean fuzzy planarity value F , defined as If geometric representation of a PFPG has no intersecting point, then its Pythagorean fuzzy planarity value is considered as (1, 1) with the underlying crisp graph as a crisp planar graph.
Remark 1.Every Pythagorean fuzzy graph is a PFPG with some definite planarity value.
The intersecting value of the first crossing is S C 1 = (1, 0.57) and for the second crossing is S C 2 = (0.83, 0.79).
on V and V × V , respectively.
where F 2 M + F 2 N ≤ 1 and m C is the quantity of crossing between the edges in G .
Proof.Assume that G is a PFMG with an effective intersecting edge that is Let C 1 ,C 2 ,. . .,C k be the crossings between the edges in G where k is an integer.For each crossing edge rs in G , Therefore, the point of intersection C 1 between the edges uv and rs, Hence, S C j = (1, 1) for j = 1, 2, . . ., k.Now, Planarity value of PFMG is Proof.Assume that G is a strong Pythagorean fuzzy planar graph.Suppose, on the contrary, G contains at least two crossings C 1 and C 2 between the strong edges.Then, for any strong edge (rs, µ B (rs), ν B (rs)), As G is strong PFPG, thus M rs ≥ 0.5 and N rs ≤ 0.5.Thus, if two strong edges (rs, µ B (rs), ν B (rs)) and (uv, µ B (uv), ν B (uv)) intersect, then Thus, the crossings between two strong edges can not be two.Likewise, if the number of crossings between strong edges is one, then 1 67.Since G is strong, thus Pythagorean fuzzy planarity value for one point of intersection ranges from 0.5 < F M ≤ 0.67 and 0.86 > F N ≥ 0.67.Hence, any PFPG without crossing is a strong PFPG.Therefore, we deduce that the maximum number of crossings between strong edges is one.
Furthermore, the validity of the above theorem is checked in the example given below.
A fundamental theorem of PFPG is as follows.
Theorem 5.If G has Pythagorean fuzzy planarity value F = (F M , F N ) such that F M > 0.67 and F N < 0.74, then, between the strong edges of PFPG G , there is no crossing.
Proof.Assume that G is a PFPG with PF planarity value F M > 0.67 and F N < 0.74.Suppose, on the contrary, G has crossing C 1 between two strong edges (uv, µ B (uv), ν B (uv)) and (rs, µ B (rs), ν B (rs)).For any strong edge, That means, M rs ≥ 0.5, N rs ≤ 0.5.Likewise, M uv ≥ 0.5, N uv ≤ 0.5.Furthermore, for the minimum value of M rs , M uv and maximum value of N rs , N uv , Therefore, ≥ 0.67-a contradiction; thus, between the strong edges of G , there is no crossing.
To design any type of networking model, the strength of a Pythagorean fuzzy edge plays a vital role.For such networking designs, the edge with minimum strength is not as useful as the edge with maximum strength.Hence, the edge with maximum strength is called the considerable edge.The standard definition is stated below.Definition 14.Let G be a Pythagorean fuzzy graph.An edge rs in G is known as considerable if µ B (rs) j µ A (r)∧µ A (s) ≥ C and ν B (rs) j ν A (r)∨ν A (s) ≤ C, whereas 0 < C < 0.5 is a rational number.If an edge is not considerable, then it is known as a nonconsiderable edge.Furthermore, an edge rs in Pythagorean fuzzy multigraph is considerable if M rs ≥ C and N rs ≤ C, for each edge rs in G .
Remark 2. The rational number 0 < C < 0.5 is a pre-assigned value that may not be unique, as, for a distinct value of C, one can acquire distinct sets of considerable edges, but it is countable.This rational number C is called a considerable number of a Pythagorean fuzzy graph.Theorem 6.If G is a strong PFPG with considerable number C, then, between considerable edges in G , there is at most Let C be considerable number and F = (F M , F N ) be the PF planarity value.Then, for any considerable edge (rs, µ B (rs), ν B (rs)), That is, M rs ≥ C and N rs ≤ C. Let C 1 ,C 2 ,. . .,C n be crossings between considerable edges.Therefore, if two considerable edges (uv, µ B (uv), ν B (uv)) and (rs, µ B (rs), ν B (rs)) intersect, then 1+nC and 0.86 > F N ≥ 1 1+nC .Therefore, 0.5 < 1 1+nC , which implies that n < 1 C .This inequality will be justified for some integral values n, obtained from following expression: C is not an integer.

Kuratowski's Graphs and Pythagorean Fuzzy Planar Graphs
Kuratowski presented 'Kuratowski's Theorem' in 1930, by using the concept of graph homomorphism to characterize planar graphs.According to this theorem, a graph is planar if and only if it does not contain kuratowski graph as a subgraph.A kuratowski graph is basically, a subdivision of either a complete bipartite graph K 3,3 or a complete graph with five vertices K 5 where K 3,3 and K 5 are nonplanar as they cannot be drawn without intersection between edges.However, in this section, we will see that nonplanar Pythagorean fuzzy graphs are Pythagorean fuzzy planar graphs with some definite Pythagorean fuzzy planarity value.Theorem 7. A Pythagorean fuzzy complete graph K 5 or K 3,3 is not a strong Pythagorean fuzzy planar graph.
Proof.Assume that G = (V , A , B) is a Pythagorean fuzzy complete graph with five vertices V = {r, s, t, u, v} and The Pythagorean fuzzy planarity value of Pythagorean fuzzy complete graph is , where m C is the number of crossings between edges in G .
Since the geometric insight of an underlying crisp graph of G is non planar and, for any representation, one crossing can not be excluded.Therefore, F = (F M , F N ) = 1 1+1 , 1 1+1 = (0.5, 0.5).
As F M = 0.5, so G is not a strong Pythagorean fuzzy planar graph.Likewise, K 3,3 has only one crossing that cannot be avoided, so it is not a strong Pythagorean fuzzy planar graph.Remark 3. A Pythagorean fuzzy planar graph with five vertices and each pair of vertices connected by an edge may or may not be a strong Pythagorean fuzzy planar graph.
Example 11.Considering a PFPG as displayed in Figure 8, there is one crossing between two edges (r 1 r 4 , 0.4, 0.34) and (r 5 r 3 , 0.5, 0.4).Then, the Pythagorean fuzzy planarity value (0.54, 0.61).Hence, it is a strong PFPG.Remark 4. A Pythagorean fuzzy bipartite planar graph with six vertices, partitioned into two subsets containing three vertices each, is a strong Pythagorean fuzzy planar graph.
Example 12. Considering a PFPG as displayed in Figure 9, there is one crossing between two edges (r 1 r 5 , 0.55, 0.3) and (r 2 4 6 , 0.6, 0.19).Then, the Pythagorean fuzzy planarity value (0.53, 0.65).Hence, it is a strong PFPG.From Theorem ??, Remark ?? and Remark ??, it is concluded that a complete PFG is not a s Pythagorean fuzzy planar graph whereas a complete PFPG may or may not be a strong Pythag fuzzy planar graph as justified in Example ?? and Example ??.Theorem ??, Remark ?? and Remark ??, it is concluded that a complete PFG is not a st rean fuzzy planar graph whereas a complete PFPG may or may not be a strong Pythago anar graph as justified in Example ?? and Example ??.From Theorem 7, Remarks 3 and 4, it is concluded that a complete PFG is not a strong Pythagorean fuzzy planar graph, whereas a complete PFPG may or may not be a strong Pythagorean fuzzy planar graph as justified in Examples 11 and 12.

Pythagorean Fuzzy Face and Pythagorean Fuzzy Dual Graphs
In Pythagorean fuzzy sense, the face of a PFPG has a significant role.It is a flat surface, enclosed by Pythagorean fuzzy edges.If all the edges in the surrounding of a Pythagorean fuzzy face have degree of membership and nonmembership (1, 0), then it is known as crisp face.The Pythagorean fuzzy face does not exist, if one of such edge is removed with degree of membership and nonmembership (0, 1).Hence, the occurrence of Pythagorean fuzzy face based on the minimum strength of Pythagorean fuzzy edge.
We consider Pythagorean fuzzy planar graph that do not carry any pair of intersecting edge.That is, its planarity value is (1, 1) to define Pythagorean fuzzy face.
Definition 16.A Pythagorean fuzzy face is called strong if its membership value is greater than or equal to 0.5 and nonmembership is less than or equal to 0.5, otherwise weak.Moreover, an infinite region of PFPG is known as outer Pythagorean fuzzy face, while others are known as inner Pythagorean fuzzy face.
Remark 5. Every Pythagorean strong fuzzy face has a membership value greater than or equal to 0.5 and nonmembership less than or equal to 0.5.Thus, a strong Pythagorean fuzzy face has a strong Pythagorean fuzzy edge.
nce, the occurrence of Pythagorean fuzzy face based on the minimum strength of Pythagorean fuz e.
consider Pythagorean fuzzy planar graph that do not carry any pair of intersecting edge.That planarity value is (1, 1) to define Pythagorean fuzzy face.finition 5.1.Let G = (A , B) be a PFPG with planarity (1, 1) and B = {(rs, µ B (rs) j , ν B (rs) j ), j , . . ., n | rs ∈ V × V }.A region enclosed by the Pythagorean fuzzy edge set E ′ ⊂ E of the geomet representation of G is known as Pythagorean fuzzy face of G .The membership and nonmembersh ue of Pythagorean fuzzy face are defined as  In graph theory, duality is very helpful in explaining various structures like drainage system of basins, etc.It has been widely applied in computational geometry, design of integrated circuits and mesh generation.A mathematician Whitney described planarity in terms of occurrence of dual graph i.e., a graph is planar if and only it has a dual graph.This concept is very effective in solving many critical problems.Motivated from this concept, we introduce a Pythagorean fuzzy dual graph of a Pythagorean fuzzy planar graph.Definition 17.Let G = (A , B) be a PFPG where Let F 1 ,F 2 ,. . .,F k be strong Pythagorean fuzzy faces of G .Then, the Pythagorean fuzzy dual graph of G is a PFPG G = (V , A , B ), where V = {r j , j = 1, 2, . . ., k} and the vertex r j of G is taken for F j of G .Furthermore, the membership grades and nonmembership grades of vertices are given by mapping A = (µ A , ν A ) : V → [0, 1] × [0, 1] such that µ A (r j ) = max{µ B (pu) j , j = 1, 2, . . . ,m|pu is an edge in the surrounding of strong PF face F j }, ν A (r j ) = min{ν B (pu) j , j = 1, 2, . . . ,m|pu is an edge in the surrounding of strong PF face F j }.
Meanwhile, between two faces F i and F j of G , there may occur more than one common edge.Thus, between two vertices, there may exist more than one edge r i and r j in PFDG G .The membership and nonmembership values of Pythagorean fuzzy edges of PFDG are µ B (r i r j ) s = µ s B (pu) i , ν B (r i r j ) s = ν s B (pu) i where (pu) s is an edge in the surrounding between strong PF faces F i and F j and s = 1, 2, . . ., l, is the number of common edges in the surrounding of F i and F j .
The Pythagorean fuzzy dual graph G of PFPG G has no crossing between edges for some definite geometric representation; thus, it is PFPG of PF planarity (1, 1).
Example 14.Consider a PFPG G = (V , A , B) as displayed in Figure 11 such that V = {s 1 , s 2 , s 3 , s 4 , s 5 }.Let A and B be a PF vertex set and PF edge set defined on V and V × V , respectively.The Pythagorean fuzzy faces of a Pythagorean fuzzy planar graph are given below: By direct calculation, one can see that these five faces are strong Pythagorean fuzzy faces.We represent the vertices of Pythagorean fuzzy dual graph (PFDG) by small white circles and the edges by dashed lines.For each strong Pythagorean fuzzy face (SPFF), we take a vertex for the PFDG.Therefore, the vertex set V = {r 1 , r 2 , r 3 , r 4 , r 5 }, where the vertex r j is extracted parallel to the SPFF F j , j = 1, 2, .., 5. Hence, There is one common edge bd between the faces F 1 and F 2 in G .Hence, there exists one edge between the vertices r 1 and r 2 in PFDG of G .The membership grade and nonmembership grade of the edges of PFDG are obtained as Thus, the Pythagorean fuzzy dual graph edge set is In the Pythagorean fuzzy dual graph, we will not consider weak edges.The following theorems are given below.Theorem 8. Let G be a Pythagorean fuzzy planar graph without weak edges, r strong faces, q Pythagorean fuzzy edges and p vertices.Let G be a Pythagorean fuzzy dual graph of G with r faces, q Pythagorean fuzzy edges and p vertices, then p = r, q = q and r = p.
Proof.The proof is easily perceived by the definition of the Pythagorean fuzzy dual graph.Theorem 9. Let G be a Pythagorean fuzzy dual graph of PFPG G .The number of strong PF faces in G is less than or equal to the number of vertices of G .
Proof.Assume that G is a PFDG of PFPG G with r strong PF faces and G has p vertices.Since G has both weak and strong PF edges, and, to develop PFDG, weak PF edges are eliminated.Hence, if G has some weak PF edges, then some vertices may have all its adjoining PF edges as weak PF edges.
Suppose that such vertices are in number l.These vertices are not enclosed by any strong PF faces.By eliminating these vertices and adjoining edges, the number of vertices become p − l.Moreover, from Theorem 8, r = p − l.Hence, r ≤ p.This concludes that the number of strong PF faces in G is less than or equal to the number of vertices of G .
Example 15.The above statement is justified from Example 14, as one can see that the number of strong PF faces in G is 4, which is less than 5 (number of vertices of G ).
Theorem 10.If G be a Pythagorean fuzzy dual graph of a PFPG G without weak edges.Then, the membership grade and nonmembership grade of Pythagorean fuzzy edge of G are equivalent to the membership grade and nonmembership grade of Pythagorean fuzzy edge of G .
Proof.Let G be a PFPG without weak edges.The PFDG of G is G in which there is no crossing between any edges.Let F 1 ,F 2 ,. . .,F m be SPFF of G .By the definition of PF dual graph, the membership grade and nonmembership grade of Pythagorean fuzzy edges of Pythagorean fuzzy dual graph are , where (pu) s is an edge in the surrounding between strong PF faces F i and F j .The common edges in the surrounding between F i and F j are s in number, where s = 1, 2, . . ., l.The number of PF edges of two PFGs G and G are similar as G has no weak edges.Hence, for every Pythagorean fuzzy edge of G , there is a Pythagorean fuzzy edge in G with similar membership grade and nonmembership grade.

Isomorphism between Pythagorean Fuzzy Planar Graphs
Isomorphism is a formal mapping that propagates knowledge and better understanding between different graphs.It can be defined between complex models where the two models have equal division.If there is isomorphism between two models such that the property of one is known and the other is unknown.Then, due to isomorphism, we are able to know the property of an unknown model.By using this concept, we define isomorphism between two Pythagorean fuzzy planar graphs.

Definition 18. An isomorphism F
Example 16.Consider two Pythagorean fuzzy planar graph G 1 = (A 1 , B 1 ) and G 2 = (A 2 , B 2 ) as shown in Figure 12 such that

Since a mapping F
Example 17.Consider two Pythagorean fuzzy planar graph G 1 = (A 1 , B 1 ) and G 2 = (A 2 , B 2 ) as shown in Figure 13 such that

Since a mapping F
for all rs ∈ E 1 .
Example 18.Consider two Pythagorean fuzzy planar graph G 1 = (A 1 , B 1 ) and G 2 = (A 2 , B 2 ) as shown in Figure 14 such that some correlated results have been discussed below.Since a mapping F : V 1 → V 2 defined by F(r ) = s 1 , F(r 2 ) = s 2 , F(r 3 = s 3 , F(r 4 ) = s 4 ,F(r 5 ) = s 5 , F(r 6 ) = s 6 satisfies µ B 1 (r i r j ) = µ B 2 (F(r i )F(r j )), ν B 1 (r i r j ) = ν B 2 (F(r i )F(r j )), for all r i r j ∈ E 1 , where i, j = 1, 2, 3, Proof.Suppose F : G → L is an isomorphism.As an isomorphism retains the membership and nonmembership value of vertex and edge of Pythagorean fuzzy graphs.Thus, membership and nonmembership value of L will be equivalent to the membership and nonmembership value of G .Drawing and structure of L and G are similar.Hence, the crossings number between edges and Pythagorean fuzzy planarity value of L will be similar to G .Thus, L can be considered as PFPG G with equivalent Pythagorean fuzzy planarity value as that of the Pythagorean fuzzy graph L .Theorem 12. Two isomorphism Pythagorean fuzzy graphs G 1 and G 2 have equivalent planarity value.
Theorem 13.Let G 1 and G 2 be two Pythagorean fuzzy graphs with Pythagorean fuzzy planarity Proof.Let G 1 is weak isomorphic to G 2 .Then, for any edge xy ∈ E 1 , there exists F(x)F(y) ∈ E 2 .The strength of an edge S rs = (M rs , N rs ) is given as The intersecting value S C 1 = (M C 1 , N C 1 ) between two edges uv and rs is where C 1F is the intersection point between two edges F(u)F(v) and F(r)F(s) in G 2 .Since G 1 is weak isomorphic to G 2 , the number of the intersecting points in the certain geometric representation in G 1 and G 2 are equal which are n.Hence, Thus, we conclude that, if Theorem 14.Let G 1 and G 2 be two Pythagorean fuzzy graphs with Pythagorean fuzzy planarity Proof.Assume that G 1 is co-weak isomorphic to G 2 satisfying the conditions for all r, s ∈ V 1 and F(r), F(s) ∈ V 2 .Then, the strength of an edge S rs = (M rs , N rs ) is given as The intersecting value S C 1 = (M C 1 , N C 1 ) between two edges uv and rs is where C 1F is the intersection point between two edges F(u)F(v) and F(r)F(s) in G 2 .Since G 1 is co-weak isomorphic to G 2 , the number of the intersecting points in the certain geometric representation in G 1 and G 2 are equal, which are n.Hence, Thus, we conclude that, if Theorem 15.Let G 1 and G 2 be two weak isomorphic PFGs with PF planarity values and F 2 = (F M 2 , F N 2 ), respectively.If the edge membership and nonmembership grades of the parallel crossing edges are equivalent, then Proof.Let G 1 and G 2 be two weak isomorphic PFGs with PF planarity values F 1 and F 2 , respectively.Since two PFGs are weak isomorphic, µ A 1 (a) = µ A 2 (u), ν A 1 (a) = ν A 2 (u), for all a ∈ G 1 and u ∈ G 2 .Let the Pythagorean fuzzy graphs have one crossing.Let two crossing edges in G 1 and G 2 are bc, de and vw, rs, respectively.Then, the cut point in G 1 is defined by Likewise, the cut point in G 2 is defined by The number of intersecting points increases.However, if the sum of crossing values of G 1 are equivalent to that of G 2 , then Pythagorean fuzzy planarity values must be equal.Hence, for F 1 = F 2 , the edge membership and nonmembership grades of crossing edges of G 1 are equivalent to the edge membership and nonmembership grades of the parallel crossing edges in G 2 .
Theorem 16.Let G 1 and G 2 be two co-weak isomorphic PFGs with PF planarity values F 1 = (F M 1 , F N 1 ) and F 2 = (F M 2 , F N 2 ), respectively.If the minimum membership and maximum nonmembership grade of end vertices of the parallel crossing edges are equivalent, then Proof.Let G 1 and G 2 be two co-weak isomorphic PFGs with PF planarity values F 1 and F 2 , respectively.Since two PFGs are co-weak isomorphic, so µ B 1 (ab) = µ B 2 (uv), ν B 1 (ab) = ν B 2 (uv), for all ab ∈ G 1 and uv ∈ G 2 .Let the Pythagorean fuzzy graphs have one crossing.Let two crossing edges in G 1 and G 2 are cd, ef and wx, yz, respectively.Then, the cut point in G 1 is defined by Likewise, the cut point in G 2 is defined by . The number of intersecting points increase.However, if the sum of crossing value of G 1 is equivalent to that of G 2 , then Pythagorean fuzzy planarity values must be equal.Hence, for F 1 = F 2 , the minimum membership and maximum nonmembership grades of end vertices of an edge in G 1 is equivalent to the minimum membership and maximum nonmembership grades of parallel edge in G 2 .
In a crisp sense, we know that double dual of planar graph is also planar.We call it self-duality of planar graph.However, this concept does not hold in a Pythagorean fuzzy planar graph as the vertex membership and nonmembership grade of Pythagorean fuzzy planar graph are not preserved in its dual graph.However, the edge membership and nonmembership grade of Pythagorean fuzzy planar graph are preserved.The following theorem illustrates this fact.
Theorem 17.If G 2 is the PFDG of PFDG G 1 of a PFPG G without weak edges, then a co-weak isomorphism occurs between G and G 2 .
Proof.Suppose that G is a PFPG without weak edges.Suppose that G 1 is a PFDG of G and G 2 is the PFDG of G 1 .For establishing co-weak isomorphism between G and G 2 .We know that the number of vertices of G 2 is equivalent to the strong Pythagorean fuzzy faces of G 1 .Similarly, the number of strong Pythagorean fuzzy faces of G 1 is equivalent to the number of vertices of G .Hence, the number of vertices of G 2 and G are similar.Furthermore, by definition of PFDG, the membership and nonmembership grade of an edge in PFDG is equivalent to the membership and nonmembership grade of an edge in PFPG.Thus, it is concluded that a co-weak isomorphism occurs between G and G 2 .
The following example justifies the above theorem.
Example 19.Consider a PFPG G = (A , B) without weak edges, as displayed in Figure 15  Again, constructing the dual of G 1 as displayed in Figure 17, where

Application
From the power plants to our houses, the potent power lines that are zigzagging our countryside or city streets carry numerously high voltage electricity.For reducing such high voltage electricity to lower voltage, an equipment is used, called a transformer.A transformer works in a very simple way, consisting of different units in which electric current flows through tiny wires.While connecting the units with each other, crossing between tiny wires may occur.Sometimes, crossing between wires is beneficial as it helps in utilizing less space and makes it inexpensive, but, on the other hand, due to crossing, the transformer heats up and there is a chance of an explosion that is quite dangerous for human life.To overcome this problem, a crossing between such wires needs to be minimized or good quality wires are needed for installation.The practical approach of Pythagorean fuzzy planar graphs can be utilized to structure this kind of situation for reducing the rate of destruction.Consider an electric transformer in which units are connected as shown in Figure 18.Each unit U 1 , U 2 , . . ., U 7 is represented by a vertex and each electric connection between units through tiny wire is represented by an edge.The membership grade of the vertex depicted the chances of electric spark, whereas the nonmembership grade interpreted the chances of no electric spark in the unit.The membership grade of the edge depicted the intensity of electrical hazard between two units, whereas the nonmembership grade interpreted no intensity of electrical hazard.

Application
From the power plants to our houses, the potent power lines that are zigzagging our countryside or city streets carry numerously high voltage electricity.For reducing such high voltage electricity to lower voltage, an equipment is used, called transformer.A transformer works in a very simple way, consisting of different units in which electric current flows through tiny wires.While connecting the units with each other, crossing between tiny wires may occur.Sometime crossing between wires is beneficial as it helps in utilizing less space and make it inexpensive but on the other hand, due to crossing, transformer gets heat up and there is a chance of explosion which is quite dangerous for human lives.To overcome this problem, crossing between such wires need to be minimized or good quality wires are needed for installation.The practical approach of Pythagorean fuzzy planar graphs can be utilized to structure this kind of situation for reducing the rate of destruction.Consider an electric transformer in which units are connected as shown in Figure ??.Each unit U 1 , U 2 , . . ., U 7 is represented by a vertex and each electric connection between units through tiny wire is represented by an edge.The membership grade of the vertex depicted the chances of electric spark whereas the nonmembership grade interpreted the chances of no electric spark in the unit.The membership grade of the edge depicted the intensity of electrical hazard between two units whereas the nonmembership grade interpreted no intensity of electrical hazard.As the number of crossings increase, the rate of destruction increases.Hence the measurement of the planarity value is necessary.There are six crossings C 1 , C 2 , C 3 , C 4 , C 5 and C 6 between the pair of wires (U 4 U 6 , U 2 U 5 ), (U 3 U 6 , U 2 U 5 ), (U 2 U 5 , U 1 U 3 ), (U 2 U 6 , U 1 U 3 ), (U 2 U 7 , U 1 U 3 ) and (U 2 U 7 , U 1 U 6 ), respectively.The strength of the wire U 4 U 6 = (0.9, 0.95), U 2 U 5 = (0.5, 0.85), U 3 U 6 = (0.67, 0.78), U 1 U 3 = (0.9, 0.94), U 2 U 6 = (1, 0.91), U 2 U 7 = (1, 0.93) and U 1 U 6 = (0.93, 1).For crossings, the point of intersections are S C 1 = (0.7, 0.9), S C 2 = (0.59, 0.82), S C 3 = (0.7, 0.9), S C 4 = (0.95, 0.93), S C 5 = (0.95, 0.94) and S C 6 = (0.97, 0.97).Thus, Pythagorean fuzzy planarity value F = (0.17, 0.15).Since the planarity value is minimum so it indicates the possibility of high destruction.To reduce crossing, we can change the graphical representation as shown in Figure ??.As the number of crossings increase, the rate of destruction increases.Hence, the measurement of the planarity value is necessary.There are six crossings C 1 , C 2 , C 3 , C 4 , C 5 and C 6 between the pair of wires (U 4 U 6 , U 2 U 5 ), (U 3 U 6 , U 2 U 5 ), (U 2 U 5 , U 1 U 3 ), (U 2 U 6 , U 1 U 3 ), (U 2 U 7 , U 1 U 3 ) and (U 2 U 7 , U 1 U 6 ), respectively.The strength of the wire U 4 U 6 = (0.9, 0.95), U 2 U 5 = (0.5, 0.85), U 3 U 6 = (0.67, 0.78), U 1 U 3 = (0.9, 0.94), U 2 U 6 = (1, 0.91), U 2 U 7 = (1, 0.93) and U 1 U 6 = (0.93, 1).For crossings, the point of intersections are S C 1 = (0.7, 0.9), S C 2 = (0.59, 0.82), S C 3 = (0.7, 0.9), S C 4 = (0.95, 0.93), S C 5 = (0.95, 0.94) and S C 6 = (0.97, 0.97).Thus, Pythagorean fuzzy planarity value F = (0.17, 0.15).Since the planarity value is at a minimum, it indicates the possibility of high destruction.To reduce crossing, we can change the graphical representation as shown in Figure 19.
We know that the number of intersecting points is inversely proportional to planarity.Since the number of intersecting points decrease, the Pythagorean fuzzy planarity value F = (0.63, 0.55) increases and rate of destruction decreases.Moreover, from the representation shown in Figure 19, it is noted that C 1 is the only crossing left that can not be reduced, but the chance of electric hazard and rate of destruction through it can be minimized by using good quality electrical wires between U 3 and U 6 , U 2 and U 5 .Thus, this crossing will become less harmful.Hence, we conclude that the Pythagorean fuzzy electric connection model can be used for tracking and detecting the rate of destruction.By examining and taking extra special security measures, the percentage of destruction can be reduced and many human lives can be saved.graphs, have better ability due to the increment of spaces in membership and nonmembership grades, for modeling the obscurity in practical world problems.This paper has utilized the idea of Pythagorean fuzzy graphs and initiated the concept of Pythagorean fuzzy multigraphs and Pythagorean fuzzy planar graphs.It has investigated the Pythagorean fuzzy planarity value by considering strong, weak and considerable edges.Moreover, a critical analysis has been done on a nonplanar Pythagorean fuzzy graph.A close association has been developed between Pythagorean fuzzy planar graphs and Pythagorean fuzzy dual graphs.Furthermore, the concept of isomorphism, weak isomorphism and co-weak isomorphism have been elaborated between Pythagorean fuzzy planar graphs and some substantial results have been investigated.In the end, it has explored an important result that there exists a co-weak isomorphism between the Pythagorean fuzzy planar graph and dual of a dual Pythagorean fuzzy planar graph.The purpose of this research work is the applicability of Pythagorean fuzzy planar graphs in the field of neural networks and geographical information systems.With the help of these graphs, many problems related to crossing including designing golf holes in a golf club, linking different houses with each other and structuring road or communication networks can be easily solved.Further studies can focus on (1) Interval-valued Pythagorean fuzzy graphs; (2) Hesitant Pythagorean fuzzy graphs and; (3) Simplified interval-valued Pythagorean fuzzy graphs.

Figure 1 .
Figure 1.Comparison of spaces of the IFN and the PFN.

Figure 3 . 2 : 9 Figure 5 .Theorem 3 .
Figure 3.2: Pythagorean fuzzy planar graph and m C is the quantity of crossings between the edges in G .Definition 13.A Pythagorean fuzzy planar graph G is said to be strong if Pythagorean fuzzy planarity value F = (F M , F N ) of the graph G is such that F M > 0.5 and F N < 0.86.Example 9.In Example 8, the PFPG G has PF planarity value F = (F M , F N ) = (0.35, 0.42).Hence, G is not strong.Theorem 4. If G is a strong Pythagorean fuzzy planar graph, then there is at most one crossing between strong edges.
Figure 3.3: PFPG with one crossing

Definition 15 .
Let G = (A , B) be a PFPG with planarity (1, 1) and B = {(rs, µ B (rs) j , ν B (rs) j ), j = 1, 2, . . ., n | rs ∈ V × V }.A region enclosed by the Pythagorean fuzzy edge set E ⊂ E of the geometrical representation of G is known as Pythagorean fuzzy face of G .The membership and nonmembership value of Pythagorean fuzzy face are defined as
have been discussed below.Theorem 11.If F : G → L is an isomorphism from PFPG G to Pythagorean fuzzy graph L .Then, L can be considered as PFPG with equivalent PF planarity value of G .
By direct calculation, one can look from Figure2that it is a PFMG.r 2 , r 2 r 3 , r 3 r 4 , r 3 r 4 , r 2 r 4 , r 2 r 4 , r 1 r 4 , r 1 r 4 }.Let A and B be PF vertex set and PF multiedge s ned on V and V × V , respectively.
2, . . ., n | rs ∈ E ′ .finition 5.2.A Pythagorean fuzzy face is called strong if its membership value is greater than al to 0.5 and nonmembership is less than or equal to 0.5, otherwise weak.Moreover, an infini ion of PFPG is known as outer Pythagorean fuzzy face.While, other are known as inner Pythagorea zy face.
mark 5.1.Every Pythagorean strong fuzzy face have membership value greater than or equal and nonmembership less than or equal to 0.5.So, a strong Pythagorean fuzzy face has a stron thagorean fuzzy edge.ample 5.1.Consider a PFPG G as displayed in Figure ??.Let F 1 , F 2 , F 3 and F 4 be t thagorean fuzzy faces.