Int. J. Appl. Comput.

Math (2020) 6:57

https://doi.org/10.1007/s40819-020-00816-3

ORIGINAL PAPER

Analysis of Road Map Design Based on Multigraph with

Picture Fuzzy Information

Sankar Das1,2 · Ganesh Ghorai1

© Springer Nature India Private Limited 2020

Abstract
In this paper, the picture fuzzy planar graph is defined along with some basic properties of
picture fuzzy graph. The notion of picture fuzzy planar graphs is introduced and the terms
such as strong (weak) edges, strong (weak) picture fuzzy planar graphs, strength of an edge,
degree of planarity, picture fuzzy faces, strong (weak) picture fuzzy faces, picture fuzzy dual
graphs and picture fuzzy combinatorial dual graphs are defined. Some theorems on degree of
planarity and picture fuzzy combinatorial dual graphs have been established. An application
of picture fuzzy planar graph in the design of road maps is given.

Keywords Picture fuzzy graphs · Picture fuzzy planar graphs · Strong (weak) picture fuzzy
planar graphs · Picture fuzzy dual graphs · Picture fuzzy combinatorial dual graph

Introduction

Till now graph theory hurriedly movable in the core of mathematics due to its vast application
in different areas. To exhibit an undeveloped city, planarity is very important for connecting
various type of lines such as water, gas, wire, railway, highway, metro and subway tunnels,
etc. To design such lines little crossing between them may be accepted. In high speed high-
ways/railroads design crossings are always problematic, but if there is a tunnel and one road
goes through this tunnel, it is full safety for human lives. In the planning of road maps the
crossing between congested (strong) road and non-congested (weak) road may be accepted
with certain amount of protection as this crossing is low risky as comparison to the crossing
between two congested (strong) roads. The notion of fuzzy set (FS) was first introduced by
Zadeh [19] to handle uncertainty in real life circumstance. After that the notion of intuition-
istic fuzzy set (IFS) was introduced by Atanassov [2] in addition to a new component known

B Ganesh Ghorai
math.ganesh@mail.vidyasagar.ac.in
Sankar Das
sankarkgp22@gmail.com
1 Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar
University, Midnapore 721 102, India
2 Department of Mathematics, Kharagpur College, Kharagpur 721 305, India

0123456789().: V,-vol 123

 57 Page 2 of 17 Int. J. Appl. Comput. Math (2020) 6:57

as degree of non-membership. But one of the vital concept of neutrality degree (that can arise
in the circumstances when human opinions involving more answer of the types: yes, abstain,
no, refusal) is lacking in IFS. Voting can be a good paradigm for that, when voters may be
divided into four categories of those who: vote for, abstain, vote against, refusal of voting. To
evade this circumstance Cuong [4,5] introduced picture fuzzy set (PFS) including the degree
of neutral membership. To describe similarity between objects, fuzzy relations are one of
the best tool in FS theory. The crisp relations and its extensions such as fuzzy relations and
intuitionistic fuzzy relations defined by many researchers can model vagueness, uncertainty
etc. After that in 2014, the notion of picture fuzzy relation (PFR) with some operations was
proposed by Cuong [4]. The PFRs are PFSs in a cartesian product of universes. Fuzzy graph
(FG) theory was introduced by Rosenfeld [13]. Samanta et al. [14–16] defined fuzzy pla-
nar graph (FPG) in a different way where crossing between edges are allowed. Ghorai and
Pal [6] introduced the notion of m-polar FPG. Some more interesting results on fuzzy graph
can be found on [3,7,9–12,18]. Al-Hawary et al. [1] defined picture fuzzy graph (PFG) and
discussed some operations on it. Shriram et al. [17] defined fuzzy combinatorial dual graph.
In this paper, we define picture fuzzy planar graphs (PFPG), picture fuzzy (PF)-faces,
picture fuzzy dual graphs (PFDG), picture fuzzy combinatorial dual graphs (PFCDG) which
is one of the classification of PFDGs and introduce the terms PF-multigraph (MG), strong
(weak) PFPGs, strength of an edge, intersecting value between the edges. Here we use degree
of planarity (DP) to determine nature of planarity (NP) of a PFPG and proved some theorems
on DP. Also an application of PFPG is given in the design of road maps.

Preliminaries

Throughout this paper, the following mathematical symbols are used:

ξ : fuzzy graph
σ : degree of membership of the vertices
μ: degree of membership of the edges
X : universal set
A: picture fuzzy set
B: picture fuzzy relation
G: picture fuzzy graph
G 1 : picture fuzzy dual graph
G 1 : picture fuzzy combinatorial dual graph
V : set of vertices of G
n ab : number of edges between a and b
Iab : strength of picture fuzzy edge ab

I P : intersecting value at a point P
f : degree of planarity
n p : number of intersecting points between the edges of G
c: considerable number
C: cycle of G
Ç: cut set of G 1
Fi : picture fuzzy faces
μ A (a), ν A (a), η A (a): DTMS, DAMS, DFMS of the vertex a in G, respectively
μ B (ab), ν B (ab), η B (ab): DTMS, DAMS, DFMS of an edge ab in G, respectively
μiB (ab), ν iB (ab), ηiB (ab): DTMS, DAMS, DFMS of the ith edge between a and b in G

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 3 of 17 57

Fig. 1 Example of a PFG

Here we will recall some related terminologies and results.

Definition 1 [13] A FG ξ = (V , σ, μ) is a non-empty set V together with a pair of functions
σ : V → [0, 1] and μ : V × V → [0, 1] with the condition μ(a, b) ≤ min{σ (a), σ (b)}
∀ a, b ∈ V , where σ (a) and μ(a, b) denote the degree of membership of a ∈ V and
edge (a, b) ∈ ξ , respectively. μ(a, b)  = 0 implies that (a, b) is non-trivial edge. Also, if
μ(a, a)  = 0, then there is a loop at the vertex a.
In FG an edge (a, b) with the condition μ(a, b) = min{σ (a), σ (b)} is known as effective
edge [8] and the graph is complete if its all edges are effective.
Definition 2 [4] Let X be the universe. Then a PFS A is defined on X as A =
{(a, (μ A (a), η A (a), ν A (a))) : a ∈ X }, where μ A (a), η A (a), ν A (a) ∈ [0, 1] denote the
degree of truth membership (DTMS), degree of abstinence membership (DAMS) and degree
of false membership (DFMS) of a in A, respectively with 0 ≤ μ A (a) + η A (a) + ν A (a) ≤ 1,
∀ a ∈ X . Also ∀ a ∈ X , D A (a) = 1 − (μ A (a) + η A (a) + ν A (a)) represent denial degree of
a in A. Here, μ A (a), η A (a) and ν A (a) all are independent.
Definition 3 [4] A picture fuzzy relation (PFR) R is a PF-subset of X × Y is given by
R = {(ab, (μ R (ab), η R (ab), ν R (ab)))|a ∈ X , b ∈ Y }, where μ R , η R , ν R : X × Y → [0, 1]
denote DTMS, DAMS and DFMS of the edge ab in R, respectively with 0 ≤ μ R (ab) +
η R (ab) + ν R (ab) ≤ 1 for every ab ∈ X × Y .

Definition 4 [1] A PFG of a graph G ∗ = (V , E) is a triplet G = (V , A, B), where A =

(μ A , η A , ν A ) is a PFS on V and B = (μ B , η B , ν B ) is a PFR on E ⊆ V × V such that for
each ab ∈ E,
μ B (ab) ≤ min{μ A (a), μ A (b)},
η B (ab) ≤ min{η A (a), η A (b)},
ν B (ab) ≤ max{ν A (a), ν A (b)},
where μ A (a), η A (a), ν A (a) ∈ [0, 1] represent the DTMS, DAMS and DFMS of the
vertex a in G, respectively with 0 ≤ μ A (a) + η A (a) + ν A (a) ≤ 1 ∀ a ∈ V and
μ B (ab), η B (ab), ν B (ab) ∈ [0, 1] represent the DTMS, DAMS and DFMS of the edge ab in
G, respectively with 0 ≤ μ B (ab) + η B (ab) + ν B (ab) ≤ 1 ∀ ab ∈ E.
Example 5 We consider the PFG G = (V , A, B) as shown in Fig. 1 where V = {a, b, c, d}.
Here A = {(a, (0.2, 0.3, 0.1)), (b, (0.3, 0.2, 0.2)), (c, (0.1, 0.2, 0.5)), (d, (0.4, 0.1, 0.3))}
is a PFS on V and B = {(ab, (0.2, 0.1, 0.2)), (ad, (0.2, 0.1, 0.3)), (bc, (0.1, 0.2, 0.5)),
(bd, (0.3, 0.1, 0.3)), (cd, (0.1, 0.1, 0.5))} is a PFR on V ×V . The DTMS, DAMS and DFMS
of the vertex a in G are respectively 0.2, 0.3 and 0.1. Similarly for other vertices and edges.

123
 57 Page 4 of 17 Int. J. Appl. Comput. Math (2020) 6:57

Table 1 PFS A A a b c d

μA 0.5 0.45 0.3 0.3

ηA 0.3 0.25 0.4 0.2
νA 0.2 0.1 0.25 0.4

Table 2 PFMS B B ab bc bd bd cd

μB 0.35 0.3 0.3 0.2 0.3

ηB 0.2 0.1 0.1 0.2 0.2
νB 0.1 0.25 0.3 0.4 0.25

Picture Fuzzy Multigraph (PFMG)

A planar graph may contain multi edges. So to define PFPG, we need to study on PFMG
using the notion of PFMS. We define PFMS and PFMG in this section.

Definition 6 A picture fuzzy multiset (PFMS) M drawn from a non-empty set V is given by
M = {(a, (μiM (a), ηiM (a), ν Mi (a))) : i = 1, 2, .., n|a ∈ V }, where n = max{i : μi (a)  = 0
M
or ηiM (a)  = 0 or ν M
i (a)  = 0} and μi (a), ηi (a), ν i (a) ∈ [0, 1] represent the DTMS,
M M M
DAMS and DFMS of a ∈ V , respectively with 0 ≤ μiM (a) + ηiM (a) + ν M i (a) ≤ 1 ∀ a ∈ V .

Definition 7 Let A = (μ A , η A , ν A ) be a PFS on a non-empty set V . Also let B =

{(ab, (μiB (ab), ηiB (ab), ν iB (ab))) : i = 1, 2, . . . , n ab |ab ∈ V × V } be a PFMS on V × V
such that
μiB (ab) ≤ min{μ A (a), μ A (b)},
ηiB (ab) ≤ min{η A (a), η A (b)},
ν iB (ab) ≤ max{ν A (a), ν A (b)} for all i = 1, 2, . . . , n ab , where n ab = max{i : μiB (ab)  = 0
or ηiB (ab)  = 0 or ν iB (ab)  = 0} is the number of edges between a and b. Then G = (V , A, B)
is called PFMG where μ A (a), η A (a), ν A (a) and μiB (ab), ηiB (ab), ν iB (ab) represent the
DTMS, DAMS and DFMS of vertex a and the ith edge between a and b in G, respectively.

Definition 8 Let G = (V , A, B) be PFMG, where B = {(ab, (μiB (ab), ηiB (ab), ν iB (ab))) :
i = 1, 2, . . . , n ab |ab ∈ V × V } and n ab = max{i : μiB (ab)  = 0 or ηiB (ab)  = 0 or ν iB (ab)  =
 n ab i n ab i n ab i
 degree of vertex a ∈ V is given by d(a) =
0}. The i=1 μ B (ab), i=1 η B (ab), i=1 ν B
(ab) ∀ b ∈ V .

Example 9 Consider a MG G ∗ = (V , E), where V = {a, b, c, d} and E = {ab, bc, bd,

bd, cd}. Let A = (μ A , η A , ν A ) be a PFS on V and B = (μ B , η B , ν B ) be a PFMS on
V × V given in Tables 1 and 2. After computations, it is seen that Fig. 2 is a PFMG and
respective degree of its vertices are d(a) = (0.35, 0.2, 0.1), d(b) = (1.15, 0.6, 1.05), d(c) =
(0.6, 0.3, 0.5) and d(d) = (0.8, 0.5, 0.95).

Definition 10 Let G = (V , A, B) be PFMG, where B = {(ab, μiB (ab), ηiB (ab), ν iB (ab)) :
i = 1, 2, . . . , n ab |ab ∈ V × V } and n ab = max{i : μiB (ab)  = 0 or ηiB (ab)  = 0 or
ν iB (ab)  = 0}. A multiedge ab is strong in G if

123
 Int. J. Appl. Comput. Math (2020) 6:57 Page 5 of 17 57

Fig. 2 Example of PFMG

2 min{μ A (a), μ A (b)} ≤ μ B (ab),

1 i

2 min{η A (a), η A (b)} ≤ η B (ab),

1 i

2 max{ν A (a), ν A (b)} ≤ ν B (ab) for all i = 1, 2, . . . , n ab .

1 i

Example 11 The edges ab and cd in the graph in Example 9 are strong as 21 min{0.5, 0.45} ≤
0.35, 21 min{0.3, 0.25} ≤ 0.2, 21 max{0.2, 0.1} = 0.1 and 21 min{0.3, 0.3} ≤ 0.3,
2 min{0.4, 0.2} ≤ 0.2, 2 max{0.25, 0.4} ≤ 0.25.
1 1

Definition 12 Let G = (V , A, B) be PFMG, where B = {(ab, (μiB (ab), ηiB (ab), ν iB (ab))) :
i = 1, 2, . . . , n ab |ab ∈ V × V } and n ab = max{i : μiB (ab)  = 0 or ηiB (ab)  = 0 or
ν iB (ab)  = 0}. Then G is complete if
μiB (ab) = min{μ A (a), μ A (b)},
ηiB (ab) = min{η A (a), η A (b)},
ν iB (ab) = max{ν A (a), ν A (b)} ∀i = 1, 2, . . . , n ab and ∀a, b ∈ V .

Example 13 Consider a MG G ∗ = (V , E), where V = {a, b, c, d} and E = {ab, ac, ac, ad,
bc, bd, cd}. Let A be PFS on V and B be PFMS on V × V defined as A =
{(a, (0.3, 0.2, 0.4)), (b, (0.4, 0.3, 0.1)), (c, (0.2, 0.3, 0.5)), (d, (0.1, 0.3, 0.5))} and B =
{(ab, (0.3, 0.2, 0.4)), (ac, (0.2, 0.2, 0.5)), (ac, (0.2, 0.2, 0.5)), (ad, (0.1, 0.2, 0.5)), (bc,
(0.2, 0.3, 0.5)), (bd, (0.1, 0.3, 0.5)), (cd, (0.1, 0.3, 0.5))}. This shows that Fig. 3 is a com-
plete PFMG.

Definition 14 Let in a PFG G have only one crossing between two edges (x y, (μ(x y), η(x y),
ν(x y))) and (wz, (μ(wz), η(wz), ν(wz))).
(i) If (μ(x y), η(x y), ν(x y)) = (1, 0, 0) and (μ(wz), η(wz), ν(wz)) = (0, 0, 0), then PFG
has no crossing.
(ii) If (μ(x y), η(x y), ν(x y)) has value close to (1, 0, 0) and (μ(wz), η(wz), ν(wz)) has
value close to (0, 0, 0), the crossing will not be vital for planarity.
(iii) If (μ(x y), η(x y), ν(x y)) = (1, 0, 0) (or close to (1, 0, 0)) and (μ(wz), η(wz), ν(wz)) =
(1, 0, 0) (or close to (1, 0, 0)), then the crossing will be vital for planarity.
Let in a PFG G, P is the intersecting point between two edges (ab, μiB (ab), ηiB (ab),
j j j
ν iB (ab)) and (cd, μ B (cd), η B (cd), ν B (cd)), where i and j are fixed integers. The strength

123
 57 Page 6 of 17 Int. J. Appl. Comput. Math (2020) 6:57

Fig. 3 Example of a complete PFMG

Fig. 4 Intersecting value between two edges

of  PF-edge ab is defined as Iab

 = (Tab , Aab , Fab )
μiB (ab) ηiB (ab) ν iB (ab)
= , ,
min(μ A (a),μ A (b)) min(η A (a),η A (b)) max(ν A (a),ν A (b)) . The edge ab is strong if Tab ≥
0.5, Aab ≥ 0.5 and Fab ≥ 0.5 otherwise weak. The intersecting value at P is
 Tab +Tcd Aab +Acd Fab +Fcd
I P = (T p , A p , F p ) = 2 , 2 , 2 .

Example 15 In Fig. 4, strength of edges (a, c) and (b, d) are Iac = (0.8, 0.75, 0.8) and
Ibd = (0.66, 1, 0.88), respectively. Thus intersecting value at P is 
I P = (0.73, 0.87, 0.84).

Degree of Planarity of a PFMG

Definition 16 Let P1 , P2 , . . . , Pk be k (integer) intersecting points between the edges in a

PFMG G. Then G is a PFPG with DP f = ( f T , f A , f F ), where f T = 1+{TP +TP1 +...+TP } ,
1 2 k
f A = 1+{A P +A 1P +...+A P } and f F = 1+{FP +FP1 +...+FP } .
1 2 k 1 2 k
Clearly, f = ( f T , f A , f F ) is bounded since 0 < f T ≤ 1, 0 < f A ≤ 1 and 0 < f F ≤ 1.
The DP may not be a PF-number.
In the representation of a PFPG if there is no point of intersection, then its DP is (1, 1, 1). If
the DP f increases and decreases, then number of intersecting points decreases and increases,
respectively and also the NP increases and decreases, respectively. We say that each PFG is
a PFPG with some DP.

Example 17 Consider a MG G ∗ = (V , E), where V = (a, b, c, d) and E = {ab, ac, ac, bc,
bd, bd, ad, cd}. Let A = (μ A , η A , ν A ) be a PFS of V and B = (μ B , η B , ν B ) be a PFMS of
V × V given in Tables 3 and 4.

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 7 of 17 57

Table 3 PFS A A a b c d

μA 0.5 0.4 0.6 0.3

ηA 0.2 0.1 0.2 0.1
νA 0.2 0.3 0.1 0.4

Table 4 PFMS B B ab ac ac bc bd bd ad cd

μB 0.4 0.3 0.3 0.4 0.2 0.2 0.2 0.2

ηB 0.1 0.2 0.1 0.1 0.1 0.1 0.1 0.1
ηB 0.2 0.1 0.2 0.1 0.3 0.2 0.2 0.3

Fig. 5 Example of PFPG

In Fig. 5, a PFPG is considered with two intersecting points P1 and P2 , between the edges
(ac, (0.3, 0.2, 0.1)), (bd, (0.2, 0.1, 0.3)) and (ac, (0.3, 0.1, 0.2)), (bd, (0.2, 0.1, 0.2)),
respectively. The strength of the edges (ac, (0.3, 0.2, 0.1)), (bd, (0.2, 0.1, 0.3)), (ac, (0.3,
0.1, 0.2)) and (bd, (0.2, 0.1, 0.2)) are respectively Iac = (0.6, 1, 0.5), Ibd = (0.66, 1, 0.75),
Iac = (0.6, 0.5, 1) and Ibd = (0.66, 1, 0.5). For the intersecting point P1 , intersecting value
is 
I P1 = (0.63, 1, 0.62) and that for P2 ,  I P2 = (0.63, 0.75, 0.75). Thus, the DP for this
PFMG is f = (0.44, 0.36, 0.42).

Theorem 18 Let G be complete PFMG. The DP f = ( f T , f A , f F ) of G is given by f T =

1+n p , f A = 1+n p , f F = 1+n p such that f T + f A + f F ≤ 1, where n p ≥ 2 is the number of
1 1 1

intersecting points between edges of G.

Proof For a complete PFMG G,

μiB (ab) = min{μ A (a), μ A (b)},

ηiB (ab) = min{η A (a), η A (b)},
ν iB (ab) = max{ν A (a), ν A (b)} ∀i = 1, 2, . . . , n ab and ∀a, b ∈ V .

Let P1 , P2 , . . . , Pk be k (integer) intersecting points between the edges of G. For an inter-

secting edge ab in G,

123
 57 Page 8 of 17 Int. J. Appl. Comput. Math (2020) 6:57


μiB (ab) ηiB (ab) ν iB (ab)
Iab = (Tab , Aab , Fab ) = , ,
min(μ A (a), μ A (b)) min(η A (a), η A (b)) max(ν A (a), ν A (b))
= (1, 1, 1).
Therefore, for the intersecting
 point P1 between
 the edges ab and cd,

I P1 = (T p1 , A p1 , F p1 ) = 1+1 , ,
1+1 1+1
= (1, 1, 1).
2 2 2
Hence  I Pi = (1, 1, 1), for i = 1, 2, . . . , k.
Then the DP f = ( f T , f A , f F ) of G is
1 1 1
fT = = = ,
1 + {TP1 + TP2 + . . . + TPk } 1 + {1 + 1 + · · · + 1} 1 + np
1 1 1
fA = = = ,
1 + {A P1 + A P2 + . . . + A Pk } 1 + {1 + 1 + · · · + 1} 1 + np
1 1 1
fF = = =
1 + {FP1 + FP2 + . . . + FPk } 1 + {1 + 1 + · · · + 1} 1 + np
such that f T + f A + f F ≤ 1. 

Definition 19 A PFPG G is strong if the DP f = ( f T , f A , f F ) of the graph is such that
f T > 0.5, f A > 0.5 and f F > 0.5. Otherwise it is called weak.
Theorem 20 Let G be strong PFPG. Then maximum number of intersecting point between
strong edges in G is one.
Proof Let G be strong PFPG. If possible, let between two strong edges (ab, (μiB (ab), ηiB (ab),
j j j
ν iB (ab))) and (cd, (μ B (cd), η B (cd), ν B (cd))) in G has at least two intersecting points P1
and P2 . For the strong edge ab,
μiB (ab) ≥ 21 min{μ A (a), μ A (b)},
ηiB (ab) ≥ 21 min{η A (a), η A (b)},
ν iB (ab) ≥ 21 max{ν A (a), ν A (b)} for all i = 1, 2, . . . , n ab . So Tab ≥ 0.5, Aab ≥ 0.5, Fab ≥
0.5.
Similarly, Tcd ≥ 0.5, Acd ≥ 0.5, Fcd ≥ 0.5.
Thus TP1 = Tab +T 2
cd
≥ 0.5, A P1 = Aab +A
2
cd
≥ 0.5, FP1 = Fab +F 2
cd
≥ 0.5.
Also, TP2 ≥ 0.5, A P2 ≥ 0.5, FP2 ≥ 0.5.
Then 1 + TP1 + TP2 ≥ 2, 1 + A P1 + A P2 ≥ 2, 1 + FP1 + FP2 ≥ 2.
Therefore, f T = 1+{TP1+TP } ≤ 0.5, f A = 1+{A P1+A P } ≤ 0.5, f F = 1+{FP1+FP } ≤
1 2 1 2 1 2
0.5.
It contradicts that G is strong PFPG. Thus between strong edges the number of intersecting
points can not be two. Obviously, the DP decreases, if number of intersecting points of strong
edges increases. Such as, if number of intersecting point of strong edges is one, then DP is
f = ( f T , f A , f F ), where f T > 0.5, f A > 0.5 and f F > 0.5. Any PFPG having no crossing
between edges is a strong PFPG. Hence maximum number of intersecting point between
strong edges in G is one. 

Definition 21 Let G be a PFG and c ∈ (0, 0.5) be a rational number. Then ab is called
considerable edge (CE) if min(μμAB(a),μ
(ab)
A (b))
≥ c, min(ηηAB(a),η
(ab)
A (b))
≥ c, max(ννAB(a),ν
(ab)
A (b))
≥ c for
each edge ab of G and c is known as considerable number (CN) of G.
Theorem 22 Let G be a strong-PFPG with CN c, then maximum number of intersecting
points between CEs in G is [ 1c ] or ( 1c − 1), according as 1c is not an integer or an integer,
respectively.

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 9 of 17 57

Proof Let G be strong-PFPG, where E = {(ab, (μiB (ab), ηiB (ab), ν iB (ab))), i = 1, 2,
. . . , n ab |ab ∈ V × V } with CN c ∈ (0, 0.5) and f = ( f T , f A , f F ) be the DP. For any
CE (ab, (μiB (ab), ηiB (ab), ν iB (ab))),
μiB (ab) ≥ c × min{μ A (a), μ A (b)}
ηiB (ab) ≥ c × min{η A (a), η A (b)}
ν iB (ab) ≥ c × max{ν A (a), ν A (b)}.
So Tab ≥ c, Aab ≥ c, Fab ≥ c.
Let P1 , P2 , . . . , Pn be n intersecting points between CEs. Then for P1 between two CEs
j j j
(ab, (μiB (ab), ηiB (ab), ν iB (ab))) and (cd, (μ B (cd), η B (cd), ν B (cd))),
Tab +Tcd Aab +Acd Fab +Fcd
TP1 = 2 ≥ c, A P1 = 2 ≥ c, FP 1 = 2 ≥ c.
n n n
So i=1 TPi ≥ n × c, i=1 A Pi ≥ n × c, i=1 FPi ≥ n × c.
Then f T ≤ 1+nc 1
, f A ≤ 1+nc
1
, f F ≤ 1+nc 1
.
Since G is strong, we have 0.5 < f T ≤ 1+nc 1
, 0.5 < f A ≤ 1+nc1
, 0.5 < f F ≤ 1+nc
1
.
Hence, 0.5 < 1+nc i.e., n < c .
1 1

This is satisfied for some integral values of n. Which are obtained from the expression:
 1
[ c ], if 1c is not an integer
n=
( 1c − 1), if 1c is an integer.



Theorem 23 Let G be a weak-PFPG . The intersecting points of strong edges in G is at least

two.

Proof Let G be weak-PFPG. If possible, let between two strong edges (ab, (μiB (ab), ηiB (ab),
j j j
ν iB (ab))) and (cd, (μ B (cd), η B (cd), ν B (cd))) in G has one intersecting point P. For the
strong edge ab,
μiB (ab) ≥ 21 min{μ A (a), μ A (b)},
ηiB (ab) ≥ 21 min{η A (a), η A (b)},
ν iB (ab) ≥ 21 max{ν A (a), ν A (b)} for i = 1, 2, . . . , n ab .
So Tab ≥ 0.5, Aab ≥ 0.5, Fab ≥ 0.5.
Similarly, Tcd ≥ 0.5, Acd ≥ 0.5, Fcd ≥ 0.5.
Tab +Tcd Aab +Acd Fab +Fcd
Thus TP = 2 ≥ 0.5, A P = 2 ≥ 0.5, FP = 2 ≥ 0.5.
Then 1 + TP ≥ 1.5, 1 + A P ≥ 1.5, 1 + FP ≥ 1.5.
Therefore, f T = 1
1+T P ≤ 0.67, f A = 1
1+A P ≤ 0.67, f F = 1
1+FP ≤ 0.67.
It contradicts the fact that PFG is a weak-PFPG. So intersecting points between strong edges
can not be one. 


Theorem 24 Let G be PFPG with DP f = ( f T , f A , f F ). If f T ≥ 0.67, f A ≥ 0.67 and

f F ≥ 0.67. Then G has no intersecting point between strong edges.

Proof Let G = (V , A, B) be a PFPG with DP f = ( f T , f A , f F ), where f T ≥ 0.67,

f A ≥ 0.67, and f F ≥ 0.67.
If possible, let P be the intersecting point between strong edges (ab, (μiB (ab), ηiB (ab),
j j j
ν iB (ab))) and (cd, (μ B (cd), η B (cd), ν B (cd))), where i, j are fixed integers. For the strong
edge ab,
μiB (ab) ≥ 21 min{μ A (a),μ A (b)},

123
 57 Page 10 of 17 Int. J. Appl. Comput. Math (2020) 6:57

ηiB (ab) ≥ 21 min{η A (a), η A (b)},

ν iB (ab) ≥ 21 max{ν A (a), ν A (b)} for i = 1, 2, . . . , n ab .
So Tab ≥ 0.5, Aab ≥ 0.5, Fab ≥ 0.5.
Similarly, Tcd ≥ 0.5, Acd ≥ 0.5, Fcd ≥ 0.5.
Tab +Tcd Aab +Acd Fab +Fcd
Thus TP = 2 ≥ 0.5, A P = 2 ≥ 0.5, FP = 2 ≥ 0.5.
Then 1 + TP ≥ 1.5, 1 + A P ≥ 1.5, 1 + FP ≥ 1.5.
Therefore, f T = 1+T
1
P
≤ 0.67, f A = 1+A
1
P
≤ 0.67, f F = 1+F
1
P
≤ 0.67.
A contradiction arises. Hence, G does not have any intersecting point between strong
edges. 

Now we present a special type of PFPG called 0.67-PFPG whose DP f = ( f T , f A , f F ),
where f T ≥ 0.67, f A ≥ 0.67, and f F ≥ 0.67. When DP is (1, 1, 1), then geometrical
representation of PFPG is like as crisp planar graph. The above theorem state that, if DP is
f = ( f T , f A , f F ), where f T ≥ 0.67, f A ≥ 0.67 and f F ≥ 0.67, then two strong edges not
intersect in G and if there is any crossing, this is the crossing between the edges except both
are strong. Thus any PFPG having no intersecting point between the edges is a PFPG with
DP (1, 1, 1). Therefore, it is a 0.67-PFPG.

Faces of a PFPG

We present picture fuzzy face (PFF) of a PFPG, which is an important property of the PFPG.
Face is a region bounded by PF-edges in a PFG. The presence of a PFF depending on minimum
strength of its boundary edges. Because if all boundary edges of a PFF have DTMS, DAMS
and DFMS 1, 0 and 0, respectively, it turn out crisp face but if we removed one of such edge
or has membership degrees 0, 0 and 1, respectively, the PFF does not exit. A PFF with its
membership degrees are defined below.
Definition 25 Let G be a PFPG and B = {(ab, (μiB (ab), ηiB (ab), ν iB (ab))),
i = 1, 2, . . . , n ab |ab ∈ V × V }, where n ab = max{i : μiB (ab)  = 0 or ηiB (ab)  = 0 or
ν iB (ab)  = 0}. A PFF of G is a region, bounded by the set of PF-edges E  ⊂ E. The DTMS,
DAMS and DFMS of PFF are, respectively 
μiB (ab)
min = 1, 2, . . . , n ab |ab ∈ E  ,
min(μ A (a),μ A (b)) , i

ηiB (ab) 
min min(η A (a),η A (b)) , i = 1, 2, . . . , n ab |ab ∈ E , and

ν iB (ab) 
max max(ν A (a),ν A (b)) , i = 1, 2, . . . , n ab |ab ∈ E .

Definition 26 A PFF is called strong if its DTMS > 0.5, DAMS > 0.5 and DFMS < 0.5
and weak otherwise. Each PFPG has an infinite region known as outer face and other faces
are inner faces.

Example 27 In Fig. 6, the PFPG has the following faces: PFF F1 is bounded by the edges
(v1 v2 , (0.4, 0.1, 0.1)), (v2 v3 , (0.6, 0.1, 0.1)) and (v1 v3 , (0.4, 0.1, 0.1)). Outer face F2 is
bounded by the edges (v1 v4 , (0.4, 0.1, 0.1)), (v1 v3 , (0.4, 0.1, 0.1)), (v2 v3 , (0.6, 0.1, 0.1))
and (v2 v4 , (0.5, 0.1, 0.1)). F3 is bounded by the edges (v1 v2 , (0.4, 0.1, 0.1)), (v1 v4 , (0.4, 0.1,
0.1)) and (v2 v4 , (0.5, 0.1, 0.1)). The PFFs F1 , F2 and F3 all have the same DTMS, DAMS
and DFMS 0.8, 1 and 0.33, respectively. So F1 , F2 and F3 are strong PFFs.

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 11 of 17 57

Fig. 6 Example of faces in PFPG

Picture Fuzzy Dual Graph (PFDG)

Now we present dual of PFPG with DP (1, 1, 1). In PFDG, vertices are assigned correspond-
ing to strong PFFs and edges are assigned corresponding to the boundary edges between two
PFFs.
Definition 28 Let G = (V , A, B) be a 0.67-PFPG and F1 , F2 , . . . , Fn be its strong PFFs. The
PFDG of G is a PFPG G 1 = (V1 , A1 , B1 ), where V1 = {xi , i = 1, 2, . . . , n} and the vertex
xi of G 1 is considered corresponding to the face Fi of G. The DTMS, DAMS and DFMS
of vertices are given by the mapping A1 = (μ A1 , η A1 , ν A1 ) : V1 → [0, 1] × [0, 1] × [0, 1]
such that
μ A1 (xi ) = max{μiB (ab), i = 1, 2, . . . , n ab |ab is the boundary edge of the strong PFF Fi },
η A1 (xi ) = max{ηiB (ab), i = 1, 2, . . . , n ab |ab is the boundary edge of the strong PFF Fi },
ν A1 (xi ) = min{ν iB (ab), i = 1, 2, . . . , n ab |ab is the boundary edge of the strong PFF Fi }.
In PFDG G 1 , may exists more than one edge between two vertices xi and x j as between
two faces Fi and F j of G may exists more than one common edge. Let μlB (xi x j ), ηlB (xi x j )
and ν lB (xi x j ) denotes the DTMS, DAMS and DFMS of the lth edge between xi and x j ,
respectively. The DTMS, DAMS and DFMS of the PF-edges of the PFDG are given by
μlB1 (xi x j ) = μiB (ab)l , ηlB1 (xi x j ) = ηiB (ab)l and ν lB1 (xi x j ) = ν iB (ab)l , where (ab)l is
boundary edge between PFFs Fi and F j and l = 1, 2, . . . , p, where p is the number of
common boundary edges between Fi and F j or the edges between xi and x j . If any strong
pendent edge present in PFPG, then corresponding to this edge there is a self-loop in G 1 .
The DTMS, DAMS and DFMS of the pendent edge of G and self-loop of G 1 are equal. In
the representation of a PFDG of strong PFPG with DP (1, 1, 1) have no intersecting point
between edges, so it is a PFPG with DP (1, 1, 1).
Example 29 In Fig. 7, consider a PFPG G = (V , A, B), where V = {a, b, c, d},
A = {(a, (0.4, 0.2, 0.3)), (b, (0.6, 0.2, 0.2)), (c, (0.7, 0.1, 0.3)), (d, (0.3, 0.4, 0.3))} and
B = {(ab, (0.4, 0.2, 0.1)), (ac, (0.3, 0.1, 0.1)), (ad, (0.3, 0.2, 0.1)), (bc, (0.6, 0.1, 0.1)),
(cd, (0.3, 0.1, 0.1)), (ad, (0.2, 0.2, 0.1))}.
This graph contains four faces F1 , F2 , F3 and F4 , where F1 is bounded by the edges
(ab, (0.4, 0.2, 0.1)), (ac, (0.3, 0.1, 0.1)) and (bc, (0.6, 0.1, 0.1)), F2 is bounded by the

123
 57 Page 12 of 17 Int. J. Appl. Comput. Math (2020) 6:57

Fig. 7 Example of PFDG

edges (ac, (0.3, 0.1, 0.1)), (ad, (0.3, 0.2, 0.1)) and (cd, (0.3, 0.1, 0.1)), F3 is bounded by
the edges (ad, (0.3, 0.2, 0.1)), (ad, (0.2, 0.2, 0.1)) and outer face F4 is bounded by the edges
(ab, (0.4, 0.2, 0.1)), (bc, (0.6, 0.1, 0.1)), (cd, (0.3, 0.1, 0.1)) and (ad, 0.2, 0.2, 0.1).
Since all PFFs are strong, we consider a vertex for the PFDG corresponding to each strong
PFF. Thus the vertex set is V1 = {x1 , x2 , x3 , x4 }, where xi is assigned corresponding to the
PFF Fi , i = 1, 2, 3, 4. Thus
μ A1 (x1 ) = 0.6, η A1 (x1 ) = 0.2, ν A1 (x1 ) = 0.1,
μ A1 (x2 ) = 0.3, η A1 (x2 ) = 0.1, ν A1 (x2 ) = 0.1,
μ A1 (x3 ) = 0.3, η A1 (x3 ) = 0.2, ν A1 (x3 ) = 0.1,
μ A1 (x4 ) = 0.6, η A1 (x4 ) = 0.2, ν A1 (x4 ) = 0.1.
It is seen that ab and bc are the common edges between F1 and F4 . So in PFDG G there
exists two edges between x1 and x4 . The DTMS, DAMS and DFMS of these edges are given
by
μ B1 (x1 x4 ) = μ B (ab) = 0.4, η B1 (x1 x4 ) = η B (ab) = 0.2, ν B1 (x1 x4 ) = ν B (ab) = 0.1,
μ B1 (x1 x4 ) = μ B (bc) = 0.6, η B1 (x1 x4 ) = η B (bc) = 0.1, ν B1 (x1 x4 ) = ν B (bc) = 0.1.
Also for the other edges of the PFDG these values are μ B1 (x1 x2 ) = μ B (ac) = 0.3,
η B1 (x1 x2 ) = η B (ac) = 0.1, ν B1 (x1 x2 ) = ν B (ac) = 0.1,
μ B1 (x2 x3 ) = μ B (ad) = 0.3, η B1 (x2 x3 ) = η B (ad) = 0.2, ν B1 (x2 x3 ) = ν B (ad) = 0.1,
μ B1 (x2 x4 ) = μ B (cd) = 0.3, η B1 (x2 x4 ) = η B (cd) = 0.1, ν B1 (x2 x4 ) = ν B (cd) = 0.1,
μ B1 (x3 x4 ) = μ B (ad) = 0.2, η B1 (x3 x4 ) = η B (ad) = 0.2, ν B1 (x3 x4 ) = ν B (ad) = 0.1.
Therefore, the edge set of PFDG is B1 = {(x1 x4 , (0.4, 0.2, 0.1)), (x1 x4 , (0.6, 0.1, 0.1)),
(x1 x2 , (0.3, 0.1, 0.1)), (x2 x3 , (0.3, 0.2, 0.1)), (x2 x4 , (0.3, 0.1, 0.1)), (x3 x4 , (0.2, 0.2, 0.1))}.
The PFDG G 1 of G is drawn by dotted line in Fig. 7.
Theorem 30 If n, p and m be the number of vertices, edges and strong faces, respectively in
a PFPG G and G 1 be its PFDG. Then the number of vertices, edges and strong faces of G 1
are equal to m, p and n, respectively.
Proof Proof is evident from the definition of PFDG. 

Theorem 31 Let G = (V , A, B) be strong PFPG without weak edges and the PFDG of G
be G 1 = (V1 , A1 , B1 ). The DTMS, DAMS and DFMS of the PF-edges of G 1 are equal to
the DTMS, DAMS and DFMS of the PF-edges of G, respectively.

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 13 of 17 57

Proof Let G be strong PFPG without weak edges and G 1 be its PFDG, which is also strong
PFPG as there is no intersection between edges. Let {F1 , F2 , . . . , Fn } be the collection of
strong PFFs of G.
For a PFDG, we have μlB1 (xi x j ) = μiB (ab)l , ηlB1 (xi x j ) = ηiB (ab)l and ν lB1 (xi x j ) =
ν B (ab)l , where (ab)l is the boundary boundary between PFFs Fi and F j and l = 1, 2, . . . , p,
i

where p is the number of common boundary edges between Fi and F j .

The number of PF-edges of G and G 1 are same as G has no weak edges. For every PF-edge
of G there is a PF-edge in G 1 with same DTMS, DAMS and DFMS. 


Picture Fuzzy Combinatorial Dual Graph (PFCDG)

In this section, we define PFCDG, which is one of the classification of PFDG and give some
theorems on it.
Definition 32 Let G = (V , A, B) be a 0.67-PFPG. The PFCDG G 1 = (V1 , A1 , B1 ), where
V1 = {xi , i = 1, 2, . . . , n} is the vertex set of G 1 . The DTMS, DAMS and DFMS of the
vertices of G 1 are given by the mapping A1 = (μ A1 , η A1 , ν A1 ) : V1 → [0, 1]×[0, 1]×[0, 1]
such that
μ A1 (xi ) = max{μr (xi x j ), r = 1, 2, . . . , n xi x j |xi x j is an edge which is incident to the vertex
xi },
η A1 (xi ) = max{ηr (xi x j ), r = 1, 2, . . . , n xi x j |xi x j is an edge which is incident to the vertex
xi },
ν A1 (xi ) = min{ν r (xi x j ), r = 1, 2, . . . , n xi x j |xi x j is an edge which is incident to the vertex
xi },
where n xi x j is the number of edges between xi and x j . Between the edges of G and G 1 there
is a one-to-one correspondence such that the DTMS, DAMS and DFMS of the edges of G 1
are known by the DTMS, DAMS and DFMS of the edges in G and satisfying the condition
that each cycle of G forms a cut set in G 1 .
Example 33 Consider a 0.67-PFPG G = (V , A, B), where V = {a, b, c, d, e}, A =
{(a, (0.5, 0.2, 0.3)), (b, (0.4, 0.1, 0.2)), (c, (0.6, 0.2, 0.3)), (d, (0.3, 0.3, 0.2)), (e, (0.5, 0.1,
0.3))} and B = {(e1 , (0.4, 0.1, 0.3)), (e2 , (0.4, 0.1, 0.3)), (e3 , (0.3, 0.2, 0.3)), (e4 , (0.3, 0.1,
0.3)), (e5 , (0.4, 0.1, 0.3)), (e6 , (0.3, 0.1, 0.2))} (see Fig. 8). The cycles of G are {e1 , e2 , e3 ,
e4 , e5 }, {e2 , e3 , e6 } and {e1 , e6 , e4 , e5 }. Each forms a cut set in PFCDG G 1 = (V1 , A1 , B1 ),
where V1 = {x1 , x2 , x3 }, A1 = {(x1 , (0.4, 0.1, 0.2)), (x2 , (0.4, 0.2, 0.2)), (x3 , (0.4,
0.2, 0.3))} and B1 = {(e1 , (0.4, 0.1, 0.3)), (e2 , (0.4, 0.1, 0.3)), (e3 , (0.3, 0.2, 0.3)),
(e4 , (0.3, 0.1, 0.3)), (e5 , (0.4, 0.1, 0.3)), (e6 , (0.3, 0.1, 0.2))}.

Theorem 34 Every 0.67-PFPG has a PFCDG.

Proof Let G be 0.67-PFPG and G  be the PFCDG. Then between the edges of G and G 1
there is a one-to-one correspondence such that the DTMS, DAMS and DFMS of the edges
of G 1 are known. Let C be a cycle of G and it divides G into two regions. Then we isolate
the vertices of G 1 into two non-empty subsets A and B  (say), both are determined by the
boundary of the cycle inside and outside C, respectively in G.
Let corresponding to the edges of C, we have a set of edges Ç in G 1 and removal of Ç
two subsets A and B  becomes disjoint and G 1 is disconnected. Thus Ç is a cut set of G 1 .
Hence, each cycle of G forms a cut set in G 1 . This proves the theorem. 


123
 57 Page 14 of 17 Int. J. Appl. Comput. Math (2020) 6:57

Fig. 8 a A PFPG G and b its PFCDG G 1

Fig. 9 a A PFPG G and b its PFCDG G 1

Example 35 Consider a 0.67-PFPG G = (V , A, B), where V = {a, b, c, d, e}, A =

{(a, (0.6, 0.3, 0.1)), (b, (0.5, 0.1, 0.4)), (c, (0.4, 0.2, 0.3)), (d, (0.3, 0.3, 0.4)), (e, (0.7, 0.1,
0.2))} and B = {(e1 , (0.5, 0.1, 0.4)), (e2 , (0.4, 0.2, 0.3)), (e3 , (0.3, 0.2, 0.4)),
(e4 , (0.4, 0.1, 0.4)), (e5 , (0.3, 0.1, 0.4)), (e6 , (0.5, 0.1, 0.4)), (e7 , (0.3, 0.1, 0.4)), (e8 , (0.3,
0.1, 0.4))} and its PFCDG is G 1 = (V1 , A1 , B1 ), where V1 = {x1 , x2 , x3 , x4 , x5 }, A1 =
{(x1 , (0.5, 0.2, 0.3)), (x2 , (0.5, 0.1, 0.4)), (x3 , (0.4, 0.2, 0.4)), (x4 , (0.5, 0.2, 0.3)), (x5 ,
(0.5, 0.1, 0.4))} and B1 = {(e1 , (0.5, 0.1, 0.4)), (e2 , (0.4, 0.2, 0.3)), (e3 , (0.3, 0.2, 0.4)),
(e4 , (0.4, 0.1, 0.4)), (e5 , (0.3, 0.1, 0.4)), (e6 , (0.5, 0.1, 0.4)), (e7 , (0.3, 0.1, 0.4)), (e8 , (0.3,
0.1, 0.4))} (see Fig. 9). Let C = {e1 , e2 , e3 , e4 } be any cycle of G such that A = {x1 , x3 }
and B  = {x2 , x4 , x5 } in G  . If we remove the corresponding edges of C, then G 1 becomes
disconnected. Hence, each cycle of G forms a cut set in G 1 .

Theorem 36 Every PFCDG of a PFG has a 0.67-PFPG.

Proof Let K 5 or K 3,3 has a PFCDG. Both graphs has finite number of edges and one inter-
secting point can not be avoid for any representation of them.
Case-I: Let K 5 or K 3,3 has at least one weak edge in G and this edge is not considered in
PFG G. Then G has no intersecting point between its edges and has a PFCDG G 1 . Thus K 5
or K 3,3 is a 0.67-PFPG.
Case-II: Let in K 5 or K 3,3 all edges are strong and there is only one intersecting point
between strong edges. Then the DP is f = ( f T , f A , f F ), where f T < 0.67, f A < 0.67, f F <

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 15 of 17 57

Fig. 10 A network of road map

0.67. Thus no dual graph can be drawn. Therefore, K 5 or K 3,3 does not have any 0.67-PFPG
and PFCDG. 


Theorem 37 A 0.67-PFPG is planar if and only if it has a PFCDG.

Proof Combining Theorem 34 and Theorem 36, we can conclude the above. 


Application

Consider a road map design among five big cities in a state interconnecting by high roads
and rail roads as shown in Fig. 10. Each cities R1 , R2 , R3 , R4 , R5 is represented by a vertex
and each high road and rail road between cities is represented by an edge. Here dotted edges
are rail roads and all other edges are high roads. The congestions of roads is a fuzzy quantity
as rate of congestions depends on decision makers attitude, practices, behavior, etc. The
measurement of congestions as a point is not easy for decision maker. So, we consider rate
of congestions as PFS and to model up the design of road map as a PFPG the degree of
membership of each vertices also consider as PFS as shown in Fig. 10.
In the high speed highways/railroads, design of crossings are always problematic. If num-
ber of crossing increases, then the rate of congestions increases and so vehicles are running
slow. Thus design of road maps is to be planned in such way for which number of crossing
decreases and DP increases. Hence, the measurement of DP is necessary. Suppose there are
three crossing P1 , P2 and P3 between the pair of roads (R1 R4 , R2 R5 ), (R1 R4 , R3 R5 ) and
(R2 R4 , R3 R5 ), respectively.
The strength of the intersecting roads are I R1 R4 = (0.66, 0.66, 0.75), I R2 R5 =
(0.8, 0.5, 0.8), I R3 R5 = (0.5, 0.7, 1) and I R2 R4 = (0.83, 1, 0.75). The intersecting value
at the points P1 , P2 and P3 are 
I P1 = (0.73, 0.58, 0.76), 
I P2 = (0.58, 0.68, 0.88) and  I P3 =
(0.67, 0.85, 0.88), respectively. Therefore the DP is f = ( f T , f A , f F ) = (0.33, 0.32, 0.28).
Since f T < 0.5, f A < 0.5, and f F < 0.5, it means that it is likely to be congestions.
If there is only one crossing throughout the network as shown in Fig. 11, the DP f =
(0.58, 0.63, 0.56). In this case, the DP is more than the previous case. So, this type of road
map Fig. 11 is more better than previous one (like Fig. 10).

123
 57 Page 16 of 17 Int. J. Appl. Comput. Math (2020) 6:57

Fig. 11 A network with minimum crossing

Comparative Study

Samanta and Pal [16] first introduced the concept of fuzzy planar graph considering the
crossing between edges. This concept is applicable only for fuzzy graphs. To minimize the
crossing between roads, Pramanik et al. [12] proposed a model to design the road map as an
IVF planar graph with membership values of vertices and edges taken as an interval number
and then determined the degree of planarity of IVF graphs. The measurement of congestions
was taken as interval valued fuzzy (IVF) sense in that paper. In IVF sets, the membership
values are considered as an interval. So these results are not applicable when the model is
considered in other environment like in picture fuzzy environment. This is why the results
in the current paper play an important role in such situations to give a better result. Our
experiment is the extension of the experiment by Pramanik et al. [12].

Conclusion

This study relates the PFPG with some of its properties and a very important consequences of
PFPG known as PFDG and PFCDG. An edges of a PFPG may be strong or weak. Using the
idea of weak edge, we define a graph known as PFPG in such way that an edge may intersects
another edges. But, the definition of planarity of graph is violates for this flexibility. We define
DP of a PFG. If the DP of a PFG is (1, 1, 1), then there is no crossing between two edges.
Thus, the planarity value measures the DP of a PFG. This is very important notion of PFG
theory. In future, we would like to work on m-step PF-competition graphs and its applications.

Acknowledgements The authors are highly grateful to the learned reviewers for their valuable comments and
suggestions to improve the quality of the article.

References
1. Al-Hawary, T., Mahamood, T., Jan, N., Ullah, K., Hussain, A.: On intuitionistic fuzzy graphs and some
operations on picture fuzzy planar graphs. Ital. J. Pure Appl. Math. (2018)

123
Int. J. Appl. Comput. Math (2020) 6:57 Page 17 of 17 57

2. Atanassov, K.T.: Intuitionistic fuzzy sets. Fuzzy Sets Syst. 20(1), 87–96 (1986)
3. Bhutani, K.R., Rosenfeld, A.: Strong arcs fuzzy graphs. Inf. Sci. 152(1), 319–322 (2003)
4. Cuong, B.C.: Picture fuzzy sets. J. Comput. Sci. Cybern. 30(4), 409–420 (2014)
5. Cuong, B.C., Hai, P.V.: Some fuzzy logic operators for picture fuzzy sets. In: Proceedings of Seventh
International Conference on Knowledge and Systems Engineering, pp. 132–137 (2015)
6. Ghorai, G., Pal, M.: A study on m-polar fuzzy planar graphs. Int. J. Comput. Sci. Math. 7(3), 283–292
(2016)
7. Nirmala, G., Dhanabal, K.: Special planar fuzzy graph configurations. Int. J. Sci. Res. Publ. 2(7), 1–4
(2012)
8. Nagoorgani, A., Hussain, R.J.: Fuzzy effective distance K-dominating sets and their applications. Int. J.
Algorithms Comput. Math. 2(3), 25–36 (2009)
9. Poulik, S., Ghorai, G.: Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with
applications. Hacet. J. Math. Stat. 49(1), 106–119 (2020)
10. Poulik, S., Ghorai, G.: Certain indices of graphs under bipolar fuzzy environment with applications. Soft
Comput. 24, 5119–5131 (2020)
11. Poulik, S., Ghorai, G.: Note on “Bipolar fuzzy graphs with applications”. Knowl. Based Syst. 192, 1–5
(2020)
12. Pramanik, T., Samanta, S., Pal, M.: Interval-valued fuzzy planar graphs. Int. J. Mach. Learn. Cybern.
7(4), 653–664 (2014)
13. Rosenfeld, A.: Fuzzy graphs. In: Zadeh, L.A., Fu, K.S., Shimura, M. (eds.) Fuzzy Sets and Their Appli-
cations, pp. 77–95. Academic Press, New York (1975)
14. Samanta, S., Pal, A., Pal, M.: Concept of fuzzy planar graphs. In: Proceedings of the Science and Infor-
mation Conference, London, UK, October 7–9, pp. 557–563 (2013)
15. Samanta, S., Pal, A., Pal, M.: New Concept of fuzzy planar graph. Int. J. Adv. Res. Artif. Intell. 3(1),
52–59 (2014)
16. Samanta, S., Pal, M.: Fuzzy planar graphs. IEEE Trans. Fuzzy Syst. 23(6), 1936–1942 (2015)
17. Shriram, S., Sujatha, R., Narasimman, S.: Fuzzy combinatorial dual graph. Int. J. Pure Appl. Math. 109(7),
35–41 (2016)
18. Yahya Mohamed, S., Subashini, N.: Bipolar fuzzy planar graphs. Int. J. Appl. Eng. Res. 13(12), 10535–
10538 (2018)
19. Zadeh, L.A.: Fuzzy sets. Inf. Control 8(3), 338–353 (1965)

Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and
institutional affiliations.

123