# Certain Notions of Picture Fuzzy Information with Applications

Authors: Rukhshanda Anjum; Abdu Gumaei; Abdul Ghaffar
Journal: Journal of Mathematics
 (2021)

---

## Abstract

In this manuscript, the theory of constant picture fuzzy graphs (CPFG) is developed. A CPFG is a generalization of constant intuitionistic fuzzy graph (CIFG) and a special case of picture fuzzy graph (PFG). Additionally, the article includes some basic definitions of CPFG such as totally constant picture fuzzy graphs (TCPFGs), constant function, bridge of CPFG, and their related results. Also, an application of CPFG in Wi-Fi network system is discussed. Finally, a comparison of CPFG is established with that of the CIFG which exhibits the superiority of the proposed idea over the existing ones is discussed.


---

## Body

## 1. Introduction

Wi-Fi systems and the analysis of their signals have been under discussion during the last decades [1, 2]. To provide signals effectively, potential research has been carried out in [3, 4]. A Wi-Fi device within the range can either be connected, disconnected, or fluctuate between the state of connected and disconnected or it could be out of range. Such uncertain situations can be dealt by the idea of PFG which proves to be helpful in such cases.Zadeh [5] proposed the theory of fuzzy sets FSs that is very popular tool and is considered the superior tool till now. Kaufman defined fuzzy graph FG in [6]. A detailed study is contributed by Rosenfeld in his article [7]. Since then theory of FGs has been extensively applied to many fields such as clustering [8–10], networking [11, 12] and communication problems [13–15].Atanassov [16] proposed intuitionistic fuzzy set (IFS) as a generalization of fuzzy set (FS). The concept of intuitionistic fuzzy relations has also been discussed in [16] providing fundamentals of the theory of IFGs. Parvathi and Karunambigai [17] defined IFGs as generalization of FGs and discussed various graph theoretic concepts. For detailed work in the course of IFGs, one may refer to [18–26]. The structure of IFGs is diverse than that of FGs and it is applied to many problems such as radio coverage networking [22], decision making and shortest path problems [20, 27–31], and social networks [32].In Wi-Fi networks, we usually face more situations that we could not handle by FGs and IFGs. Therefore, in this article, the idea of PFG and consequently CPFG is introduced as a generalization of constant IFGs. The properties and results of CPFG are discussed and illustrated with examples. In addition, a Wi-Fi network problem is modeled using CPFGs.The article starts with introduction followed by the section that discusses some basic ideas. The third section is based on concepts of PFGs while section four is based on CPFGs and its related theory. In section five, an application is discussed thoroughly with some numerical explanations. Finally, the concluding statements are added to the manuscript.


## 2. Preliminaries

This section discusses some basic ideas of graph theory including the ideas of FGs and IFGs. These concepts of FGs and IFGs are illustrated with the help of examples.Definition 1.
(see [7]). An FG is a pair G⌣=V,Ě such that(I)
V is the set of vertices and Τ1maps on [0, 1] are the association degree of vi∈V.(II)
Ě=vi,vj:vi,vj∈V×V andT2:V×V⟶0,1,whereT2vi,vj≤minT1vi,T1vj for all vi,vj∈Ě.Example 1.
AnFGG⌣=V,Ě with the collection of vertices V and the collection of edges Ě is depicted in Figure 1.Figure 1
FG.Definition 2.
(see [17]). An IFG is a pair G⌣=V,Ě such that(i)
V is the set of vertices such that T1 and F1 maps on the closed interval [0, 1] represent the grads of membership and nonmembership of the vertex elements vi∈V, respectively, with a condition 0≤T1+F1≤1 for all vi∈V,i∈I.(ii)
Ě⊆V×Vwhere T2,F2:V×V⟶0,1 represent the grads of membership and nonmembership of the edge elements vi,vj∈Ě such that T2vi,vj≤minT1vi,T1vj and F2vi,vj≤maxF1vi,F1vj with a condition 0≤T2vi,vj+F2vi,vj≤1 for all vi,vj∈Ě, i∈I.Example 2.
Consider anIFGG⌣=V,Ě depicted in Figure 2.Figure 2
IFG.


## 3. Picture Fuzzy Graphs

This section is based on some very basic concepts related to PFGs including its definition, and some of its associated terms such as degree of PFGs and completeness of PFGs are discussed.Definition 3.
APFG is a pair G⌣=V,Ě such that(i)
V is the collection of vertices such that T1,Ґ1,F1:V⟶0,1 represent the grads of membership, abstinence, and nonmembership of the vertex elements vi∈V, respectively, so long as 0≤T1+Ґ1+F1≤1 for all vi∈V,i∈I.(ii)
Ě⊆V×Vwhere T2,Ґ2,F2:V×V⟶0,1 represent the grads of membership, abstinence, and nonmembership of the edge elements vi,vj∈Ě such that T2vi,vj≤minT1vi,T1vj, Ґ2vi,vj≤minҐ1vi,Ґ1vj, and F2vi,vj≤maxF1vi,F1vj as long as 0≤T2vi,vj+Ґ2vi,vj∈+F2vi,vj≤1 for all vi,vj∈Ě, i∈I.
Moreover,1−T1i+Ґ1i+F1i represent refusal degree.Example 3.
APFGG⌣=V,Ě is depicted in Figure 3.Figure 3
PFG.Definition 4.
LetG⌣=V,Ě be PFG. Then, the degree of any vertex v is defined by dv=dTv,dҐv,dDv, where dTv=∑u≠vT2v,u, dҐv=∑u≠vҐ2v,u, and dFv=∑u≠vF2v,u.Example 4.
APFGG⌣=V,Ě depicted in Figure 4 is calculated as follows.
Degree of vertices is(1)dv1=0.3,0.3,0.8,dv2=0.2,0.3,0.8,dv3=0.0,0.3,0.8,dv4=0.1,0.3,0.8.Figure 4
PFG.Definition 5.
The complementG⌣′ of PFGG⌣=V,Ě is as follows:(1)
T1vi′=T1vi,Ґ1vi′=Ґ1vi,F1vi′=F1vi,∀vi∈V.(2)
T2vi,vj′=minT1vi,T1vj−T2vi,vj,Ґ2vi,vj′=minҐ1vi,Ґ1vj−Ґ2vi,vjandF2vi,vj′=maxF2vi,F2vj−F2vi,vj∀vi,vj∈Έ.Remark 1.
According to definition of a compliment, for aPFG, G⌣=V,Ě, the graph G⌣″=V″,Ě″=G⌣.Proposition 1.
G⌣=G⌣″⇔G⌣ is a strong PFG.Proof.
According to the definition ofG⌣′, the result and the proof are straight forward.Example 5.
Figures5 and 6 provide a verification of Proposition 1.Figure 5
(PFG).Figure 6
(Complement of Figure5).Definition 6.
APFGG⌣ is called a self-complementary graph if G⌣=G⌣″.Definition 7.
APFG is said to be a complete PFG if T2vi,vj=minT1vi,T1vj, Ґ2vi,vj=minҐ1vi,Ґ1vj, and F2vi,vj=maxF1vi,F1vj.Example 6.
A completePFG is depicted in Figure 7.Figure 7
(CompletePFG).Definition 8.
For any pair of different verticesvi,vj in a PFG, G⌣=V,Ě, if deleting the edge vi,vj lessens the strength between that pair of vertices, then this edge is called the bridge in graph G⌣.Example 7.
APFGG⌣=V,Ě is depicted in Figure 8 and explained as follows.
In Figure8, the strength of v1v4 is 0.1,0.3,0.4. Since the removal of v1,v4 from G lessens the strength between the vertices v1 and v4 in G, therefore, v1,v4 is a bridge.Figure 8
PFG.Definition 9.
For aPFGG, If we remove a vertex vi in G⌣ which decreases the strength of connectedness among some pairs of vertices, then it is called cut vertex of G⌣.


## 4. Constant Picture Fuzzy Graph

Definition 10.
APFGG⌣=vi,T1i,Ґ1i,F1i,èij,T2ij,Ґ2ij,F2ij is known as CPFG of degree ki,kj,kk or ki,kj,kk−PFG. If(2)dTvi=ki,dҐvj=kj,dfvk=kk∀vi,vj,vk∈V.Example 8.
AG⌣=V,Ě. Then, the CPFG is depicted in Figure 9.Figure 9
(CPFG). The degree of the verticesv1,v2,v3,andv4 is 0.3,0.6,0.6.Example 9.
A completePFG needs not be a CPFG depicted in Figure 10 and explained as follows.
Figure8 clearly shows that it is a complete PFG but not constant.Figure 10
(CompletePFG).Definition 11.
The total degreeτ1,τ2,τ3 of a vertex v∈V in PFGG is defined as(3)tdv=∑v∈ĚdT2v+T1v,∑v∈ĚdҐ2v+Ґ1v,∑v∈ĚdF2v+F1v.
If total degree of each vertex ofG⌣ is same, then G⌣ is called PFG of total degree τ1,τ2,τ3 or τ1,τ2,τ3-TCP.Example 10.
Consider a TCPFG depicted in Figure11.Figure 11
(Totally constantPFG).Theorem 1.
T1,Ґ1,F1 is a constant function (CF) in a PFGG⌣ iff the following are equivalent:(i)
G⌣ is a constant PFG.(ii)
G⌣ is totally PFG.Proof.
i⟹ii Consider T1,Ґ1,F1 is a constant function. Suppose T1vi=c1,Ґ1vi=c2 and F1vi=c3∀vi∈V where c1,c2, and c3 are constants. Let G⌣ be a constantPFG. Then, dFvi=v1,dҐvi=v2anddFvi=k3∀vi∈V. So, tdTvi=dFvi+T1vi,tdҐvi=dҐvi+Ґ1vi and dFvi=dFvi+F1vi∀vi∈V,tdTvi=k1+c1,tdҐvi=k2+c2, tdFvi=k3+c3∀vi∈V. Hence, ii is proved. ii⇒i Assume that G⌣ is a τ1,τ2,τ3-TCPFG. Then, tdTvi=τ1, tdҐvi=τ2 and tdFvi=τ3∀vi∈VdTvi+c1vi=τ1, dTvi+c1=τ1,dTvi=τ1−c1,dҐvi+Ґ1vi=τ1, dҐvi+c2=τ2,dҐvi=τ2−c2, and dFvi+c3=τ3,dFvi=τ3−c3. So, G⌣ is CPFG. Conversely, if (i) and (ii) are equivalent, then T1,Ґ1,F1 is a constant function. Now, T1,Ґ1,F1 is a constant function iff T1,Ґ1,F1 is a TCPFG. Assume that T1,Ґ1,F1 is not a constant function. Then, T1v1≠T2v2,Ґ1v1≠Ґ2v2,F1v1≠F2v2 for v1,v2∈V and if T1,Ґ1,F1 is a constant function, then T1v1=T2v2=k1,Ґ1v1=Ґ2v2=k2,F1v1=F2v2=k3. So, tdTv1=dTv1+T1v1=k1+T1v1 and tdTv2=k1+T1v2, tdҐv1=dҐv1+Ґ1v1=k2+Ґ1v1 and tdҐv2=k2+Ґ1v2, tdFv1=dFv1+F1v1=k3+F1v1 and tdFv2=k3+F1v2. Hence, T1v1≠T1v2,Ґ1v1≠Ґ1v2,F1v1≠F1v2 implies tdTv1≠tdTv2,tdҐv1≠tdҐv2,tdFv1≠tdFv2 implies G⌣ is not TCPFG which is leading to contradiction. Now, if G⌣ is TCPFG, then, by contrary, we can easily see that dTv1≠dTv2,dҐv1≠dҐv2,dFv1≠dFv2. Therefore, T1,Ґ1,F1 is a CF.Example 11.
APFGG=V,Ě is CPFG and TCPFG. Figure 12 explains the defined concept.Figure 12
T1,Ґ1,F1 is CF, then G⌣ is constant and totally constant).Theorem 2.
A constant and totally constant graphG⌣ implies that T1,Ґ1,F1 is CF.Proof.
SupposeG⌣ is CPFG and TCPFG. Then, dTv1=k1,dҐv1=k2anddFv1=k3 and tdTv1=τ1, tdҐv1=τ2,tdFv1=τ2. As tdTv1=τ1 where v∈V, then dTv1+T1v1=τ1,∀v∈V. k1+T1v1=τ1,∀v∈V implies T1v1=τ1−k1, ∀v∈V. Therefore, Γ1v1 is a constant function. Likewise, Ґ1v1=τ2−k2 and F1v1=τ3−k3,∀v∈V.Remark 2.
Converse of the above theorem is not true in general.Example 12.
APFG is not CPFG and not TCPFG. Figure 13 explains the defined concept.Figure 13
(T1,Ґ1,F1 is CF, then G⌣ is not a CPFG nor a TCPFG).Theorem 3.
If a crisp graphG is an odd cycle and G⌣ is aPFG, then G⌣ is CPFG ⇔T2,Ґ2,F2 which is a CF.Proof.
Assume thatT2,Ґ2,F2 is a constant function that implies T2=c1,Ґ2=c2,F2=c3∀vi,vj∈Ě, and implies dTv1=2c1,dҐv1=2c2,anddFv1=2c3, for any vi∈Ě, therefore, G⌣ is a CPFG.
Conversely, assume thatG⌣ is a k1,k2,k3-regular PFG. Consider è1,è2,è3,…,èn+1 represented the edges of G⌣ in order. Suppose T2è1=c1,T2è2=k1−c1,T2e3=k1−k1−c1=c1,T2e4=k1−c1, and so on. Likewise, Ґ2è1=c1,Ґ2è2=k1−c1,Ґ2è3=k1−k1−c1=c1,Ґ2è4=k1−c1, and so on; F2è1=c1,F2è2=k1−c1,F2è3=k1−k1−c1=c1,F2e4=k1−c1, and so on.
Hence,T2èi=c1,ifiis odd,k1−c1,ifiis even..
Therefore,T2è1=Tè2n+1=c1. Consequently, if è1 and è2n+1 connected at a vertex v1, then dTv1=k1,dè1+dè2n+1=k1,c1+c1=k1,2c1=k1/2.Remark 3.
For TCPFG, the above theorem does not hold.Example 13.
The followingPFG supports the above remark. In Figure 14, the defined concept is explained.Figure 14
(T2,Ґ2,F2 is constant function but no totally constant PFG).Theorem 4.
LetG be a crisp graph and G⌣ be an even cycle. Then, G⌣ is CPFG ⇔T2,Ґ2,F2 which is a CF or different edges have same truth membership, abstinence membership, and false membership values.Proof.
AssumeT2,Ґ2,F2 is a CF, then obviously G⌣ is a constant PFG. Conversely, suppose that G⌣ is k1,k2,k3CPFG. Consider è1,è2,è3,…,è2n to be the edges of even cycle G in that order. By theorem (3.3),(4)T2èi=c1,ifiis odd,k1−c1,ifiis even..
Likewise,(5)Ґ2èi=c1,ifiis odd,k1−c1,ifiis even,,F2èi=c1,ifiis odd,k1−c1,ifiis even..
Ifc1=k1−c1, then T2,Ґ2,F2 is a constant function. If c1≠k1−c1, then different edges have same truth membership, abstinence membership, and false membership values.Remark 4.
The above theorem does not hold for TCPFG.Example 14.
The followingPFG graph supports that a PFG is constant but not totally constant. Figure 15 explains the defined concept.Figure 15
(T2,Ґ2,F2 is CF, then G⌣ is CPFG, but no TCPFG).


### 4.1. Properties of ConstantPFG

Theorem 5.
If acCPFG is an odd cycle, then there is no PF bridge and no PF cut vertex.Proof.
SupposeG is a crisp graph having odd cycle and G⌣ is a constant PFG. Then, T2,Ґ2,F2 is a CF. Consequently, deleting any vertex does not decrease the strength of connectedness between any pair of vertices. Therefore, G⌣ is no bridge and no PF cut vertex.Theorem 6.
If a CPFG is an even cycle, then there is noPF bridge and no PF cut vertex.Proof.
SupposeG is a crisp graph having even cycle and G⌣ is a CPFG. Then, by Theorem 5, T2,Ґ2,F2 is a CF or different edges have same truth membership, abstinence membership, and false membership values.Case (i). If T2,Ґ2,F2 is CF, then deleting any vertex does not decrease the strength of connectedness between any pair of vertices. Therefore, G⌣ is no bridge and no PF cut vertexCase (ii). Straight forward.Remark 5.
For TPFG, the above theorem does not hold.Example 15.
Figure16 supports the above remark 5 in which the PFG constant is neither bridge nor cut vertex. Figure 16 explains the defined concept.Figure 16
(T2,Ґ2,F2 is constant but there is no PF bridge and no cut vertex).


## 4.1. Properties of ConstantPFG

Theorem 5.
If acCPFG is an odd cycle, then there is no PF bridge and no PF cut vertex.Proof.
SupposeG is a crisp graph having odd cycle and G⌣ is a constant PFG. Then, T2,Ґ2,F2 is a CF. Consequently, deleting any vertex does not decrease the strength of connectedness between any pair of vertices. Therefore, G⌣ is no bridge and no PF cut vertex.Theorem 6.
If a CPFG is an even cycle, then there is noPF bridge and no PF cut vertex.Proof.
SupposeG is a crisp graph having even cycle and G⌣ is a CPFG. Then, by Theorem 5, T2,Ґ2,F2 is a CF or different edges have same truth membership, abstinence membership, and false membership values.Case (i). If T2,Ґ2,F2 is CF, then deleting any vertex does not decrease the strength of connectedness between any pair of vertices. Therefore, G⌣ is no bridge and no PF cut vertexCase (ii). Straight forward.Remark 5.
For TPFG, the above theorem does not hold.Example 15.
Figure16 supports the above remark 5 in which the PFG constant is neither bridge nor cut vertex. Figure 16 explains the defined concept.Figure 16
(T2,Ґ2,F2 is constant but there is no PF bridge and no cut vertex).


## 5. Application

In this section, the application of CPFG in Wi-Fi network system is discussed.The Wi-Fi technology offers Internet access through a wireless network linked to the Internet to the electronic devices and machines that are in its range. The broadcasting of one or more interconnected access points (hotspots) can extend the range of the connection from a small area of a few rooms to a vast area of many square kilometers. The range of Wi-Fi signals depends on the frequency band, radio power output, and the modulation technique. Although the Wi-Fi connection provides easy access to the Internet, it is also a security risk as compared to the wired connection called Ethernet. For gaining access to Internet connection in a wired network connection, it is necessary to gain physical access to a building that has got the Internet connection or break through an external firewall. On the other hand, in a wireless Wi-Fi connection, the requirement for accessing the Internet is just to get within the range of the Wi-Fi. There are two types of Wi-Fi networks, namely, indoor and outdoor Wi-Fi networks. A compact Wi-Fi hotspot device is called an indoor coin Wi-Fi that intends to facilitate all the indoor owners to access the Internet. These provide Wi-Fi signals ranging at 100 meters (outdoor)/30 meters (indoor). This type of Wi-Fi network is discussed and modeled with the help of CPFG.Since there are four values to deal with, therefore, the CPFG has been applied to a Wi-Fi network. The first value represents the state of connectedness, the second value describes the fluctuating state of the connection of the device amid the connectedness and disconnectedness states, the third value shows the disconnection, and the last value shows that the device is not in the range. Since the structure of an IFG is limited to just two values, i.e., state of connection and disconnection, therefore, a Wi-Fi system is almost impossible to model through the concept of IFG, whereas the CPFG discusses more than these two situations. Consider an outdoor Wi-Fi system that contains four vertices representing the Wi-Fi devices in such a way that there is a block between every two routers and both routers have been giving signals to the block together, as shown in Figure17. With the help of CPFG, the devices can give a constant signal to each block.Figure 17
(PFG Wi-Fi network).The four vertices in Figure17 represent four different routers. The edge between each pair of routers shows the strength of the signals of the routers. Each edge and vertex are in the form of a picture fuzzy number where the first value represents the connectivity. The second one describes the fluctuating state of the device, i.e., the device is in range but fluctuates between the connected and disconnected states, the third value shows disconnection, and the last value indicates that the device is out of the range. The degree of each vertex is calculated using Definition 4. In this case, the degree of every router is same, which interprets that every router has been giving the same signals. It means that each router is providing the same signal to the block. Thus, the idea of CPFG has been successfully applied to practical problems showing its significance.Table1 shows the degree of the vertices in Figure 17.Table 1
(Vertices and their degrees).
VertexDegreev10.6,0.1,0.5v20.6,0.1,0.5v30.6,0.1,0.5v40.6,0.1,0.5


### 5.1. Advantages of PFG

The advantage ofPFGs over existing concept of IFGs is that IFGs cannot be used to model the Wi-Fi network systems as it allows to only deal with just two states, i.e., the state of connectedness and the state of disconnectedness only. The diverse structure of PFGs enables us to deal with uncertain situations with additional types of states, as presented in the application section. The block together is shown in Figure 18. With the help of IFG, the devices can give a constant signal to each block. But that IFGs cannot be used to model the Wi-Fi network system because it only allows to deal with two states, i.e., the state of connectedness and the state of disconnectedness only.Figure 18
(IFG-Wi-Fi network).


## 5.1. Advantages of PFG

The advantage ofPFGs over existing concept of IFGs is that IFGs cannot be used to model the Wi-Fi network systems as it allows to only deal with just two states, i.e., the state of connectedness and the state of disconnectedness only. The diverse structure of PFGs enables us to deal with uncertain situations with additional types of states, as presented in the application section. The block together is shown in Figure 18. With the help of IFG, the devices can give a constant signal to each block. But that IFGs cannot be used to model the Wi-Fi network system because it only allows to deal with two states, i.e., the state of connectedness and the state of disconnectedness only.Figure 18
(IFG-Wi-Fi network).


## 6. Conclusion

This manuscript proposes the ideas of PFG and CPFG. Some fundamental graph theoretic concepts are discussed and illustrated with the help of examples. Moreover, the comparison between PFG and IFG is carried out that shows the significance of the proposed concept. Furthermore, the proposed concept is applied to a practical problem of Wi-Fi network system, and results are discussed. More applications in the different fields can be discussed in the proposed framework, such as in engineering and computer sciences.



---

*Source: 9931792-2021-05-05.xml*