Investigating the Short-Circuit Problem Using the Planarity Index of Complex q-Rung Orthopair Fuzzy Planar Graphs

Hussain, Abrar; Alsanad, Ahmed; Ullah, Kifayat; Ali, Zeeshan; Jamil, Muhammad Kamran; Mosleh, Mogeeb A. A.

doi:https://doi.org/10.1155/2021/8295997

Complexity

On this page

Abstract Introduction Preliminaries Conclusions Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Dynamic Analysis, Learning, and Robust Control of Complex Systems

View this Special Issue

Research Article | Open Access

Volume 2021 | Article ID 8295997 | https://doi.org/10.1155/2021/8295997

Investigating the Short-Circuit Problem Using the Planarity Index of Complex q-Rung Orthopair Fuzzy Planar Graphs

Abrar Hussain,¹Ahmed Alsanad,²Kifayat Ullah,¹Zeeshan Ali,³Muhammad Kamran Jamil,¹and Mogeeb A. A. Mosleh⁴

Academic Editor: Ahmed Mostafa Khalil

Received12 Apr 2021

Accepted22 Jun 2021

Published22 Jul 2021

Abstract

Planar graphs play an effective role in many practical applications where the crossing of edges becomes problematic. This paper aims to investigate the complex q-rung orthopair fuzzy (CQROF) planar graphs (CQROFPGs). In a CQROFPG, the nodes and edges are based on complex QROF information that represents the uncertain knowledge in the range of unit circles in terms of complex numbers. The motivation in discussing such a topic is the wide flexibility of QROF information in the expression of uncertain knowledge compared to intuitionistic and Pythagorean fuzzy settings. We discussed the complex QROF graphs (CQROFGs), complex QROF multigraphs (CQROFMGs), and related terms followed by examples. Furthermore, the notion of strength and planarity index (PI) of the CQROFPGs is defined and exemplified followed by a study of strong and weak edges. We further defined the notion of complex QROF face (CQROFF) and complex QROF dual graph (CQROFDG) and exemplified these concepts. A study of isomorphism, coweak and weak isomorphism, is set up, and some results relating to the CQROFPG and isomorphisms are explored using examples. Furthermore, the problem of short circuits that results due to crossing is discussed because of the proposed study where an algorithm based on complex QROF (CQROF) information is presented for reducing the crossing in networks. Some advantages of the projected study over the previous study are observed, and some future study is predicted.

1. Introduction

Multiattribute decision making (MADM), pattern recognition, clustering, shortest path problems, and networking problems are some famous areas of real life where uncertainties are involved. In these situations, fuzzy set and its extended frameworks can be very beneficial, and many such problems are discussed in different fuzzy frameworks. In short, where there is uncertainty, there is room for a fuzzy set and its extensions to model such problems. To discuss several real-life problems involving complex information, the conception of the intuitionistic fuzzy set (IFS) based on falsity degree endowed with a truth degree was introduced by Atanassov [1]. In an IFS, the addition of the falsity degree enhanced the conception of the FS (introduced by Zadeh) [2] where only one aspect of the uncertain situation is expressed by a truth degree. This model of IFS is based on a certain restriction where the total of both falsity and truth degree lies in that restricts the allocation of the falsity and truth degrees. This barrier of allocation of the degrees of falsity and truth was relaxed by Yager [3] by introducing the conception of the Pythagorean FS (PyFS) where the total of the squares of both degrees allows to be in . The PyFS is a significant improvement in fuzzy settings, but still, allocation of the degrees of falsity and truth needed more flexibility which was granted by the conception of the QROF set (QROFS) by Yager [4]. The layout of the QROFS removes any kind of barrier once and for all whenever information needs to be portrayed by duplets, i.e., falsity and truth degrees. A significant amount of research is performed in the frame of these duplets, and one is referred to [5–10] for some recent accomplishment.

The earlier discussed fuzzy layouts including FS, IFS, PyFS, and QROFS take degrees of falsity and truth from the real unit interval . This was generalized by Ramot et al. [11] where complex numbers are used to portray uncertain information from a unit circle by the notion of complex FS (CFS). In the settings of CFS, truth degrees of the information are expressed by those complex numbers that lie in a unit circle (complex numbers with magnitude less than or equal to 1). This was a new addition in the fuzzy environment and was followed by many researchers for practical usage. This notion of CFS was followed by Alkouri and Salleh [12], Ullah et al. [13], and Liu et al. [14, 15] who proposed the layouts of the complex IFS (CIFS), complex PyFS (CPyFS), and complex QROFS (CQROFS), respectively. These investigations are quite familiar with the work carried out in [1, 3, 4] with the rules that the CIFS allows the total of complex truth and falsity degrees in the range and the CPyFS allows the total of the squares of the complex truth and falsity degrees in the range , while the CQROFS allows the total of the q^th powers of the complex falsity and truth degrees in the range . In these investigations, if a complex truth or falsity degree is expressed in terms of polar form, say , then and denote the amplitude and phase terms, respectively. Although these conceptions are very recently introduced, still a great amount of attraction is given to these notions and some remarkable work has been carried out in [16–24].

The theory of fuzzy graph (FG) was discovered by Rosenfeld [25] where the nodes and edges are defined in terms of the membership degrees. There were some cases where the falsity degree needs to be employed along with truth degree and the theory of FG was not able to cope with such issues; for this, the theory of intuitionistic fuzzy graph (IFG) was discovered by Parvathi and Karunambigai [26] by associating the falsity degree with FG. The theory of IFGs is an advanced and elastic version than FGs to manage awkward and complicated information in realistic issues. A deep study about the investigations of the IFGs is carried out in [27]. Moreover, Akram et al. [28] modified the theory of IFG by discussing the theory of Pythagorean FG (PyFG) where the restraint imposed on the IFG was improved by allowing the total of the squares of the truth and falsity degrees in the range . Furthermore, Habib et al. [29] modified the theory of PyFG to discover the theory of QROF graphs (QROFGs) by improving the restriction on duplets of information by allowing the sum of the q-powers of the truth and falsity grades in the range . The theory of QROFG was further studied and investigated by [30] where the notion of hypergraphs is introduced in the frame of QROFGs.

Motivated by the work of Ramot et al. [11] and Rosenfeld [25], the notion of complex FG (CFG) was introduced by Thirunavukarasu et al. [31]. In CFGs, the degrees of truth are described using complex numbers instead of real values from . This notion of CFG cannot be applicable in some cases; for this, the theory of complex IFG (CIFG) was discovered by Yaqoob et al. [32] by discussing the complex-valued falsity degree in the environment of CFG. The theory of CIFG is an enhanced version of the CFG to manage awkward and complicated information in realistic issues. Moreover, Akram and Naz [33] modified the theory of CIFG to discover the theory of complex PyFG (CPyFG) by improving the condition of CIFG, i.e., the sum of the squares of the complex-valued truth and complex-valued falsity grades ranges in . The theory of CPyFG is more flexible than CIFG to manage awkward and complicated information in realistic issues. A comprehensive study is established on the frame of CPyFG in [34, 35].

PI is one of the widely discussed characteristics in graph theory which has some potential application in electric circuit theory. A planar graph is a graph that has no crossings of its edges, and this concept is very beneficial in reducing short circuits in electric networks. In the framework of FGs, IFGs, and PyFGs, the PI is discussed comprehensively with its applications, and for details, one can see [36–40]. The concept of planarity is also investigated in several other frameworks including CPyFGs in [29, 41, 42]. There are some issues that cannot be resolved by using the CPyFG, for instance, if a decision maker provides information that cannot be handled by the CPyFG due to its constraint that the sum of the squares of both grades cannot exceed from unit interval. For managing such types of issues, we aim to enhance the theory on the PI of the FG, IFG, PyFS, CIFG, and CPyFG by investigating the theory of the PI of the complex QROFG (CQROFG). The theory of PI in the environment of the CQROFG has two main advantages over previous work as it discusses two aspects of opinion by falsity and truth degree. Secondly, it represents uncertain information with the help of complex truth and falsity degrees with greater flexibility. The summary of the proposed work is discussed as follows:(1)CQROFPG is an enhanced version of the QROFPG to cope with awkward and complicated information in realistic decision issues. In this investigation work, the idea of CQROFPG and its related ideas are discovered and verified with the help of examples.(2)The planarity of these outlines relies on the fact that the information is described in terms of a complex number instead of crisp values from . Here, the contemplations of CQROFMGs, CQROFPGs, and some perceived pieces of these graphs are presented by examining the complex QROF planarity using weak and strong edges.(3)A close-by association is set up among CQROFPGs and dual graphs. Discussion about the nonplanarity of graphs and the thoughts of coweak isomorphism, isomorphism moreover, weak isomorphism for CQROFPGs is in like manner added.(4)By using numerical examples, the applications of the discovered theories are also utilized. To find the reliability and effectiveness of the presented work, we discussed the comparative study, advantages, and geometrical representations of the explored approaches.

The manuscript is organized as follows: In Section 2, we recall the ideas of the QROFS, QROFG, and CQROFSs and some other basic terms. In Section 3, the conception of the complex q-rung orthopair fuzzy relation (CQROFR), CQROFG, complex QROF multiset (CQROFMS), and CQROFMG and the ideas of strong and effective edges are elaborated. Section 4 is based on notions of strong edges in the CQROFGs, CQROFPG, and PI where examples are provided in support of these notions. In Section 5, the concepts related to CQROFF and CQROFDGs are discussed along with related results supported by examples. In Section 6, the isomorphism between two CQROFPGs is established where the coweak and weak isomorphic relations are investigated with the help of examples. In Section 7, we present an application of the PI of CQROFPGs in short-circuit problems with the help of illustrative examples. In Section 8, we comparatively examine the advantages of the CQROFPGs over the previous study followed by some conclusive remarks in Section 9.

2. Preliminaries

The purpose of this section is to recall some basic terms and notions based on which we proposed the new concepts and results. We discussed some basic definitions of the PyFS [2], CPyFS [13], CPyFG [36], CPyFMS [36], QROFS [4], QROFG [30], and CQROFS [14] in this section. Throughout this paper, and denote the truth and falsity degrees of the information respectively, whose values are assigned from . Furthermore, denotes a universal set and be its arbitrary element.

Definition 1 (see [2]). A PyFS is of the form

Definition 2 (see [13]). A CPyFS is of the form

Definition 3 (see [36]). A CPyFG on is a pair, where is a CPyF vertex set on and is a CPyF relation on such thatwhere , for all and for all .

Definition 4 (see [36]). A CPyFMS is characterized in a way where falsity degree and truth degree functions give every object degrees of truth and falsity in given by and , that is, and and . The elements of , where (for amplitude terms) and (for phase terms). A similar pattern can be followed for the elements of such that and for all . For convenience, we have

Definition 5 (see [4]). A QROFS is of the form

Definition 6 (see [30]). A QROFG on a nonempty set is a pair where is a QROF vertex set on and is a QROF relation on such thatwhere and with .

Definition 7 (see [14]). A CQROFS is of the form

3. Complex q-Rung Orthopair Fuzzy Graphs

As discussed earlier, the notion of CQROFS [14] flexibly described the falsity and truth degrees under uncertainty with the help of complex numbers. In comparison with the CIFS, the CPyFS gives the same results by allowing us wide ground for the selection of degrees of falsity and truth. In this section, we aim to present the notion of CQROFR followed by the conception of CQROFGs and related ideas.

Definition 8. A CQROFR is defined bywhere and .

Definition 9. A CQROFG is a pair , where is a CQROF vertex set on and is a QROF relation on such thatand , , for all .

Definition 10. A CQROFMS is characterized in a way where falsity degree and truth degree functions give to every object degrees of truth and falsity in by and that is, and and . The elements of , where (for amplitude terms) and (for phase terms). A similar pattern can be followed for the elements of such that and for all . For convenience, we have

Definition 11. Let be a CQROFS on , and let be a CQROFMS on such that.
Then, is called a CQROFMG.

Example 1. Let be an MG, where and . Suppose a CQROF vertex set and CQROF multiedge set defined on as , respectively.Then, the pair forms a CQROFMG and is portrayed in Figure 1.

Definition 12. Let be a CQROF multiedge set in CQROFMG . Then, a strong multiedge of is elaborated byTo illustrate Definition 5, we consider an example based on Figure 1 as follows.

Example 2. By using the information of Example 1, we have as a strong edge because and, on the other hand, .

Definition 13. Let be a CQROF multiedge set in CQROFMG . An edge of is called effective if the following axioms are satisfied for some fixed :Example 3 supports Definition 13.

Example 3. In Figure 1 is said to be an effective edge as in case of amplitude terms, and for phase terms, .

Definition 14. Let be a CQROFMG andbe a CQROF multiedge set. Then, a CQROFMG is known as complete ifTo support Definition 14, we consider Figure 2 followed by Example 4.

Example 4. Consider an MG , where and Suppose a CQROF vertex set and a CQROF edge set defined on and , respectively, as follows:

4. Complex q-Rung Orthopair Fuzzy Planar Graphs

Planar graphs are those where there is no crossing of edges. Planarity is discussed under uncertainty on a wide range [36]. The aim of this section is to discuss the planarity in the environment of CQROFGs where the truth and falsity degrees of information are flexibly described with a parameter in a complex plane instead of crisp real values from .

First, we discuss the notion of strength of CQROF edges and support this concept by Example 5 as follows.

Definition 15. In a CQROFG, the strength of an edge is of the formIf , and . Then, the edge is known as strong and otherwise weak.

Example 5. Let be an MG, where and . Suppose a CQROF vertex set and CQROF multiedge set defined on and , respectively, as follows:Then, the strength of each edge is computed as follows:Since , edge is the only strong edge in the CQROFMG depicted in Figure 3.

Definition 16. Consider as a CQROFMG. Let us assume two edges in , i.e., and , intersect at point . The value of cut point is given bywhereIn the CQROFMG, the cut point and planarity are inversely proportional, so planarity decreases with the increase in the number of cut points.

Definition 17. Consider as a CQROFMG. Suppose to be the cut points of the edges. So, is called a complex QROF planar graph (CQROFPG) with CQROF PI of in the formIf there is no cut point in the CQROFPG, then its CQROF PI is assumed as and the corresponding crisp graph is a planar graph.

Remark 1. Every CQROFMG with some precise PI is a CQROFPG.
To support the abovementioned remark, we present Example 6.

Example 6. Suppose that is an MG in which and .
Let and be the CQROF vertex set and CQROF multiedge set defined on and , respectively, given as follows by a CQROFMG as depicted in Figure 4:Let and be two cut points in the CQROFMG, as shown in Figure 4. For the edges,The strength isThe first and second cut points are given as follows:The PI is given by

Theorem 1. Let be a CQROFMG whose intersecting edges are effective. Then, CQROF planarity index of is given aswhere and denote the number of crossing among the edges in .

Proof. Let be a CQROFMG having intersection edges effective, that is,Let be the cut points of the edges in , where is the positive integer. For each edge in ,Therefore, the cut point of the edges and isSo, for . The PI of the CQROFMG isHere, denotes the number of crossing among the edges in .

5. Faces and Dual Graphs of CQROFPGs

Faces in graphs are termed as those regions which are surrounded by edges. The presence of the CQROFF is due to the presence of the edges in CQROFGs. Even the slightest strength CQROF edges guaranteed the existence of CQROFFs. A PI of assures that there is no crossing between the CQQROF edges.

Definition 18. Let a CQROFPG with PI andA CQROFF is a region bordered by a CQROF edge set of of the CQROFPG defined as

Definition 19. A CQROFF is considered a strong CQROFF if , , , and and otherwise weak.

Remark 2. An outer CQROFF is said to possess a limitless region of the CQROFPG; otherwise, it is considered as an inner CQROFF.

Example 7. Suppose that is a CQROFPG, as shown in Figure 5. Let , and be the CQROFFs given as follows:
Now, we see that is strong and the other two faces and are weak faces.

Remark 3. Every strong CQROFF has a strong CQROF edge.
The conception of dual graphs has been widely discussed in the literature, and it has a close connection with planar graphs. There exist some results that relate planarity with duality, i.e., the graphs for which dual graphs exist are known as planar graphs. Due to this reason, we aim to discuss the CQROFDG in our next study and establish its relationship with CQROFPGs.

Definition 20. Consider as a CQROFPG whereSuppose that the strong CQROFFs of are . Then, the CQROFDG of is a CQROFPG where denotes the nodes of for CQROFFs . Moreover, the degrees of truth and falsity of the vertices are given by mapping such thatThe edge is near to the strong CQROFF. Between every two CQROFFs and , there may exist more than one common edge. Hence, there may occur more than one edge between two nodes in CQROFDG . The degrees of the truth and falsity of CQROF edges of the CQROFDG can be computed aswhere denotes those edges that lie in the surrounding of strong CQROFFs and where . As there are no cut points in the CQROFDG of CQROFPG , its PI is .

Example 8. Consider a CQROFPG as portrayed in Figure 6 with . Calculation shows that three strong CQROFFs , and exist whose vertices are shown by little circles and the edges are displayed dotted. The nodes of CQROFDGs are computed as follows:We observed that comes out to be the only common edge between and in . Hence, there exists only one edge between the vertices and in CQROFDG of since , , , , and .
The edge set of the CQROFDG is given byHence, is a CQROFDG of
The dotted line shows a CQROFDG of the CQROFPG which is represented by the bold edges in Figure 6.

Theorem 2. Let and denote a CQROFPG with no weak edge and a CQROFDG, respectively, with as their vertices, as their strong faces, and as their edges. Then, , , and .

Proof. The proof is straightforward.

Theorem 3. Consider a CQROFPG and its dual graph . Let and denote the strong CQROFFs in and the number of vertices in , respectively. Then, .

Proof. Let denote a CQROFDG of a CQROFPG and be the vertices in and be strong CQROFFs in . As contains both weak and strong CQROF edges and the CQROFDG does not contain any weak CQROF edge, the existence of some weak CQROF edges in leads to the fact that some vertices have weak CQROF edges in their neighborhood. Let denote such vertex, and any strong CQROFF has no vertex like . The remaining vertices are (by excluding these vertices and neighboring edges). Furthermore, which means.

Theorem 4. The absence of a weak edge in a CQROFDG of a CQROFPG assures that the degrees of truth and falsity of CQROF edges of and are equivalent.

Proof. Suppose that is a CQROFPG having no weak edges. The CQROFDG of is the family of , and it contained no crossing between any edge. Consider that are strong CQROFFs of . By using the definition of CQROFDG, the degrees of truth and falsity of CQROF edges of the CQROFDG are given asThis represents is an edge bordered by strong CQROFFs and . The number of common edges in the surrounding between and is , where The two CQROFGs and have the same number of CQROF edges, as there are no weak edges in . Hence, there is a CQROF edge in , for every CQROF edge of , with the same degree of truth and falsity.

6. Isomorphism between Two Complex QROF Planar Graphs

In this section, we study the isomorphism in CQROFPGs and establish some results to discuss the isomorphic, weak, and coweak isomorphic relations. Each concept is supported by an example.

Definition 21. Let us consider two QROFGs and . A mapping is called homomorphism defined by such that(i)(ii)An isomorphic relation between two graphs tells us about the nature of the graph in case we know the properties of one graph. An isomorphism can be established between two CQROFPGs if they have equal division. In our next discussion, we aim to study isomorphisms and their relevant notions in CQROFPGs.

Definition 22. An isomorphism is a bijective mapping of two CQROFPGs and defined by given as(i), (ii) To illustrate the isomorphism of CQROFPGs, we consider Example 9.

Example 9. Consider two CQROFPGs and , shown in Figure 7, are isomorphic to each other by the mapping defined by , , , and satisfying the following axioms:where
Therefore, is isomorphic to .

(a)

(b)

Definition 23. A bijective function mapping of two CQROFPGs and is called weak isomorphism, explained by in the following form:(i) is a homomorphism(ii)

Example 10. Consider two CQROFPGs and , shown in Figure 8, are weak isomorphic to each other by the mapping explained by , , , , and satisfying the following conditions:but So, there is a weak isomorphism between and

(a)

(b)

Definition 24. A bijective mapping of two CQROFPGs and is called a coweak isomorphism defined by as(i) is a homomorphism(ii) and

Example 11. Two CQROFPGs and , shown in Figure 9, are coweak isomorphic to each other by the mapping defined by , , , and satisfying the following conditions:but, where So, is coweak isomorphic to

(a)

(b)

Theorem 5. If a CQROPG is isomorphic to a CQROFG by an isomorphism , then has the same PI as .

Proof. Let be an isomorphism. Hence, the degrees of truth and falsity of and will be equal which establishes a similarity of with . Hence, the PI and the number of cut points between the edges of and will be similar. Thus, is said to have the same PI as .

Theorem 6. Let and be the CQROF planarity of two CQROFPGs and , respectively. If is weak isomorphic to , then and (for amplitude terms) and and (for amplitude terms).

Proof. Let be weakly isomorphic to . Then, there exist , for each edge . The strength of an edge is given asThen, due to weak isomorphism,Now, between two edges and , the cut point value isAlso,(i) (for amplitude terms)(ii) (for phase terms)In , the cut point in the edges and is . Now, the PI is given asSince and are weak isomorphic to each other, in the certain structural graphical representation of and , the number of cut points is equal. Hence, and (for amplitude terms) and and (for phase terms).

Theorem 7. Consider , a CQROFDG of a CQROFDG , and denote a CQROFDG of a CQROFDG . A coweak isomorphism between and exists if has no weak edge.

Proof. Consider a CQROPG with no weak edge in it. Suppose that is a CQROFDG of and is a CQROFDG of . Let denote the strong CQROFFs of and and denote the number of vertices of and . Then, and imply that . Furthermore, by the definition of duality, the truth and falsity degrees of an edge in CQROFDG and CQROFPG are equal. So, a coweak isomorphism between and exists.
Example 12 is given to support the result in Theorem 7.

Example 12. In this example, the CQROFDGs , and are depicted as in Figures 10–12, respectively. These CQROFGs shown verify the result discussed in Theorem 7 and establish a coweak isomorphism between and .

7. Application

In this section, we present an application of the CQROFPGs in electric networks to reduce the short circuits. We used the idea of CQROFPGs to analyze the short-circuit problem based on the planarity of the graph network. We assumed a problem of electricity supply from grid stations using CQROFPGs given below.

Grid stations are the main resources of power supply to our houses that use several lines (known as power lines) that are present throughout our city and streets. The supply lines carry a huge amount of voltage, and to convert it to low voltage, the transformers are used. The transformers consist of various units which further consist of small, tiny wires responsible for the carriage of current. During current flow, sometimes a crossing occurs between the small wires while connecting various units. In a very limited time duration, often the voltage becomes so high that leads to short circuits that are very harmful to the electrical appliances in our houses. The short circuits can be reduced by arranging the wires in a way where the number of crossing needs to be less enough. We use the idea of CQROFPGs to deal with such problems for reducing the number of crossing. A brief algorithm for reducing the edge crossing in the setting of CQROFPGs followed by practical Example 13 is given below.

7.1. Algorithm

This algorithm is to reduce the edge-crossing between nodes. The algorithms involve information in the form of CQROFPGs and use to the concept of strength, values of cut points, and PI in a network. The steps of the algorithm are as follows:(i)Let the units (nodes) be denoted by and the connection (edges) be denoted by and denote the cut points(ii)This step involves the computation of the strength of edges i.e., . (iii)This involves the computation of junction points between edges .,where and (iv)evaluate the planarity value using (v)If and give no crossing, then we keep the formation of such edges as it is; otherwise, we alter the representation of such edges until the crossing is reduced(vi)By changing the layout of the and , the intersection becomes minimum and the PI gets maximized

Example 13. Let us assume a layout of units in the transformer, as depicted in Figure 13. The nodes represent units , and the connections between units are represented by edges, as shown in Figure 13.
At the unit , we assume that the chances for a low spark are and those for a high spark are . Similarly, in the case of phase terms, suppose that, in a specific time, the chances for a low spark are and those for a high spark are . This can be viewed asFor the rest of the nodes, we haveNow, if there is a connection between the units and , then it will be presented by an edge of the vertices and . is given as . The rest of the edges are similarly portrayed in Figure 13. In an edge , the chances for a low spark are 41% and 59% for a high spark denoted by both amplitude terms of the truth and falsity degrees. Similarly, the phase terms of 31% and 54% show the chances for minimum and maximum destruction, respectively. A direct proportion exists between the rates of destruction and the number of cut points. We measure PI for further analysis. The number of cut points between the pair of wires , , , , and is denoted by , and , respectively. The strengths of wires areThe values of cut points areThus, CQROF PI is . A low PI shows a high rate of destruction. To lower the crossings, a modified CQROFG is developed in Figure 14. As an inverse relationship exists between the PI and the number of intersections which means that reducing the intersection points increases the PI and decreases the destruction rate, there is only one crossing in Figure 14 which is irreducible. Therefore, a reduction in the destruction rate and chances of the electric sparks can be achieved by using reasonable quality wires , and and a clearer connection between components in the transformer. This will make the crossing less damaging. This concludes that, for lower destruction that can occur at any time, an electrical model based on CQROF information can be adapted.

8. Comparative Study

In this segment, we illustrate a comparison of the results discussed in this paper with those already established. A brief comparative analysis of the current work with previous studies is discussed pointwise as follows:(1)The work in [36, 38] discusses only one aspect of the vague information with the help of truth degree which leads to the loss of information as the falsity degree is ignored and results might not be effective.(2)The concept of planarity discussed in [39] illustrates PI in an uncertain environment with the help of truth and falsity degrees of an IFS which have certain restraints on the falsity and truth degrees of the objects and, hence, cannot be used smoothly.(3)The PI and its relevant theories and application in the setting of PyFG are discussed in [40] where a larger space for assigning the falsity and truth degrees is provided, but still, some have limitations when it comes to defining nodes and edges under some specific restraints of PyFGs.(4)Complex falsity and truth degrees are adapted to analyze the theory and results based on PI of CPyFGs. Application of the PI of the CPyFG is also analyzed in [41]. The work in [41] is considered to be more general than the work in [36, 38, 39]. In the setting of CPyFGs, one has an edge by describing the uncertain information with the help of two complex membership grades, but it has restraint on the grades due to which it becomes inapplicable in some cases.(5)The current study involves complex truth and falsity degrees associated with a variable parameter that only produces flexibility in taking the complex truth and falsity degrees but can describe the opinion with the help of two kinds of grades that enhance the representation of the uncertain information.

9. Conclusions

In this script, we presented a theory related to the CQROFPG keeping in mind its usefulness. We discussed planarity in the setting of CQROFGs where an example is given to support each concept. An algorithm to study a short-circuit problem is developed. A summary of our research is given as follows:(1)We developed the notions of CQROFR, which leads to the concept of CQROFG. We also introduced the concept of CQROFMS which leads to the concept of CQROFMG. Some examples are given to support the theory.(2)We introduced the planar graphs in the environment of CQROFGs by introducing the notion of CQROFPGs. The notion of strength and PI is developed and exemplified. The concepts of effective edges are described along with related results.(3)We extended our study to develop the notion of faces and dual graphs in the environment of CQROFPGs by developing the concepts of CQROFDGs and CQROFFs. An analysis of the strength and weaknesses of the faces is set up. The proposed concepts are supported with examples.(4)We further establish a comprehensive study on isomorphism in the context of CQROFPGs and discussed the notions of coweek and weak isomorphisms. A few results on the isomorphisms of the CQROFPGs are also investigated.(5)An application of the CQROFPGs in solving a short-circuit problem is investigated to see the effectiveness of the proposed work. A practical example is taken to illustrate the applicability of the newly established results in short-circuit problems.(6)A comparative investigation of the current work is set up with previously established results to show the superiority of the current work.(7)In the near future, we aim to extend our study of CQROFGs by defining several other relevant terms and notions and to study the applicability of the study in shortest path problems, social network problems, etc. This study when extended to the frame of T-spherical fuzzy graphs [43, 44] can give us flexible and more accurate results.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare no conflicts of interest about the publication of this research article.

Acknowledgments

The authors are grateful to the Deanship of Scientific Research, King Saud University, for funding through Vice Deanship of Scientific Research Chairs.

References

K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets and Systems, vol. 20, no. 1, pp. 87–96, 1986.
View at: Publisher Site | Google Scholar
L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338–353, 1965.
View at: Publisher Site | Google Scholar
R. R. Yager, “q- fuzzy subsets,” in Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS) 2013, pp. 57–61, Edmonton, Alberta, Canada, June 2013.
View at: Google Scholar
R. R. Yager, “Generalized orthopair fuzzy sets,” IEEE Transactions on Fuzzy Systems, vol. 25, no. 5, pp. 1222–1230, 2017.
View at: Publisher Site | Google Scholar
M. I. Ali, “Another view on q-Rung orthopair fuzzy sets,” International Journal of Intelligent Systems, vol. 33, no. 11, pp. 2139–2153, 2018.
View at: Publisher Site | Google Scholar
P. Liu and P. Wang, “Some q-Rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making,” International Journal of Intelligent Systems, vol. 33, no. 2, pp. 259–280, 2018.
View at: Publisher Site | Google Scholar
P. Wang, J. Wang, G. Wei, and C. Wei, “Similarity measures of q-rung orthopair fuzzy sets based on cosine function and their applications,” Mathematics, vol. 7, no. 4, p. 340, 2019.
View at: Publisher Site | Google Scholar
G. Wei, H. Gao, and Y. Wei, “Some q-Rung orthopair fuzzy Heronian mean operators in multiple attribute decision making,” International Journal of Intelligent Systems, vol. 33, no. 7, pp. 1426–1458, 2018.
View at: Publisher Site | Google Scholar
M. Riaz and M. R. Hashmi, “Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems,” Journal of Intelligent & Fuzzy Systems, vol. 37, no. 4, pp. 5417–5439, 2019.
View at: Publisher Site | Google Scholar
M. Riaz, N. Çağman, I. Zareef, and M. Aslam, “N-soft topology and its applications to multi-criteria group decision making,” Journal of Intelligent & Fuzzy Systems, vol. 36, no. 6, pp. 6521–6536, 2019.
View at: Publisher Site | Google Scholar
D. Ramot, R. Milo, M. Friedman, and A. Kandel, “Complex fuzzy sets,” IEEE Transactions on Fuzzy Systems, vol. 10, no. 2, pp. 171–186, 2002.
View at: Publisher Site | Google Scholar
A. M. D. J. S. Alkouri and A. R. Salleh, “Complex intuitionistic fuzzy sets,” AIP Conference Proceedings, vol. 1482, no. 1, pp. 464–470, 2012.
View at: Publisher Site | Google Scholar
K. Ullah, T. Mahmood, Z. Ali, and N. Jan, “On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition,” Complex & Intelligent Systems, vol. 6, no. 1, pp. 15–27, 2020.
View at: Publisher Site | Google Scholar
P. Liu, T. Mahmood, and Z. Ali, “Complex q-Rung orthopair fuzzy aggregation operators and their applications in multi-attribute group decision making,” Information, vol. 11, no. 1, p. 5, 2020.
View at: Publisher Site | Google Scholar
P. Liu, M. Akram, and A. Sattar, “Extensions of prioritized weighted aggregation operators for decision-making under complex q-Rung orthopair fuzzy information,” Journal of Intelligent and Fuzzy Systems, vol. 39, no. 5, pp. 7469–7493, 2020.
View at: Publisher Site | Google Scholar
N. Jan, K. Ullah, T. Mahmood et al., “Some root level modifications in interval valued fuzzy graphs and their generalizations including neutrosophic graphs,” Mathematics, vol. 7, no. 1, p. 72, 2019.
View at: Publisher Site | Google Scholar
P. Liu, S. M. Chen, and P. Wang, “Multiple-attribute group decision-making based on q-Rung orthopair fuzzy power maclaurin symmetric mean operators,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 50, no. 10, pp. 3741–3756, 2018.
View at: Publisher Site | Google Scholar
P. Liu and P. Wang, “Multiple-attribute decision-making based on Archimedean Bonferroni operators of q-Rung orthopair fuzzy numbers,” IEEE Transactions on Fuzzy Systems, vol. 27, no. 5, pp. 834–848, 2018.
View at: Publisher Site | Google Scholar
I. Yusuf, S. Umar, and K. Suleiman, “Analysis of structural failures,” Building Bridges, vol. 3, no. 4, pp. 11–31, 2020.
View at: Publisher Site | Google Scholar
K. Ullah, T. Mahmood, and H. Garg, “Evaluation of the performance of search and rescue robots using T-spherical fuzzy Hamacher aggregation operators,” International Journal of Fuzzy Systems, vol. 22, no. 2, pp. 570–582, 2020.
View at: Publisher Site | Google Scholar
P. Talukdar, S. Goala, P. Dutta, and B. Limboo, “Fuzzy multicriteria decision making in medical diagnosis using an advanced distance measure on linguistic Pythagorean fuzzy sets,” Annals of Optimization Theory and Practice, vol. 3, no. 4, pp. 113–131, 2020.
View at: Publisher Site | Google Scholar
H. Garg, K. Ullah, T. Mahmood, N. Hassan, and N. Jan, “T-spherical fuzzy power aggregation operators and their applications in multi-attribute decision making,” Journal of Ambient Intelligence and Humanized Computing, pp. 1–14, 2021.
View at: Publisher Site | Google Scholar
N. Jan, L. Zedam, T. Mahmood, and K. Ullah, “Cubic bipolar fuzzy graphs with applications,” Journal of Intelligent & Fuzzy Systems, vol. 37, no. 2, pp. 2289–2307, 2019.
View at: Publisher Site | Google Scholar
S. Zeng, Y. Hu, T. Balezentis, and D. Streimikiene, “A multi‐criteria sustainable supplier selection framework based on neutrosophic fuzzy data and entropy weighting,” Sustainable Development, vol. 28, no. 5, pp. 1431–1440, 2020.
View at: Publisher Site | Google Scholar
A. Rosenfeld, “Fuzzy graphs,” in Fuzzy Sets and their Applications to Cognitive and Decision Processes, pp. 77–95, Academic Press, Cambridge, MA, USA, 1975.
View at: Google Scholar
R. Parvathi and M. G. Karunambigai, “Intuitionistic fuzzy graphs,” in Computational Intelligence, Theory and Applications, pp. 139–150, Springer, Berlin, Germany, 2006.
View at: Google Scholar
R. Parvathi, M. G. Karunambigai, and K. T. Atanassov, “Operations on intuitionistic fuzzy graphs,” in Proceedings of the FUZZ-IEEE 2009, IEEE International Conference on Fuzzy Systems, pp. 1396–1401, Jeju Island, Korea, August 2009.
View at: Google Scholar
M. Akram, A. Habib, F. Ilyas, and J. Dar, “Specific types of Pythagorean fuzzy graphs and application to decision-making,” Mathematical and Computational Applications, vol. 23, no. 3, p. 42, 2018.
View at: Publisher Site | Google Scholar
A. Habib, M. Akram, and A. Farooq, “Q-rung orthopair fuzzy competition graphs with application in the soil ecosystem,” Mathematics, vol. 7, no. 1, p. 91, 2019.
View at: Publisher Site | Google Scholar
A. Luqman, M. Akram, and A. N. Al-Kenani, “q-rung orthopair fuzzy hypergraphs with applications,” Mathematics, vol. 7, no. 3, p. 260, 2019.
View at: Publisher Site | Google Scholar
P. Thirunavukarasu, R. Suresh, and K. K. Viswanathan, “Index,” Insight into Fuzzy Modeling, vol. 10, no. 1, pp. 243–248, 2016.
View at: Publisher Site | Google Scholar
N. Yaqoob, M. Gulistan, S. Kadry, and H. A. Wahab, “Complex intuitionistic fuzzy graphs with application in cellular network provider companies,” Mathematics, vol. 7, no. 1, p. 35, 2019.
View at: Publisher Site | Google Scholar
M. Akram and S. Naz, “A novel decision-making approach under complex Pythagorean fuzzy environment,” Mathematical and Computational Applications, vol. 24, no. 3, p. 73, 2019.
View at: Publisher Site | Google Scholar
M. Akram and A. Khan, “Complex Pythagorean Dombi fuzzy graphs for decision making,” Granular Computing, vol. 6, pp. 645–669, 2021.
View at: Publisher Site | Google Scholar
M. Akram and A. Sattar, “Competition graphs under complex Pythagorean fuzzy information,” Journal of Applied Mathematics and Computing, vol. 63, no. 1, pp. 543–583, 2020.
View at: Publisher Site | Google Scholar
S. Samanta and M. Pal, “Fuzzy planar graphs,” IEEE Transactions on Fuzzy Systems, vol. 23, no. 6, pp. 1936–1942, 2015.
View at: Publisher Site | Google Scholar
T. Pramanik, S. Samanta, and M. Pal, “Interval-valued fuzzy planar graphs,” International Journal of Machine Learning and Cybernetics, vol. 7, no. 4, pp. 653–664, 2016.
View at: Publisher Site | Google Scholar
S. Samanta, M. Pal, and A. Pal, “New concepts of fuzzy planar graph,” International Journal of Advanced Research in Artificial Intelligence, vol. 3, no. 1, pp. 52–59, 2014.
View at: Publisher Site | Google Scholar
N. Alshehri and M. Akram, “Intuitionistic fuzzy planar graphs,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 397823, 2014.
View at: Publisher Site | Google Scholar
M. Akram, J. Dar, and A. Farooq, “Planar graphs under Pythagorean fuzzy environment,” Mathematics, vol. 6, no. 12, p. 278, 2018.
View at: Publisher Site | Google Scholar
M. Akram, A. Bashir, and S. Samanta, “Complex pythagorean fuzzy planar graphs,” International Journal of Applied and Computational Mathematics, vol. 6, pp. 1–27, 2020.
View at: Publisher Site | Google Scholar
M. Akram, A. Sattar, and A. B. Saeid, “Competition graphs with complex intuitionistic fuzzy information,” Granular Computing, pp. 1–23, 2021.
View at: Publisher Site | Google Scholar
T. Mahmood, K. Ullah, Q. Khan, and N. Jan, “An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets,” Neural Computing and Applications, vol. 31, no. 11, pp. 7041–7053, 2019.
View at: Publisher Site | Google Scholar
A. Guleria and R. K. Bajaj, “T-spherical fuzzy graphs: operations and applications in various selection processes,” Arabian Journal for Science and Engineering, vol. 45, no. 3, pp. 2177–2193, 2020.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2021 Abrar Hussain et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

506

Downloads

779

Citations