# Graphical Analysis of q-Rung Orthopair Fuzzy Information with Application

Authors: Hussain AlSalman; Bader Fahad Alkhamees
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

The q-rung orthopair fuzzy graph (q-ROFG) is an expansion of the intuitionistic fuzzy graph (IFG) and Pythagorean fuzzy graph (PFG); q-rung orthopair fuzzy model is an influential model for describing vagueness and uncertainty as a comparison to an intuitionistic fuzzy model and Pythagorean fuzzy model. The research aims to illustrate the notion of the graph of q-rung orthopair fuzzy sets (q-ROFSs). Furthermore, in this article, we examine the ideas of domination theory (DT) and double domination theory (DDT) in q-ROFGs. Additionally, the structure of q-ROFG is developed and its associated concept is presented through the assistance of instructive instances. Furthermore, the DT of q-ROFGs is established, as are cardinality, power, and completeness on dominance in a q-ROFG and bipartite q-ROFG, and double domination set (DDS), as well as some results, is investigated in the concept of q-ROFGs. A political campaign is simulated using the proposed structure as an application, and the impact of double dominance (DD) on political campaigns is investigated. Finally, a comparison is given between the proposed study and actual studies, as well as the advantages of working in the q-ROFG scenario.


---

## Body

## 1. Introduction

In 1965, Zadeh [1] initiated the notion of the fuzzy set (FS). The FS theory has been shown to be a useful tool for defining scenarios with uncertain or imprecise data. FS is an expansion of the crisp set. The intuitionistic fuzzy set (IFS) was first proposed by Atanassov [2]; here we can define the level of membership (LM) and the level of nonmembership (LNM) of an object. The IFS is an extension of FS which can be used in instances where FS is unsuitable. Yager [3] proposed the notion of Pythagorean fuzzy sets (PFSs) in 2013. PFS is an expansion of FS and IFS. As a consequence, it is better able to express and handle fuzzy data in practice and scientific study. The notion of q-ROFSs was also established by Yager [4], q-ROFS is an extension of IFS and PFS, and the major feature of q-ROFS is that the LM and LNM have a broader uncertain space. A q-ROFS is additionally more useful and efficient than IFS or a PFS to describe uncertainty in different decision-making issues.Kaufman [5] and Rosenfeld [6] proposed the notion of fuzzy graphs (FGs) as the generalization of crisp graphs. The vertices and edges of an FG are fuzzy numbers; therefore, a variety of investigators have applied the idea of FGs to real-world problems; for example, Sameena and Sunitha [7] utilized FGs in fuzzy neural networks, Sunitha and Mathew [8] investigated FG theory, and Yeh and Bang [9] used FGs in clustering analysis and cognitive and decision-making processes. IFG is expanded by Parvathi and Karunambigai [10], which is an extension of the FG. As previously stated, IFS is more beneficial than FS, and the same is true for IFGs and FGs. Talebi et al. [11] worked on new idea of IFG with application. Rangasamy et al. [12] worked out in a network the intuitionistic fuzzy shortest hyperpath. The IFSs and IFGs were extensively explored and presented by Akram and Al-Shehrie [13]. Bozhenyuk et al. [14] worked on the dominance set in IFG.Graph theory has been applied to a variety of fields. The DT and its uses are very prominent in graph theory. Sigaretta initiated the concept of total dominance on Certain Graphical Functions [15]. Different forms of dominance were developed by Karunambigai et al. [16] in IFG. DT is extremely useful in FGs and IFGs and has several applications. Somasundaram and Somasundaram [17] initiated the concept of DT of FGs, while Parvathi and Thamizhendhi [18] introduced the domination in IFGs. Additionally, [19, 20] addressed some features of strong domination in FGs. Borzooei and Rashmanlou [21] compiled and described the ideas of FG domination and their applications. Manjusha and Sunitha [22] presented some concepts in FGs; Zhang et al. [23] discussed how dynamic dominance develops in fuzzy causal systems. Shubatah [24] explored the notions of dominance and total domination in FGs. Jan et al. [25] investigated interval-valued PFGs decision-making and shortest path issues. Pachamuthu and Praveenkumar [26] introduced the idea of dominance in IFGs of second type. The graphs for nth type IFSs and their applications were presented by Davvaz et al. [27].The q-ROFG theory, which is based on q-ROFSs, was introduced by Habib and Farooq [28]; q-ROFGs are a generalization of IFGs and PFGs. FG simply addresses the level of membership, whereas IFGs, PFGs, and q-ROFGs describe both levels of membership and the level of nonmemberships. Yin et al. [29] worked on product operations on q-ROFGs. Zeng et al. [30] expanded the concepts of q-rung orthopair fuzzy weight induced logarithm. Wan et al. [31] worked on the weight average LINMAP group decision-making based on q-rung orthopair fuzzy triangular. Peng et al. [32] worked on the q-rung orthopair fuzzy decision-making system which was developed for implementing mobile edge caching method preferences. Peng and Luo [33] introduced a study that collects a total of 80 publications related to q-ROFS in Web of Science for in-depth analysis. Roughly important results regarding the country, annual trends level, journal level, institutional level, and research landscape and highly cited papers are illustrated and generated. They summarized eighteen research challenges or future directions for the q-ROFS theory. Therefore, the motivation is given by the need to examine the ideas of domination theory (DT) and double domination theory (DDT) in q-ROFGs.This article is arranged as follows. In Section 1, we give a quick overview of some basic definitions. In Section 2, we look through several essential terminologies and ideas associated with IFGs theory and q-ROFGs. In Section3, we extend the notion of q-ROFGs, q-rung orthopair fuzzy subgraph (q-ROFSG), and the component of edge relationship, bridge, and cut-vertices. In Section 4, we clearly illustrate the notion of dominance in a q-rung orthopair fuzzy environment. Section 5 presents the idea of q-ROFG double dominance and related terminology. In part 6, we discuss an innovative use of double domination in a candidate’s political campaign in a constituency. In part 7, we conduct a comparative analysis of the proposed methodologies with previous work dominance. Eventually, in part 8, we provide a summary of the study.


## 2. Preliminaries

In this portion, we will go over various essential ideas associated with the theory of FGs, IFGs, intuitionistic fuzzy subgraph (IFSG), and q-ROFSs. In this part, we will also examine the DT of IFSs.Definition 1.
(see [5]). A pair F=Č,Ď is said to be FG if(i)
Č=c1,c2,c3,…,ci is the set of vertices, and ξČ:Č⟶0,1 represents the LM of ci in Č such that 0≤ξČci≤1.(ii)
Ď=d1,d2,d3,…,di is the set of edges, and Ď⊆Č×Č. The mapping ξĎ:Č×Č⟶0,1 represents the LM of di, where ξĎci,cj≤minξČci,ξČcj for i,j∈ℕ. The condition of 0≤ξĎci,cj≤1 is satisfied.Definition 2.
(see [10]). A pair F=Č,Ď is said to be IFG if(i)
Č=c1,c2,c3,c4,…,ci is the set of vertices, and ξČ:Č⟶0,1 and ψČ:Č⟶0,1 show the LM and LNM of ci in Č, respectively, such that(1)0≤ξČci+ψČci≤1.(ii)
Ď=d1,d2,d3,…,di is the set of edges, and Ď⊆Č×Č. The mappings ξĎ:Č×Č⟶0,1 and ψĎ:Č×Č⟶0,1 are known as the LM and the LNM of di, respectively, where ξĎci,cj≤minξČci,ξČcj and ψĎci,cj≤maxψČci,ψČcj for i,j∈ℕ.(2)0≤ξĎci,cj+ψĎci,cj≤1.Example 1.
LetF=Č,Ď be an IFG in Figure 1, let Č=c1,c2,c3,c4 be the collection of vertices, and let Ď=c1c2,c3c4,c2c4,c1c3 be the collection of edges.Figure 1
IFG.Definition 3.
(see [10]). A pair F=Č,Ď is called IFG; then an IFSG is of the form F′=Č′,Ď′ if Č′⊆Č and Ď′⊆Ď, where ξČ'ci≤ξČci, ξĎ′di≤ξĎdi, ψČ′ci≥ψČci, and ψĎ′di≥ψĎdi, for i∈ℕ.Definition 4.
(see [18]). Let F=Č,Ď be an IFG; then, for any c1,c2∈Ď, c1 is said to dominate c2 in F if ξĎc1,c2=minξČc1,ξČc2 and ψĎc1,c2=maxψČc1,ψČc2. For Č′⊆Č, if, ∀c′∉Č′, ∃c∈Č∋c dominates c′, then Č is called the DS in F. The dominant number (DN) of an IFG F is the fuzzy cardinality of DS with the smallest fuzzy cardinality in F. The DN of F is symbolized as φF.Remark 1.
(i)
For anyc1,c2∈Č, if c1 dominates c2, then c2 dominates c1 in F; it displays the symmetry of domination(ii)
IfξĎc1,c2=minξČc1,ξČc2 and ψĎc1,c2=maxψČc1,ψČc2, for all c1,c2∈Č, then clearly the only DS in F is ČDefinition 5.
(see [18]). The strong edge of the edge c1,c2 in an IFG is of the form ξĎc1,c2≥ξĎ∞c1,c2, where ψĎc1,c2≥ψĎ∞c1,c2.Definition 6.
(see [18]). If there is no proper dominating subset, the DS S of an IFG is known as minimum DS.Definition 7.
(see [18]). If there is a strong independent edge between a couple of vertices in an IFG F, they are considered independent.Definition 8.
(see [4]). Let Č be a q-ROFS. Č in E is defined as Č=e,ξe,ψe|e∈E, where ξe:⟶0,1 shows the LM and ψe:⟶0,1 denotes the LNM and the following condition is satisfied:(3)0≤ξČne+ψČne≤1∀e∈E.
The doubleξ,ψ represents the q-rung orthopair fuzzy number (q-ROFN).


## 3. q-Rung Orthopair Fuzzy Graphs

In this part, we develop the idea of q-ROFG, q-rung orthopair fuzzy subgraph (q-ROFSG), and the relationship between edges, bridge, and cut-vertices. With the help of examples, these ideas are demonstrated.Definition 9.
(see [28]). A pair F=Č,Ď is said to be q-ROFG if we have the following:(i)
Č=c1,c2,c3,…,ci is the collection of vertices, and ξČ:Č⟶0,1 and ψČ:Č⟶0,1 show the LM and LNM of ci in Č such that(4)0≤ξČnci+ψČnci≤1.(ii)
Ď=d1,d2,d3,…,di is the set of edges, and Ď⊆Č×Č. The mappings ξĎ:Č×Č⟶0,1 and ψĎ:Č×Č⟶0,1 indicate the LM and LNM of di, correspondingly, where ξĎci,cj≤minξČci,ξČcj and ψĎci,cj≤maxψČci,ψČcj for i,j∈ℕ.(5)0≤ξĎnci,cj+ψĎnci,cj≤1.Example 2.
In Figure2, F=Č,Ď is a q-ROFG, Č=c1,c2,c3,c4 is a collection of vertices, and Ď=c1c2,c2c3,c3c4,c4c1 is a collection of edges.
Figure2 is simply q-ROFG for n=4.Figure 2
The q-ROFG.Remark 2.
IFGs and PFGs are q-ROFGs but the inverse is not true.Definition 10.
LetF=Č,Ď be a q-ROFG; then q-ROFSG is of the form F′=Č′,Ď′ such that Č′⊆Č and Ď′⊆Ď. ξČ' and ξĎ′ represent the LM and ψČ′,ψĎ′ represent the LNM, such that ξČ′nci≤ξČnci, ξĎ′ndi≤ξĎndiS, ψČ′nci≥ψČnci, and ψĎ′ndi≥ψĎndi, for i∈ℕ.Definition 11.
ci,cj is an edge in a q-ROFG F=Č,Ď. If removing this edge reduces the power of connectivity between pairs of vertices in F, it is called a bridge.Example 3.
LetF=Č,Ď be a q-ROFG in Figure 3, and Č=c1,c2,c3,c4 is a set of vertices and Ď=c1c2,c2c3,c3c1,c3c4 is a set of edges.
In Figure3, c3,c4 is a bridge.Figure 3
The q-ROFG for bridge.Definition 12.
The combination of two edge relationshipsdij,ξĎij,ψĎij and djk,ξĎjk,ψĎjk in a q-ROFG F, represented by dijodjk, is of the following form: dik,ξĎik,ψĎik; here, ξĎik=maxξĎij,ξĎjkjmin and ψĎik=minijmaxψĎij,ψĎjk, ∀ci,ck∈Č.Definition 13.
Ifdij is an edge connection of q-ROFG F, then the power of dij is defined as(6)=dij1dij=dij,ξĎij,ψĎij,=dij2dij°dij=dij,ξĎij2,ψĎij2,=dij3dij°dij°dij=dij,ξĎij3,ψĎij3,
and so on.(7)=dij∞dij,ξĎij∞,ψĎij∞.
Here,ξĎij∞=maxy=1,2,…nξĎijy and ψĎij∞=miny=1,2,…nψĎijy are the LM strength and the LNM strength of connecting between two vertices of ci and cj.
We have(8)dij0=0,ifci≠cjandci,ξČi,ψČiifciis equaltocj.Theorem 1.
Ifdij=ci,cj is an edge in F, then, for any two vertices in q-ROFG F=Č,Ď, the following statements are equipped:(i)
dij is a bridge(ii)
ξĎij∗∞<ξĎij, and ψĎij∗∞>ψĎij(iii)
dij, there is no cycle’s edgeProof: .
We will do it as follows:ii⇒i⇒iii⇒ii.
ii⇒i. Let ξĎij∗∞<ξĎij and ψĎij∗∞>ψĎij. To demonstrate that (i) is accurate, we suppose that the opposite is true. After that,(9)ξĎij∗∞=ξĎij∞≥ξĎij,andψĎij∗∞=ψĎij∞≤ψĎij
⇒ξĎij∗∞≥ξĎij, and ψĎij∗∞≤ψĎij, resulting in a contradiction, so (i) is true.
i⇒iii. Now, we let dij be a cycle’s edge; then, containing edge dij to any path can be converted onto a path that does not contain ci,cj. A cycle is a route from ci to cj⇒dij which is not a bridge, since it is a contradiction. Thus, dij is not a cycle’s edge.
iii⇒ii. The conclusion is simple.Definition 14.
ci is a vertex in a q-ROFG F=Č,Ď; if removing this vertex reduces the power of connectivity between some vertices in F, it is called a cut-vertex.Example 4.
Suppose thatF=Č,Ď is a q-ROFG in Figure 4, and Č=c1,c2,c3,c4,c5,…,ci is a set of vertices and Ď=c1c2,c2c4,c4c5,c4c3,c3c1 is a set of edges.
In Figure4, n=2, and c3 is a cut-vertex .Figure 4
The q-ROFG for cut-vertex.


## 4. Domination in q-Rung Orthopair Fuzzy Graph

In this part, for q-ROFGs, we introduced the ideas of cardinality, power, and completeness. Additionally, we define the domination in q-ROFG and prove it with some results. First, we define vertex cardinality (VC) and edge cardinality (EC).Definition 15.
LetF=Č,Ď be a q-ROFG. The VC of Č is defined and represented by(10)Č=∑ci∈Č1+ξČci−ψČci2,∀ci∈Č,
whereξČci,ψČci shows the level of membership and the level of nonmembership.Definition 16.
LetF=Č,Ď be a q-ROFG. Then, the EC of Ď is represented and defined by(11)Ď=∑ci,cj∈Ď1+ξĎci,cj−ψĎci,cj2,∀ci,cj∈Ď,
whereξĎci,cj,ψĎci,cj show the level of membership and the level of nonmembership.Definition 17.
The cardinality of a q-ROFGF=Č,Ď is defined and represented by(12)F=∑ci∈Č1+ξČci−ψČci2+∑ci,cj∈Ď1+ξĎci,cj−ψĎci,cj2.Remark 3.
In a q-ROFG, the order of q-ROFG means the collection of vertices, and it is indicated byOF. The size of a q-ROFG is defined as the set of edges in the q-ROFG F, and it is indicated by SF.Definition 18.
ForF=Č,Ď is a q-ROFG, the degree of vertex ci is defined as the sum of the weight of SE occurrence to ci, and it is represented by kFci. The least degree of F is δF=minkFci:ci∈Č, and the maximum degree of F is ΔF=maxkFci:ci∈Č.Definition 19.
In a q-ROFG, a couple of verticesci and cj are considered to be neighbors, if one or more of the following attributes is accurate:(i)
ξĎci,cj>0,ψĎci,cj>0(ii)
ξĎci,cj=0,ψĎci,cj>0(iii)
ξĎci,cj>0,ψĎci,cj=0,ci,cj∈ČDefinition 20.
In a q-ROFG, a path is a collection of various vertices such thatc1,c2,..,cn. Then, one of the following requirements must be completed:(i)
ξĎci,cj>0,ψĎci,cj>0(ii)
ξĎci,cj=0,ψĎci,cj>0(iii)
ξĎci,cj>0,ψĎci,cj=0.ci,cj∈Č, for i,j∈ℕ
The length of a path isP=c1,c2,…,cn+1n>0.Remark 4.
If a path connects a couple of vertices, they are said to be connected.Definition 21.
Ifci and cj are a couple of vertices in q-ROFG F associated using the path, then the path's strength is defined as mini,jξĎij,maxi,jψĎij, where mini,jξĎij is the ξ-strength of the weakest edge and maxi,jψĎij is the ψ-strength of the strongest edge.Definition 22.
Ifci,cj∈Č⊆F, then ξ-strength of connection between ci and cj is ξĎ∞ci,cj=supξĎxci,cj:x=1,2,..,n, and ψ-strength of connectivity between ci and cj is ψĎ∞ci,cj=infψĎxci,cj:x=1,2,..,n; if c and ħ are associated by ways of the path of length x; then, ξĎxc,ħ is defined as(13)supξĎc,ħ1minξĎħ1,ħ2minξĎħ2,ħ3….minξĎħx−1,ħ:c,ħ,ħ2,…,ħx−1,ħ∈Č.
ψĎxc,ħ is defined as(14)infψĎc,ħ1maxψĎħ1,ħ2maxψĎħ2,ħ3….maxψĎħx−1,ħ:c,ħ1,ħ2,…,ħx−1,ħ∈Č.Definition 23.
A pairF=Č,Ď is said to be a q-ROFG; then the complete q-ROFG is defined as ξĎij=minξČi,ψČj and ψĎij=maxξČi,ψČj for every ci,cj∈Č.Definition 24.
For a q-ROFGF=Č,Ď, an edge c,ħ is said to be an SE if ξĎc,ħ≥ξĎ∞c,ħ, and ψĎc,ħ≥ψĎ∞c,ħ. If there is an SE in c,ħ∈Č, we say that c dominates ħ. A node's neighbor is denoted by Nc=ħ∈Č:c,ħisastrong edge. Š⊆Č is assumed to be DS in F if, ∀ħ∈Č−Š, c∈Š such that c dominates ħ. If no proper subset of a DS occurs, it is called a minimal DS Š, and the subset of Š is DS cardinality. The lowest cardinality among all minimal DS is said to be the lower-dominant number (LDN) of F and is represented by kLF. The upper dominant number (UDN) is defined as the maximum cardinality among all DS, and it is represented by KUF. If there is no edge connecting the vertices, they are autonomous. A subset Š⊆Č is an autonomous set of F, if ξĎc,ħ<ξĎ∞c,ħ, and ψĎc,ħ<ψĎ∞c,ħ, where c,ħ∈Š. If the set Š∪​c is not independent for every vertex ħ∈Č−Š, the independent set Š of F is assumed to be maximally independent. If each vertex c∈Č−K, the set Š∪​c is not independent. For a minimum DS of F, if Č−K contains a DS K−1 of F, then K−1 is said to be the inverse of DS of F concerning K. Inverse dominating number M−1F of F is the cardinality of a minimum inverse DS of F. If a vertex c∈Č has merely one strong neighbor in F, it is known as an end-vertex.


## 5. Double Domination in q-Rung Orthopair Fuzzy Graph

In this part, we analyze the DDT of q-ROFGs. The idea of a DDS is described and illustrated with instances. The cardinality of DDS is investigated and the idea of minimal DD and maximal cardinality is studied.Definition 25.
LetF=Č,Ď be a q-ROFG and K⊆Č, where K is said to be DDS of F if each vertex in Κ−Č has minimum couple of vertices dominant in K. The double domination number (DDN) of F is described as the minimum fuzzy cardinality of all DDS of F and it is represented by MkkF.Example 5.
LetF=Č,Ď be a q-ROFG in Figure 5, and C=c1,c2,c3,c4,c5,c6 is a collection of vertices and Ď=d1,d2,d3,d4,d5,d6 is a set of edges.
In Figure5, we find out the DDN, where n=3d1,d2,d3, and d4 are strong edges (SE) and the minimum dominating set c1,c2,c3,c4,c5 is a DDS of F. So Č−K=c6 and the DDN is MkkF=3.1
Theorem2 shows the presence requirements for double domination and is presented below.Figure 5
Graph with double domination number.Theorem 2.
If the vertex inČ−K has at least two strong neighbors in a q-ROFG F, then DDS occurs in F.Proof:.
LetK be a DDS. If a vertex c∈Č−K includes only one strong neighbor, while further vertices Č−K have a minimum of two strong neighbors, then for all c∈Č−K, there is a vertex ħ∈K such that K is DS. This is an inconsistency, and so our assumption is incorrect. Therefore, each vertex in Č−K should hold a minimum of two strong neighbors.Example 6.
In Figure6, F=Č,Ď is a q-ROFG, where Č=c1,c2,c3,c4 is a combination of vertices and Ď=d1,d2,d3,d4,d5 is a combination of edges.
Heren=3d1,d2, and d5 are SEs and K=c1,c3,c4. So U−K=c2, and hence c2 possesses at least a couple of strong neighbors seen in Figure 6.
Theorem3 demonstrates the cardinality relation.Figure 6
At least two neighbors inČ−K.Theorem 3.
IfF is a q-ROFG and K is a DDS in F, then K≥Č−K.Proof .
By DD ofK, each vertex ħ in Č−K requires at least two vertices in K and each ħ's neighbor will appear in Ď. Furthermore, assume that the vertex is strong, and further dominating sets can be produced and neighboring vertices of ħ will appear in Ď. Hence, K≥Č−K.Example 7.
Suppose thatF=Č,Ď is a q-ROFG in Figure 7, and Č=c1,c2,c3,c4,c5,c6 is a set of vertices and Ď=d1,d2,d3,d4,d5 is a collection of edges.
In Figure7, n=4 and all the edges are SEs and K=c1,c3,c5,c6. So Č−K=c2,c4; therefore, |K|=4 and Č−K=2, and thus K≥Č−K.
Theorem4 examines the required conditions for minimizing double domination.Figure 7
Graph with cardinality.Theorem 4.
The DDSK is a minimal “iff” any two vertices ħ,ω∈K; then at least one of its statements is correct.(i)
There exists a vertexc∈Č−K, such that NČ∩​K≠ħ,ω(ii)
Č−K is isolatedProof.
For minimal DS in q-ROFGF, suppose that ħ,ω∈K such that ħ,ω do not fulfill conditions (1) and (2); suppose that K'=K−ħ,ω is a DDS fulfilling properties (1) and (2). Hence Č−K′ is isolated and there is the assumption that ħ,ω∈K. This supports our statement.
Conversely, for eachħ,ω in DDS K, at least one of qualities (1) and (2) is true. Suppose on the contrary that K is neot a minimum DDS. Then, ħ,ω∈K s.t K−ħ,ω is DDS. As a consequence, ħ,ω are adjacent to at least one node in K−ħ,ω, implying that ħ,ω are weak neighbors to all nodes in K. Hence, a node c∈Č−K s.t Nc∩​K≠ħ,ω which is an inconsistency. Thus, K is minimal DDS.
Theorem5 can be used to establish a relationship between double domination, greatest degree, and least degree correspondingly.Theorem 5.
LetF=Č,Ď be a q-ROFG. If K is the minimal DDS, then the following property holds:(15)W¨K≤δF+2.(i)
W¨K≥ΔF−1
HereW¨K, ΔF, and δF show the weight of DDS, greatest degree, and the least degree of F correspondingly.Proof:.
Suppose thatK is a minimal DDS.(16)W¨K=∑1≤i≤nmin∑​kξci,∑​max1≤i≤nkψci≥min∑​kξci,min∑​kψci=δξF,δψF=δF≤δF+2W¨K=∑​min1≤i≤nkξui,∑​max1≤i≤nkψui≤max∑​kξui,max∑​kψui=ΔξF,ΔψF=ΔF≥ΔF−1.Theorem 6.
Suppose thatF=Č,Ď is a q-ROFG with only end vertex. Then DDS K does not exist.Proof:.
For a q-ROFGF containing only end vertices, assume that K⊆Č. As F is only ended vertex, for every c∈Č−K∃c∈K such that K is DS.
Furthermore, not anyČ−K vertex is dominated by a minimum of two vertices. As a result, there is not any DDS K.Example 8.
In Figure8, F=Č,Ď is a q-ROFG, where Č=c1,c2,c3,c4,c5 is a combination of vertices and Ď=d1,d2,d3,d4,d5,d6 is a combination of edges.
In Figure8, n=2, d1 and d3 are the SEs, andthere is not any DDS. So, the other SEs are required to be d2 and d4.Figure 8
GraphF with only end nodes.Theorem 7.
For any q-ROFGF=Č,Ď,MkkF≥OF/ΔψF+1, where ΔψF is the greatest ψ-degree of F and OF represents the order of q-ROF.Proof:.
Suppose thatK is a DDS of q-ROFG F with K=MkkF. While each vertex in Č−K is nearby to a similar vertex in K, we have(17)Č−K≤∑i=1nkci≤MkkF.ΔξF,OF−MkkF≤MkkFΔψF,OF≤MkkFΔψF+MkkF,≤MkkFΔψF+1.
This implies that(18)MkkF≥OFΔψF+1.
Hence the proof is completed. Theorem 8 illustrates the presence of cut-vertices in DDS.Theorem 8.
IfF is a q-ROFG with cut-vertex, then DDS K will have a minimum of one cut-vertex.Proof:.
For a q-ROFGF with cut-vertex, it is assumed that no cut-vertex occurs in DDS K. Consider a cut-vertex c∈Č−K. While cut-vertices are usually the last vertices, as a result, c only has one strong neighbor, which is located in K. Furthermore, K is not a DDS, since c in K is not dominated by two or more vertices. This is in opposition to our supposition. Consequently, a cut-vertex c should occur in the DDS K. The proof is now complete.Example 9.
LetF=Č,Ď be a q-ROFG in Figure 9, and Č=c1,c2,c3,c4 is a collection of vertices and Ď=d1,d2,d3,d4,d5,d6 is a collection of edges.
Forn=2, note that d1,d2,d4,d5 are the SEs and K=c1,c3,c4; after that Č−K=c2; thus c2 is a cut-vertex that can be seen in Figure 9.Figure 9
Graph of a DDS with at least one cut-vertex.Theorem 9.
LetF=Č,Ď be a q-ROFG, and M−1F≤MkkF≤C, where M−1F is a double dominating number.Proof:.
Suppose thatF is a q-ROFG. By Theorem 3, inverse domination set K−1⊆Č−K, K≥Č−K, implying that the DDN is higher than the inverse dominating number; that is, M−1F≤MkkF, and DDS does not have all the vertices of F. This means that at least one of the vertices ħ must be in Č−K. Thus F−ħ provides the double domination number. Obviously MkkF≤Č. Hence proved.Theorem 10.
ForF being a q-ROFG, DDS K in F is independent but not in F.¯Proof:.
In q-ROFG with an independent DDS, it is assumed thatF¯ is the complement of F, and Č¯¯=Č.
ξČij¯=minξČi¯,ξČj¯−ξČij, and ψĎij¯=maxψĎi¯,ψĎj¯−ψĎij. Here the only difference is in the values of the edges in F. This indicates that neighboring vertices in F¯ contain significant neighbors having distinct DDS in F¯. Thus, in F, the similar DDS K is not independent in F¯. The proof is complete now.


## 6. Application

In political races, a lot of the time a politician’s target is to achieve as many supporters as feasible in the shortest possible time frame. The idea of a q-rung orthopair DS could be quite useful for this purpose. In general, when a region has a considerable lot of electorates, each elector in that area has registered a node of q-ROFG. By doing so, a large amount of data could be readily managed. Because every node symbolizes an elector, it is possible that two electorates are quite familiar with one another, such as close colleagues or relatives, or that they have just known one another for a short time, or that they are complete strangers. Such relationships between two electorates are indicated by an edge between two vectors. Every edge will display the voting power of two people who are linked to it. If two electorates do not know each other, there is not any edge between them. This is well understood if a political leader contacts a specific elector and secures his support; then, with the assistance of this candidate, he gets accessibility to each of his close friends or colleagues and so there is no need to communicate to each of them separately.Employing the DT of q-ROFGs, the political leader just wants to convene the member of the DSs of q-ROFGs. Therefore all elements of DS will persuade more members to support the same political leader; thus the majority of electorates can support a certain political leader.Example 10.
Consider the q-ROFG in Figure10, where we considered a precinct of 7 electorates, showing 7 vertices of q-ROFG, and used edges to discuss their connections. The q-ROFNs are used to represent the values of vertices and edges. Č=c1,c2,c3,c4,c5,c6,c7 is the total number of vertices and d1,d2,d3,d4,d5,d6,d7,d8,d9,d10 is the total number of edges. The minimum DS in F is certain by K=c1,c3; thus, K−Č=c2,c4,c5,c6,c7.
Now the issue can be dealt with by utilizing the q-rung orthopair DS. In order to build q-ROFG, the vertices are designed to denote the electorate in the area. These vertices are associated via edges if the allocated electorates have any relationship. Every relationship between two electorates is given a fuzzy value based on the quality of their interaction. When two people have no relationships, they are considered disconnected.
Utilizing the domination in q-ROFG, in the graph, there is a minimum DS, as well as the political leader only assembling the participants of that group. Therefore, all DS participants now can demand votes from all non-DS members. Even if the political leader is unable to meet with all of the electorates, his party will receive a majority of the votes. In Figure10, the political leader only desires to meet the electorate c1,c3 for winning an election. Algorithm 1 gives the steps to construct the q-ROFG.Algorithm 1:The main steps to construct the q-ROFG.
(1)
In the q-ROFNs configuration put all the values, including, LM and LNM all the vertices(2)
Using q-ROFGs, describe all of the edges(3)
Draw a contrast of all the edge’s values(4)
Construct the power for all edges(5)
OutcomeFigure 10
The q-rung orthopair fuzzy graphs for analysis.


## 7. Comparative Study and Advantages

The dominant idea of q-ROFG will be discussed in this part, which is more flexible than the dominant ideas of FG and IFG. The q-ROFG is an important tool for representing uncertainty and fuzziness. It can be used for enhancing decision-makers capability over orthopairs and their choices. In Example10, a q-ROFG is discussed wherein the vertices and edges are in the form of q-ROFNs. In this scenario, a q-ROFN is preferable to fuzzy numbers and intuitionistic fuzzy numbers for representing doubtful conditions. Consider the IFG in Figure 11. This graph can be understood as an FG with neutral and a level of nonmembership equivalent to zero. Nonetheless, if we look at the q-ROFG shown in Figures 11 and 12, it cannot be addressed by using ideas of FG and IFG, whereas a q-ROFG may or may not be considered FG or IFGFigure 11
IFG for analysis.Figure 12
FG for analysis.Furthermore, FG and IFG are unable to deal with the issue raised previously, since these frameworks are bound to certain types of grades. On the other side, if we try and replicate this research in the domain of q-rung orthopair fuzzy environment, we will find that it fails owing to structural restrictions. On the other hand, if we try to do this research in the framework of fuzzy information or intuitionistic fuzzy information, we will most likely fail due to structural restrictions. Table1 provides a thorough examination of the topic.Table 1
q-rung orthopair fuzzy information when dealing with fuzzy graphs and intuitionistic fuzzy networks.
ObjectLevelsSum of levelsExplanationsSum of squares of levelsExplanationsc1(0.8, 0.8)1.6False1.28Falsec2(0.5, 06)1.1False0.61Truec3(0.8, 0.7)1.5False1.13Falsec4(0.3, 0.5)0.8True0.34Truec5(0.2, 0.7)0.9True0.53Truec6(0.5, 0.6)1.1False0.61Truec7(0.5, 0.7)1.2False0.74Trued10(0.3, 0.8)1.1False0.73Trued2(0.5, 0.7)1.2False0.74Trued3(0.2, 0.8)1True0.68Trued4(0.3, 0.7)1True0.58Trued5(0.2, 0.8)0.8True0.68Trued6(0.4, 0.7)1.1False0.65Trued7(0.4, 0.7)1.1False0.65Trued8(0.2, 0.9)1.1False0.85Trued9(0.3, 0.6)0.9True0.65Trued10(0.5, 0.7)1.2False0.74True


## 8. Conclusion

A new concept of q-ROFGs is suggested in this paper. This innovative notion enables us to extend all notions such as FGs and IFGs. Moreover, we conceptualized and modified the concept of double domination theory which elaborates all the currently accessible ideas in graph theory for diverse structures. Basic operations such as cardinality, order, strength, and completeness on dominance, bipartite q-ROFG, and DDS are introduced and demonstrated. This research proposed the ideas of dominant and DDSs, as well as a study of associated terms based on examples. In addition, associated terminologies of q-ROFGs have been defined based on their attributes. The DT is demonstrated in conditions of an election campaign study. A political leader seeks to contact as many electors as possible in a short period. The idea of q-rung orthopair domination could be very useful in this particular skill scenario. The relative examination revealed that the planned framework is innovative and aids us in resolving the deficiencies of already available concepts to deal with a situation where other instruments fail to work. We intend to investigate the expansion and fuse of the q-ROFS graph forms in relation to certain application scenes in future study.



---

*Source: 9650995-2022-02-27.xml*