TY - JOUR
T1 - Innovative approaches to (,)-rung orthopair fuzzy graphs for enhancing performance measures
AU - Al-Shami, Tareq M.
AU - Ibrahim, Hariwan Z.
AU - Nuwairan, Muneerah A.L.
AU - Mhemdi, Abdelwaheb
N1 - Publisher Copyright:
© The Author(s) under exclusive licence to Korean Society for Informatics and Computational Applied Mathematics 2025.
PY - 2025
Y1 - 2025
N2 - Graph construction is a powerful tool for solving complex problems across various fields of computer science and computational intelligence. When dealing with uncertainty, fuzzy graph structures are preferred over crisp graph structures, as they effectively represent the inherent uncertainty within a network. To better capture vague and imprecise concepts, the (,)-rung orthopair fuzzy set serves as a highly effective framework, as its models provide greater flexibility than other fuzzy models when handling human judgment data. In this paper, we introduce a new framework, referred to as (,)-rung orthopair fuzzy graphs ((,)-ROFGs), by integrating the concept of graphs with (,)-rung orthopair fuzzy sets. The key advantage of this framework is that it meets the demands of certain applications that cannot be effectively modeled using previous approaches to handling uncertainty, as they either require equal degrees of uncertainty (such as IFSs, PFSs, and q-ROFSs) or impose restrictions on the powers of uncertainty degrees through fixed parameter values and (as in (2,1)-FSs and (3,2)-FSs). We start by introducing the degree and whole degree of a vertex in (,)-ROFGs, and illustrate their significance using road networks. Understanding the degree and whole degree of a vertex also provides insight into the characteristics of product operations on (,)-ROFGs. Building on this, we define the strong product and -product as product operations on (,)-ROFGs. These operations become particularly useful when dealing with a large number of (,)-ROFGs. We also introduce the concept of vertex degree and whole degree in the strong product and -product, and establish general theorems concerning the degree and whole degree of (,)-ROFGs under the proposed product operations, and provide several numerical examples to illustrate the introduced concepts. Furthermore, we explore an application of the degree and whole degree of the -product of two (,)-ROFGs in multi-criteria decision-making concerning the selection of the most likely team to compete in games and using optimal performance measures. Finally, we make comparisons to highlight the shortcomings of previous techniques in modeling certain practical cases that are effectively addressed by our approach, as well as we discuss the minor limitations of the proposed method associated with excessively large values of and that can generally be mitigated by selecting moderate settings that better reflect typical decision-making contexts.
AB - Graph construction is a powerful tool for solving complex problems across various fields of computer science and computational intelligence. When dealing with uncertainty, fuzzy graph structures are preferred over crisp graph structures, as they effectively represent the inherent uncertainty within a network. To better capture vague and imprecise concepts, the (,)-rung orthopair fuzzy set serves as a highly effective framework, as its models provide greater flexibility than other fuzzy models when handling human judgment data. In this paper, we introduce a new framework, referred to as (,)-rung orthopair fuzzy graphs ((,)-ROFGs), by integrating the concept of graphs with (,)-rung orthopair fuzzy sets. The key advantage of this framework is that it meets the demands of certain applications that cannot be effectively modeled using previous approaches to handling uncertainty, as they either require equal degrees of uncertainty (such as IFSs, PFSs, and q-ROFSs) or impose restrictions on the powers of uncertainty degrees through fixed parameter values and (as in (2,1)-FSs and (3,2)-FSs). We start by introducing the degree and whole degree of a vertex in (,)-ROFGs, and illustrate their significance using road networks. Understanding the degree and whole degree of a vertex also provides insight into the characteristics of product operations on (,)-ROFGs. Building on this, we define the strong product and -product as product operations on (,)-ROFGs. These operations become particularly useful when dealing with a large number of (,)-ROFGs. We also introduce the concept of vertex degree and whole degree in the strong product and -product, and establish general theorems concerning the degree and whole degree of (,)-ROFGs under the proposed product operations, and provide several numerical examples to illustrate the introduced concepts. Furthermore, we explore an application of the degree and whole degree of the -product of two (,)-ROFGs in multi-criteria decision-making concerning the selection of the most likely team to compete in games and using optimal performance measures. Finally, we make comparisons to highlight the shortcomings of previous techniques in modeling certain practical cases that are effectively addressed by our approach, as well as we discuss the minor limitations of the proposed method associated with excessively large values of and that can generally be mitigated by selecting moderate settings that better reflect typical decision-making contexts.
KW - (,)-rung orthopair fuzzy graphs
KW - Fuzzy graphs
KW - Fuzzy optimization
KW - Performance measures
UR - http://www.scopus.com/inward/record.url?scp=105008876421&partnerID=8YFLogxK
U2 - 10.1007/s12190-025-02529-6
DO - 10.1007/s12190-025-02529-6
M3 - Article
AN - SCOPUS:105008876421
SN - 1598-5865
JO - Journal of Applied Mathematics and Computing
JF - Journal of Applied Mathematics and Computing
ER -