Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2023 Oct 9;13:17027. doi: 10.1038/s41598-023-43922-0

On t-intuitionistic fuzzy graphs: a comprehensive analysis and application in poverty reduction

Asima Razzaque 1,, Ibtisam Masmali 2, Laila Latif 3, Umer Shuaib 3,, Abdul Razaq 4, Ghaliah Alhamzi 5, Saima Noor 1
PMCID: PMC10562496  PMID: 37813866

Abstract

This paper explains the idea of t-intuitionistic fuzzy graphs as a powerful way to analyze and display relationships that are difficult to understand. The article also illustrates the ability of t-intuitionistic fuzzy graphs to establish complex relationships with multiple factors or dimensions of a physical situation under consideration. Moreover, the fundamental set operations of t-intuitionistic fuzzy graphs are proposed. The notions of homomorphism and isomorphism of t-intuitionistic fuzzy graphs are also introduced. Furthermore, the paper highlights a practical application of the proposed technique in the context of poverty reduction within a specific society. By employing t-intuitionistic fuzzy graphs, the research demonstrates the potential to address the multifaceted nature of poverty, considering various contributing factors and their interdependencies. This application showcases the versatility and effectiveness of t-intuitionistic fuzzy graphs as a tool for decision-making and policy planning in complex societal issues.

Subject terms: Engineering, Mathematics and computing

Introduction

Decision-making is essential to all aspects of existence. This also pertains to organizations. It is one of the most important factors in determining its success or failure. Every manager must make decisions throughout the management cycle, from planning to control. The level of a manager's success is influenced by the efficacy and caliber of his or her decisions. Without being able to make decisions, managers can't do their other jobs, like planning, organizing, supervising, controlling, and staffing. The decision-making process should be cumulative, consultative, and conducive to organizational growth. Fuzzy decision-making environments offer strategies for handling ambiguity and vagueness based on uncertainty. Ambiguity is a type of uncertainty in which it seems possible to choose more than one option from a list of options. It has been shown that fuzzy set theory (FST) is a good way to describe situations where the data are not clear or precise. A fuzzy set can handle this by giving each object in a set a certain amount of membership. In reality, however, a person may suppose that an object "x" belongs to a set A to a certain degree, yet not be entirely convinced. In other words, there may be hesitancy or uncertainty about “x” degree of participation in A. In FST, there is no way to account for this uncertainty in membership degrees. Zadeh1 devised a mathematical method called fuzzy set theory (FST) to deal with information that comes from computational perception. This information is imprecise, unclear, ambiguous, vague, or doesn't have clear limits. Since its acceptance, this idea has been utilized in numerous technical and scientific domains. The FST has been used successfully in consumer electronics, control systems, image processing, knowledge-based systems, robotics, industrial automation, artificial intelligence, and consumer electronics. This theory has also been used in many areas of operations research, such as project management, decision theory, supply chain management, queue theory, and quality control. Mapari and Naidu2 studied some properties of FS and discussed their application Some introductory texts in this field were written by Kandel3, Klir and Yuan4, Mendel5, and Zimmermann6.

The intuitionistic fuzzy set (IFS) generalizes the fuzzy set because the indicator function of the FS is a particular case of the membership function and non-membership function of the IFS. Atanassov7 introduced IFS as an extension of Zadeh's idea of fuzzy set, which itself is an extension of the traditional idea of a set. These sets are quite helpful in offering a flexible approach for elaborating the uncertainty and ambiguity inherent in decision making. De et al.8 presented the IFS operations and also demonstrated their various features. Several important aspects of the newly introduced operations on IFS were investigated in9. The IFS is an essential subject in fuzzy mathematics due to its vast range of real-world applications, including pattern recognition, machine learning, decision making, and market forecasting. Ejegwa et al.10 provided a clear and complete overview of various IFS models in real-world scenarios. Burillo et al.11 proposed the concept of intuitionistic fuzzy number (IFN). The IFN is a more general platform for communicating vague, incomplete, or contradictory information while solving multi-criteria decision-making problems and for expressing and reflecting evaluation information across multiple dimensions. Faizi et al.12 applied the concept of IFS in multi criteria group decision making. Dai et al.13 developed an intuitionistic fuzzy concept-oriented three-way decision model to tackle the ranking and classification problem in intuitionistic fuzzy multi-criteria contexts with the decision-maker's preference. Das et al.14 suggested a productive method for group MCDM based on intuitionistic multi-fuzzy set theory. These sets have been utilized in MCDM significantly more recently in1522. In imaging applications, the enhancement of pictures with weak edges presents significant difficulties. Based on IFS, Liu et al.23 developed a novel image enhancement technique. While color photographs give more information than grayscale images, segmenting color images is a task that is still in progress. The analysis of biomedical images is especially beneficial for numerous purposes. Bouchet et al.24 presented a method for the segmentation of leukocytes. This method combines the use of RGB color space, IFS, and K-means clustering. Cagman and Karatas25 introduced the operation and application of intuitionistic fuzzy soft sets (IFSS). Ali et al.26 defined the aggregation operator for complex IFSS and developed their associated properties. Jabir et al.27 proposed algorithms based on a generalized IFSS and also showed the supremacy of the given methods. Bashir et al.28 introduced the possibility of IFSS and associated operations. The interval-valued IFSS theory was initiated by Jiang et al.29. A definition of a Hausdorff distance-based similarity measure between IFSS and its potential application in medical diagnosis were given in30. Deli and Karats31 established the concept of interval-valued intuitionistic fuzzy parameterized soft sets. They presented a decision-making method based on this notion in32. One of the most recent approaches to dealing with imprecision is the Pythagorean fuzzy set (PFS). These sets generalize IFS and have a wider range of uses, which inspires research into their applicability to the problem of career placement. Abdullah et al.33 depicted the Choquet integral operator based on PFSs. Fuzzy measures can be used to account for how parts of PFSs interact with each other.

A graph is a convenient method for describing data containing object relationships. Relationships are represented by edges and objects by vertices. It is commonly known that graphs are simple representations of relations. Graph theory provides a useful instrument for quantifying and simplifying the numerous moving pieces of dynamic systems. Mathematical chemistry examines the structure of molecules using mathematical methods. Molecular descriptors serve a key role in mathematical chemistry. As a field of study, chemical graph theory shows how chemistry, graph theory, and math are related. A molecular graph is a graph that represents the atoms and bonds of a compound via vertices and edges. With its vertices and edges, the graph makes it easy to see how different things are related to each other. Creating a “Fuzzy Graph Model” may be necessary to clarify the situation if there is any ambiguity in the description of objects or their relationships. They must deal with uncertain situations, and more information requires some high-potential tools. The graph is one such mathematical tool which effectively deals with extensive data. Fuzzy graph is a tool that needs to be used when uncertain factors exist. Rosenfeld34 took the first step into the field of fuzzy graph. Mordeson and Chang-Shyh35 discussed certain fuzzy graph operations. Bhattacharya36 proved several graph theoretic results for fuzzy graph. Bhutani37 worked on automorphisms of fuzzy graph. The fuzzy graph is used in a wide range of scientific and engineering fields, such as broadcast communications, production, social networks, artificial intelligence, data hypotheses, and neural systems. The study of fuzzy graph led many researchers to contribute in this fields. Pathinathan et al.38 initiated the idea of hesitant fuzzy graph. Javaid et al.39 proposed numerous operations on hesitant fuzzy graphs. Moreover, Akram and Saira40 introduced the notion of fuzzy soft graphs and they also presented the applications of fuzzy soft graphs in social and road networks41. Ali et al.42 initiated the complex q-rung orthopair fuzzy planar graph theory. Kifayat et al.43 explored the ideas of complex q-rung orthopair fuzzy k-competition, complex q-rung orthopair fuzzy p-competition, and complex q-rung orthopair fuzzy neighborhoods. Fuzzy graphs have been applied to many practical situations like optimization problems44,45, clustering46 and social networks47. Intuitionistic fuzzy graphs (IFG) provide a more accurate representation of human thinking and decision-making processes. Individuals frequently need clarification about the precise acceptance or rejection of an element inside a particular set. The IFG and intuitionistic fuzzy relations were introduced by Shannon and Atanassov48 and they also looked into some of their characteristics49. Karunambigai and Atanassov50 studied operations on IFG. Gani and Begum51 discussed the size, order and degree of IFG. Sundas and Akram52 described the application of an intuitionistic fuzzy soft graph to a problem involving decision-making. Yaqoob et al.53 developed the complex intuitionistic fuzzy graph theory. Abida and Faryal54 classified the fundamental operations as direct, semi-strong, strong, and modular products for complex intuitionistic fuzzy graphs. Nandhinii and Amsaveni55 proposed a bipolar complex intuitionistic fuzzy graph. Furthermore, the literature has extensively examined many principles and applications of IFG and their expansions, as evidenced by the works cited in references5659. The theory of t-IFS was initiated by Sharma in60.

The t-IFS has shown advantages in handling vagueness and uncertainty compared to intuitionistic fuzzy set. It's a good strategy because it gives a flexible way to deal with the uncertainty and ambiguity that come with making decisions. The t-Intuitionistic fuzzy models are becoming more useful because they try to close the gap between traditional numerical models used in engineering and the sciences and symbolic models used in expert systems. The theory of IFG serves as a valuable tool for delineating and clarifying complex and indeterminate matters that arise in practical contexts. This phenomenon can be attributed to its ability to effectively communicate the inherent characteristics of unpredictability, complexity, imprecision, and uncertainty connected with the things encompassed inside these sets. However, it is necessary to rewrite these approaches using specific numerical values to effectively handle the practical concerns related to membership and non-membership functions. To overcome this constraint, we presented the concept of a t-IFG, which utilizes linear t-norm and t-conorm operators. The need for a systematic and adaptable methodology to effectively handle ambiguity and enable decision-making under the guidance of pre-established criteria led to the adoption of the t-IFG. In this context, the utilization of the parameter ‘t’ facilitates the simplification of the procedure by specifying particular criteria for identifying the degree of membership or non-membership. In many practical scenarios, it becomes imperative to make judgments contingent on different levels of confidence. Introducing the parameter ‘t’ in the t-IFG aims to overcome the constraints of the IFG. This parameter offers precise control over stringency, enhances customization, allows for separate thresholds for decision-making, enhances flexibility, and reduces ambiguity. The benefits above render the t-IFG a very effective technique for depicting uncertainty and facilitating well-informed decision-making in contexts that necessitate a tailored and regulated approach to uncertainty management. The t-IFG facilitates the understanding and manipulation of complex decision environments in situations where traditional IFG is insufficient. The role of complicated, ambiguous interactions is essential in the context of decision-making challenges. These graphs thoroughly describe the complex interplay between input and output variables, offering decision-makers powerful tools for analyzing and assessing different choices. Complicated fuzzy connections allow decision-makers to determine options comprehensively and systematically by considering various criteria and their interdependencies. This facilitates a holistic approach to addresses complex decision-making difficulties. The intricate technique represents a significant advancement in decision-making, particularly in situations characterized by membership, non-membership, and parameter t. It signifies a break from the limitations imposed by binary logic and paves the way for enhanced accuracy in decision-making processes.

The subsequent motivation for organizing research is presented:

  • The primary motivation for using t-IFG is their capacity to effectively handle intricate uncertainty scenarios characterized by hesitant and fluctuating interactions between elements.

  • By including the "t" parameter, these graphs offer a framework for assessing and modeling diverse levels of uncertainty and confidence in connections.

  • Incorporating t-norms and t-conorms provides a method for handling the combination and disjunction of uncertain information, designed explicitly for decision-making situations involving a wide range of inputs and outcomes in the real world.

  • This approach is employed in several fields, like decision analysis, risk assessment, and systems optimization, where the objective is to achieve a trade-off between unknown connections and practical value.

Integrating intuitionistic fuzzy logic, graph theory, and the parameter "t" gives rise to t-intuitionistic fuzzy graphs, which present a novel methodology. The following are the novelties of the present work:

  • The parameter denoted as "t" represents a threshold that indicates reluctance, enabling the creation of a new and organized representation of unclear connections.

  • Incorporating the "t" parameter can enhance the depiction of relationships, wherein the selection of edges and nodes is dependent upon keeping to a defined confidence level.

  • This methodology would provide a more precise differentiation between robust and delicate associations, enabling more systematic handling of ambiguity.

  • A t-IFG allows for incorporating multi-layered analysis, wherein different graph levels are associated with various parameter values “t”. By employing this approach, it would be possible to thoroughly examine the interconnections within the graph, taking into account different degrees of certainty. It facilitates a deeper understanding of the fundamental framework.

Our primary goals for this article are to make the following contributions:

  • Propose the idea of the t-IFG. This phenomenon is advantageous in that it offers a flexible paradigm for describing the uncertainty and ambiguity inherent in decision-making. Moreover, it plays a significant role in various disciplines such as computer science, economics, chemistry, medicine, and engineering.

  • Explore various set theoretical operations of t-IFG and prove many key properties of the newly defined operations. These operations enable the integration of information, the exploration of connections, and the facilitation of informed decision-making across various application domains.

  • Introduce the notions of homomorphism and isomorphism of t-IFG and demonstrate many newly defined key properties. This notion is used to improve the comfort of conducting comparative analysis and transmitting data in scenarios that include graph topologies that are unsure and hesitant.

  • Initiate the idea of the complement of a t-IFG and prove many vital properties of this notion. This notion of ambiguity exposes inverse relationships that may not be directly evident in the original graph. The applications of this technology encompass error detection, system verification, and decision analysis.

  • Identify the critical factors for reducing poverty in a certain society using the newly defined technique. This technique will help reduce poverty by improving representation, identifying susceptible groups, allocating resources, tracking, and evaluating progress, and formulating well-considered policies.

  • Explores the complexity and uncertainties of poverty, leading to an assessment of the causes, development, and impacts.

Following a brief discussion of the t-IFG, the rest of the paper is structured as follows: In “Preliminaries” section, some fundamental definitions are provided to help the reader to comprehend the originality of the work presented in this article. In "t-Intuitionistic Fuzzy Graph" section, the notion of t-IFG is introduced and various fundamental characteristics of this phenomenon are investigated. In "Operations on t-intuitionistic fuzzy graph" section, various set theoretical operations of t-IFG are explored and graphical representations of these operations are demonstrated. In “Isomorphism of t-intuitionistic fuzzy graphs” section, the concepts of homomorphisms and isomorphisms of t-IFG are established. In “Complement of t-intuitionistic fuzzy graph” section, the idea of complement of t-IFG is defined and many important key features of this notion are explored. In “Application of t-intuitionistic fuzzy graph” section, the newly defined strategy is applied to design a mechanism for the reduction of poverty in a certain society. Finally, some comparative analysis and concrete conclusions about the paper are summarized in “Comparative analysis” and “Conclusion” sections respectively.

The list of abbreviations used in this article is shown in the table below.

IFS Intuitionistic fuzzy set IFSS Intuitionistic fuzzy soft sets
IFN Intuitionistic fuzzy number MCDM Multi-criteria decision making
IFG Intuitionistic fuzzy graph t-IFS t-intuitionistic fuzzy set
PFS Pythagorean fuzzy set t-IFG t-intuitionistic fuzzy graph

Preliminaries

The fundamental concepts and definitions of t-IFS are explained in this section.

Definition 17

An IFS B of a universe U of the form: B={<u1,μBu1,σBu1>:u1U}, where μB and σB are the functions from universe U to 0,1, respectively, the membership and non-membership of an element u1 of the universe U respectively. These functions must satisfy the following condition: 0 μBu1+σBu11.

Definition 260

Let B be an IFS of a universal set U and t0,1. The IFS Bt of U is called a t-intuitionistic fuzzy set (t-IFS) and is defined as: μBtu1=min{μBu1,t} and σBtu1=maxσBu1,1-t,u1U. The value of τu1=1-μAtu1+σAtu1 is called the degree of hesitancy. The t-IFS is of the form: Bt=u1,μBtu1,σBtu1:u1U, where μBt and σBt are functions that assign degrees of membership and non-membership, respectively. Moreover, the functions μBt and σBt satisfy the condition: 0μBtu1+σBtu11.

Definition 348

Let G=V,E be a simple graph. A pair G=A,B is said to be an intuitionistic fuzzy graph (IFG) on graph G, where A=ui,μAui,σAui:uiV is an IFS on V and B={<ui,μBui,uj,σBui,uj>:ui,ujE} is an IFS on EV×V such that for every edge ui,ujE.

μBui,ujminμAui,μAujσBui,ujmaxσAui,σAuj

Satisfy the conditions: 0μAui+σAui1 and 0μBui,uj+σBui,uj1.

Definition 451

The order of IFG G is specified by:

OG=u1VμAu1,u1VσAu1

Definition 551

The degree of a vertex u1 in IFG G is given by:

degGu1=degμBu1,degσBu1=u1,u2EμBu1,u2,u1,u2EσBu1,u2

t-intuitionistic fuzzy graph

This section defines a t-intuitionistic fuzzy graph and explores various fundamental properties of this phenomenon.

Definition 6

Let G=A,B be an intuitionistic fuzzy graph (IFG) on a simple graph G=V,E. An IFG G is called a t-intuitionistic fuzzy graph (t-IFG) is denoted by Gt=At,Bt, where At=ui,μAtui,σAtui:uiV is a t-IFS on V and Bt=ui,uj,μBtui,uj,σBtui,uj:ui,ujE is a t-IFS on EV×V, such that for every edge ui,ujE.

μBtui,ujminμAtui,,μAtujσBtui,ujmaxσAtui,σAtuj

Satisfy the conditions: 0μAtui+σAtui1 and 0μBtui,uj+σBtui,uj1.

Here μAtui and σAtui represents the membership and non-membership degrees of nodes uiV. The terms μBtui,uj and σBtui,uj represents the membership and non-membership degrees of edges (ui,uj)E, respectively.

Example 1

Consider a graph G=V,E such that.

V=a,b,c,d,e,fandE=ab,ac,af,bc,cd,ce,de,ef.

The IFS A of V is given by:

A=a,0.8,0.2,b,0.9,0.1,c,0.5,0.4,d,0.7,0.2,e,0.6,0.4,f,0.8,0.1

The IFS B of E is given by:

B=ab,0.3,0.3,ac,0.5,0.4,af,0.6,0.3,bc,0.4,0.3,cd,0.5,0.3,ce,0.4,0.4,de,0.5,0.4,ef,0.6,0.3

The application of the Definition (2) on the two IFS A and B corresponding to the value t=0.70 gives that:

A0.70=a,0.7,0.3,b,0.7,0.3,c,0.5,0.4,d,0.7,0.3,e,0.6,0.4,f,0.7,0.3

and

B0.70=ab,0.3,0.3,ac,0.5,0.4,af,0.6,0.3,bc,0.4,0.3,cd,0.5,0.3,ce,0.4,0.4,de,0.5,0.4,ef,0.6,0.3

The graphical representation of 0.70- IFG G0.7=A0.7,B0.7 is displayed in Fig. 1.

Figure 1.

Figure 1

0.70-IFGG0.7.

Definition 7

A t-IFG Ht=At,Bt is said to be a t-intuitionistic fuzzy subgraph of t-IFG Gt=At,Bt if AtAt and BtBt.

Definition 8

A t-IFG Gt=At,Bt is said to be complete t-IFG if it admits the following conditions:

μBtu1,u2=minμAtu1,μAtu2σBtu1,u2=maxσAtu1,σAtu2,(u1,u2)E.

Example 2

Consider the complete 0.80-IFG Gt as depicted in Fig. 2.

Figure 2.

Figure 2

Complete 0.80-IFGG0.80.

Definition 9

Let Gt=At,Bt be a t-IFG, where At=μAt,σAt is a t-IFS on V and Bt=μBt,σBt is a t-IFS on EV×V. Then.

  1. The order of t-IFG Gt is defined as:
    OGt=u1VμAtu1,u1VσAtu1
  2. The size of t-IFG Gt is defined as:
    SGt=u1,u2EμBtu1,u2,u1,u2EσBtu1,u2

Example 3

The order of t-IFG Gt is 3.9,2. (see Example 1).

Proposition 1

Let Gt=At,Bt be a t-IFG, then SGtOGt.

Definition 10

Let Gt=At,Bt be a t-IFG on G=V,E, then:

  1. In t-IFGGt, the degree of a vertex u1 in Gt is defined as follows:
    degGtu1=degμBtu1,degσBtu1=u1,u2EμBtu1,u2,u1,u2EσBtu1,u2
  2. The minimum degree δGt of t-IFG Gt is given by:
    δGt=δμBtGt,δσBtGt=MindegμBtu1:u1V,MindegσBtu1:u1V
  3. The maximum degree ΔGt of Gt is defined as follows:
    ΔGt=ΔμBtGt,ΔσBtGt=MaxdegμBtu1:u1V,MaxdegσBtu1:u1V

Proposition 2.

In t-IFG Gt, then the following inequality holds:

δGtΔGtSGtOGt.

Example 4.

From Example 1, the degree of each vertex in Gt are:

degGta=1.4,1, degGtb=0.7,0.6, degGtc=1,8.1.4, degGtd=1,0.7, degGte=1.5,1.1, and degGtf=1.2,0.6.

Theorem 1.

Let Gt=At,Bt be any t-IFG, then:

degGtui=2μBtui,w,2σBtui,w

Proof.

Let Gt=At,Bt be a t-IFG.

Consider

degGtui=degμBtui,degσBtui

The application of the part (1) of Definition (9) to gives that:

=degμBtu1,degμBtu1+degμBtu2,degμBtu2++degμBtun,degμBtun=μBtu1,u2,σBtu1,u2+μBtu1,u3,σBtu1,u3++μBtu1,un,σBtu1,un+μBtu2,u1,σBtu2,u1+μBtu2,u3,σBtu2,u3++μBtu2,un,σBtu2,un++μBtun,u1,σBtun,u1+μBtun,u2,σBtun,u2++μBtun-1,un,σBtun-1,un=2μBtu1,u2,σBtu1,u2+2μBtu1,u3,σBtu1,u3++2μBtu1,un,σBtu1,un=2μBtui,w,2σBtui,w

Hence, it completes the proof.

Corollary 1.

In a t-IFG, the odd membership degree and the odd non-membership degree have an even number of vertices.

Corollary 2.

In a t-IFG, n-1 is the maximum degree of any vertex n.

Operations on t-intuitionistic fuzzy graph

This section explores the set-theoretical operations of t-IFG. We also establish and analyze the fundamental characteristics of these phenomena.

Definition 11.

Let G1t=At,Bt and G2t=At,Bt be any two t-IFG of G1=V,E and G2=V,E, respectively. The Cartesian product G1t×G2t of t-IFG G1t and G2t is defined by At×At,Bt×Bt, where At×At and Bt×Bt are t-IFS on V×V={u1,w1),(u2,w2:u1,u2Vw1,w2V} and E×E=u1,w1),(u2,w2:u1=u2,u1,u2V,w1,w2Eu1,w1),(u2,w2:w1=w2,w1,w2V,u1,u2Eu1,w1),(u2,w2:w1w2,w1,w2V,u1,u2E, respectively, which satisfies the following conditions:

  1. u1,w1V×V
    1. μAt×Atu1,w1=minμAtu1,μAtw1
    2. σAt×Atu1,w1=maxσAtu1,σAtw1
  2. If u1=u2 and w1,w2E
    1. μBt×Btu1,w1),(u2,w2=minμAtu1,μBtw1,w2
    2. σBt×Btu1,w1),(u2,w2=maxσAtu1,σBtw1,w2
  3. If w1=w2 and u1,u2E
    1. μBt×Btu1,w1),(u2,w2=minμBtu1,u2,μAtw1
    2. σBt×Btu1,w1),(u2,w2=maxσBtu1,u2,σAtw1

Example 5.

Consider the two 0.8-IFG G1t and G2t illustrated in Figs. 3 and 4.

Figure 3.

Figure 3

0.8-IFGG10.8.

Figure 4.

Figure 4

0.8-IFGG20.8.

Figure 5 shows their corresponding Cartesian product G10.8×G20.8:

Figure 5.

Figure 5

0.8-IFG of G10.8×G20.8.

Definition 12.

The degree of a vertex in G1t×G2t is defined as follows: for any u1,w1V×V.

degG1×G2u1,w1=degμBt×Btu1,w1),(u2,w2,degσBt×Btu1,w1),(u2,w2

where

degμBt×Btu1,w1),(u2,w2=u1=u2,w1,w2EminμAtu1,μBtw1,w2+w1=w2,u1,u2EminμBtu1,u2,μAtw1

and

degσBt×Btu1,w1),(u2,w2=u1=u2,w1,v2EmaxσAtu1,σBtw1,w2+w1=w2,u1,u2EmaxσBtu1,u2,σAtw1

Example 6.

According to Example 5, each vertex in G1t×G2t has the following degree:

degG1t×G2ta,u=0.3,1.3,degG1t×G2ta,v=0.5,1.9,degG1t×G2ta,w=0.3,1.3degG1t×G2tb,u=0.6,1.2,degG1t×G2tb,v=0.6,1.6,anddegG1t×G2tb,w=0.1,1.1.

Proposition 3.

The Cartesian product of two t-IFG is a t-IFG.

Proof.

The condition for At×At is self-explanatory. Let u1V and w1,w2E. Then:

μBtBtu1,w1),(u1,w2=minμAtu1,μBtw1,w2minμAtu1,minμAtw1,μAtw2minminμAtu1,μAtw1,minμAtu1,μAtw2=minμAt×Atu1,w1,μAt×Atu1,w2

Consequently μBtBtu1,w1),(u1,w2minμAt×Atu1,w1,μAt×Atu1,w2,ifu1V and w1,w2E.

Also

σBtBtu1,w1),(u1,w2=maxσAtu1,σBtw1,w2maxσAtu1,maxσAtw1,σAtw2maxmaxσAtu1,σAtw1,maxσAtu1,σAtw2=maxσAt×Atu1,w1,σAt×Atu1,w2

Thus σBtBtu1,w1),(u1,w2maxσAt×Atu1,w1,σAt×Atu1,w2,ifu1V and w1,w2E.

Likewise, we can demonstrate it for w1V and u1,u2E.

Definition 13.

The composition G1tG2t of two t-IFG G1t and G2t is a t-IFG and defined as a pair AtAt,BtBt, where AtAt and BtBt are t-IFS on V×V={u1,w1),(u2,w2:u1,u2Vw1,w2V} and E×E=u1,w1),(u2,w2:u1=u2,u1,u2V,w1,w2Eu1,w1),(u2,w2:w1=w2,w1,w2V,u1,u2Eu1,w1),(u2,w2:w1w2,w1,w2V,u1,u2E, respectively, which satisfies the following conditions:

  1. u1,w1V×V
    1. μAtAtu1,w1=minμAtu1,μAtw1
    2. σAtAtu1,w1=maxσAtu1,σAtw1
  2. If u1=u2 and (w1,w2)E
    1. μBtBtu1,w1),(u2,w2=minμAtu1,μBtw1,w2
    2. σBtBtu1,w1),(u2,w2=maxσAtu1,σBtw1,w2
  3. If w1=w2 and (u1,u2)E
    1. μBtBtu1,w1),(u2,w2=minμBtu1,u2,μAtw1
    2. σBtBtu1,w1),(u2,w2=maxσBtu1,u2,σAtw1
  4. If w1w2 and (u1,u2)E
    1. μBtBtu1,w1),(u2,w2=minμBtu1,u2,μAtw1,μAtw2
    2. σBtBtu1,w1),(u2,w2=maxσBtu1,u2,σAtw1,σAtw2

Example 7.

Consider the two 0.9-IFG G1t and G2t as shown in Figs. 6 and 7.

Figure 6.

Figure 6

0.9-IFG G10.9.

Figure 7.

Figure 7

0.9-IFG G20.9.

Then, their corresponding composition G1tG2t is shown in Fig. 8.

Figure 8.

Figure 8

Graphical representation of G10.9G20.9.

Definition 14.

The degree of a vertex in G1tG2t is defined as follows: for any u1,w1V×V.

degG1tG2tu1,w1=degμBtBtu1,w1),(u2,w2,degσBtBtu1,w1),(u2,w2

where

degμBtBtu1,w1),(u2,w2=u1=u2,w1,w2EminμAtu1,μBtw1,w2+w1=w2,u1,u2EminμBtu1,u2,μAtw1+w1w2,u1,u2EminμBtu1,u2,μAtw1,μAtw2

and

degσBtBtu1,w1),(u2,w2=u1=u2,w1,w2EmaxσAtu1,σBtw1,w2+w1=w2,u1,u2EmaxσBtu1,u2,σAtw1+w1w2,u1,u2EmaxσBtu1,u2,σAtw1,σAtw2.

Example 8.

From Example 7, the degree of each vertex in G1tG2t are:

degG1tG2ta,u=0.9,1.4, degG1tG2ta,v=0.9,1.4, degG1tG2tb,u=0.9,1.6, and degG1tG2tb,v=0.9,1.6.

Proposition 4.

Let G1t and G2t be any two t-IFG then G1tG2t is also a t-IFG.

Definition 15.

Let G1t=At,Bt and G2t=At,Bt be any two t-IFG of G1=V,E and G2=V,E, respectively. The Union G1tG2t of two t-IFG G1t and G2t is defined as a pair AtAt,BtBt, where AtAt is a t-IFS on VV and BtBt is a t-IFS on EE, respectively, which satisfy the following conditions:

  1. If u1V and u1V
    1. μAtAtu1=μAtu1
    2. σAtAtu1=σAtu1
  2. If u1V and u1V
    1. μAtAtu1=μAtu1
    2. σAtAtu1=σAtu1
  3. If u1VV
    1. μAtAtu1=maxμAtu1,μAtu1
    2. σAtAtu1=minσAtu1,σAtu1
  4. If u1,w1E and u1,w1E
    1. μBtBtu1,w1=μBtu1,w1
    2. σBtBtu1,w1=σBtu1,w1
  5. If u1,w1E and u1,w1E
    1. μBtBtu1,w1=μBtu1,w1
    2. σBtBtu1,w1=σBtu1,w1
  6. If u1,w1EE
    1. μBtBtu1,w1=maxμBtu1,w1,μBtu1,w1
    2. σBtBtu1,w1=minσBtu1,w1,σBtu1,w1.

Example 9.

Consider the two 0.9-IFG G1t and G2t as shown in Figs. 9 and 10.

Figure 9.

Figure 9

0.9-IFGG10.9.

Figure 10.

Figure 10

0.9-IFGG20.9.

Figure 11 depicts the graphical representation of the union G10.9G20.9 of two 0.9-IFG G10.9 and G20.9.

Figure 11.

Figure 11

Graphical representation of G10.9G20.9.

Definition 16.

The following formula describes the degree of a vertex u1,w1 at a t-IFG G1tG2t: For any u1,w1V×V.

degG1tG2tu1,w1=degμBtBtu1,w1),(u2,w2,degσBtBtu1,w1),(u2,w2

where

degμBtBtu1,w1),(u2,w2=u1,w1E,(u1,w1)EμBtu1,w1+(u1,w1)E,u1,w1EμBtu1,w1+u1,w1EEmaxμBtu1,w1,μBtu1,w1

and

degσBtBtu1,w1),(u2,w2=u1,w1E,(u1,w1)EσBtu1,w1+(u1,w1)E,u1,w1EσBtu1,w1+u1,w1EEminσBtu1,w1,μBtu1,w1

Proposition 5.

The union of two t-IFG is also a t-IFG.

Definition 17.

Let G1t=At,Bt and G2t=At,Bt be any two t-IFG. The join G1t+G2t of two t-IFG G1t=At,Bt and G2t=At,Bt is defined as At+At,Bt+Bt, where At+At is a t-IFS on VV and Bt+Bt is a t-IFS on EEE(E is the set of all edges joining the vertices of V and V) respectively, which satisfies the following conditions:

  1. If u1V and u1V
    1. μAt+Atu1=μAtu1
    2. σAt+Atu1=σAtu1
  2. If u1V and u1V
    1. μAt+Atu1=μAtu1
    2. σAt+Atu1=σAtu1
  3. If u1VV
    1. μAt+Atu1=maxμAtu1,μAtu1
    2. σAt+Atu1=minσAtu1,σAtu1
  4. If u1,w1E and u1,w1E
    1. μBt+Btu1,w1=μBtu1,w1
    2. σBt+Btu1,w1=σBtu1,w1
  5. If u1,w1E and u1,w1E
    1. μBt+Btu1,w1=μBtu1,w1
    2. σBt+Btu1,w1=σBtu1,w1
  6. If vEE
    1. μBt+Btu1,w1=maxμBtu1,w1,μBtu1,w1
    2. σBt+Btu1,w1=minσBtu1,w1,σBtu1,w1.
  7. If u1,w1E
    1. μBt+Btu1,w1=minμAtu1,μAtw1
    2. σBt+Btu1,w1=maxσAtu1,σAtw1

Example 10.

From Example 9, the graphical representation of 0.9-IFG G1t+G2t of G1t and G2t as shown in Fig. 12.

Figure 12.

Figure 12

Graphical representation of G10.9+G20.9.

Definition 18.

Let G1t and G2t be any two t-IFG. The degree of a vertex in t-IFG G1t+G2t is defined as follows: for any u1,w1V×V.

degG1t+G2tu1,w1=degμBt+Btu1,w1),(u2,w2,degσBt+Btu1,w1),(u2,w2

where

degμBt+Btu1,w1),(u2,w2=u1VVμAtAtu1+u1,w1EEμBtBtu1,w1+(u1,w1)EminμAtu1,μAtw1

and

degσBt+Btu1,w1),(u2,w2=u1VVσAtAtu1+u1,w1EEσBtBtu1,w1+u1,w1EmaxσAtu1,σAtw1

Proposition 6.

The join of two t-IFG is also a t-IFG.

Theorem 2.

Let G1t=At,Bt and G2t=At,Bt be t-IFG of G and G, respectively and let VV=. The union G1tG2t=AtAt,BtBt is a t-IFG of G=GG if and only if G1t and G2t are t-IFG of G and G, respectively.

Proof.

Suppose that G1tG2t is a t-IFG. Let u1,w1E, u1,w1E and u1,w1V-V.

Consider

μBtu1,w1=μBtBtu1,w1minμAtAtu1,μAtAtw1=minμAtu1,μAtw1

Consequently μBtu1,w1minμAtu1,μAtw1.

Also

σBtu1,w1=σBtBtu1,w1maxσAtAtu1,σAtAtw1=maxσAtu1,σAtw1

Consequently σBtu1,w1maxσAtu1,σAtw1.

This shows that G1t=At,Bt is a t-IFG. In the same way, we obtain that G2t=At,Bt is a t-IFG of G. Conversely, suppose that G1t and G2t are t-IFG. We know that the union of two t-IFG is a t-IFG. Thus, G1tG2t is a t-IFG.

Theorem 3.

Let G1t=At,Bt and G2t=At,Bt be t-IFG of G and G respectively and let VV=. Then join G1t+G2t=At+At,Bt+Bt is a t-IFG of G=GG if and only if G1t and G2t are t-IFG of G and G respectively.

Proof.

The proof for this is similar to the proof presented in Theorem 2.

Isomorphism of t-intuitionistic fuzzy graphs

This section introduces the concepts of homomorphism and isomorphism of t-IFG and explores the essential properties of these ideas.

Definition 19.

Let G1t=At,Bt and G2t=At,Bt be t-IFG of GV,E= and G=V,E respectively. A homomorphism θ from t-IFG G1t to G2t is a mapping θ:VV, satisfying the following conditions:

  1. μAtu1μAtθu1 and σAtu1σAtθu1, u1V

  2. μBtu1,w1μBtθu1,θw1 and σBtu1,w1σBtθu1,θw1, (u1,w1)E.

Definition 20.

A weak isomorphism θ from t-IFG G1t to G2t is a bijective mapping θ:VV, which meets the following conditions:

μAtu1=μAtθu1andσAtu1=σAtθu1,u1V.

Definition 21.

Let G1t=At,Bt and G2t=At,Bt be t-IFG of GV,E= and G=V,E respectively. A bijective mapping θ:VV is a strong co-isomorphism if it satisfies the below conditions:

  1. μAtu1μAtθu1 and σAtu1σAtθu1,u1V

  2. μBtu1,w1μBtθu1,θw1 and σBtu1,w1σBtθu1,θw1, u1,w1E

  3. μBtu1,w1=μBtθu1,θw1 and σBtu1,w1=σBtθu1,θw1, u1,w1E.

Definition 22.

An isomorphism between t-IFGs G1t=At,Bt and G2t=At,Bt is a bijective homomorphism mapping θ:VV (written as G1tG2t) which satisfies the following conditions:

  1. μAtu1=μAtθu1 and σAtu1=σAtθu1, u1V

  2. μBtu1,w1=μBtθu1,θw1 and σBtu1,w1=σBtθu1,θw1, u1,w1E.

Example 11.

Consider the two 0.8-G1t and G2t as shown in Figs. 13 and 14.

Figure 13.

Figure 13

0.8-IFG G10.8.

Figure 14.

Figure 14

0.8-IFGG20.8.

The mapping ζ:VV is defined by ζa=g,ζb=f and ζc=e. Given Definition (22), we have G10.8G20.8.

Theorem 4.

An isomorphism between t-IFG is an equivalence relation.

Proof.

Reflexivity and symmetry are obvious. Let φ:VV and θ:VV be the isomorphisms of G1t onto G2t and G2t onto G3t respectively.

Then θφ:VV is a bijective map from V to V is defined as:

θφu1=θφu1,u1V.

Since a map φ:VV defined by φu1=w1,u1V is an isomorphism.

In view of Definition (22), we have

μAtu1=μAtφu1=μAtw1,u1V 1
σAtu1=σAtφu1=σAtw1,u1V 2

and

μBtu1,u2=μBtφu1,φu2=μBtw1,w2,u1,u2E 3
σBtu1,u2=σBtφu1,φu2=σBtw1,w2,u1,u2E. 4

In the same way, we obtained that

μAtw1=μAtv1,w1V 5
σAtw1=σAtv1,w1V 6

and

μBtw1,w2=μBtv1,v2,(w1,w2)E 7
σBtw1,w2=σBtv1,v2,(w1,w2)E. 8

By using the relations (1), (5) and φu1=w1,u1V, we have

μAtu1=μAtφu1=μAtw1=μAtθ(w1)=μAtθφu1.

Similarly, we obtain that σAtu1=σAtθφu1.

When relations (3) and (7) are applied, the outcome is that:

μBtu1,u2=μBtw1,w2=μBtθ(w1),θ(w2)=μBtθ(φ(u1)),θ(φ(u2)).

Similarly, we find that μBtu1,u2=μBtθ(φ(u1)),θ(φ(u2)).

Thus, θφ is an isomorphism between G1t and G3t.

Hence, it completes the proof.

Complement of t-intuitionistic fuzzy graph

This section defines the concept of a complement of t-IFG and investigates its essential features.

Definition 23.

Let G1t=At,Bt be a t-IFG of G=V,E. The complement of a t-IFG G1t is a t-IFG G1t¯ on G¯=V¯,E¯ is defined as follows:

  1. V¯=V

  2. If u1V then μAt¯u1=μAtu1 and σAt¯u1=σAtu1

  3. If μBtu1,u20 and σBtu1,u20 then μBt¯u1,u2=0=σBt¯u1,u2

  4. If μBtu1,u2=0=σBtu1,u2=0 then μBt¯u1,u2=minμAtu1,μAtu2 and σBt¯u1,u2=maxσAtu1,σAtu2

Example 12.

Consider a 0.8-IFG G1t as shown in Fig. 15.

Figure 15.

Figure 15

0.8-IFG G10.8.

Then the complement G1t¯ of 0.8-IFG G1t is shown in Fig. 16.

Figure 16.

Figure 16

0.8-IFG G10.8¯.

Definition 24.

A t-IFG G1t is called self-complementary t-IFG if G1t¯G1t.

Proposition 7.

Let G1t=At,Bt be a self-complementary t-IFG. Then

u1u2μBtu1,u2=u1u2minμAtu1,μAtu2u1u2σBtu1,u2=u1u2maxσAtu1,σAtu2.

Proposition 8.

Let G1t=At,Bt be a t-IFG. If

u1u2μBtu1,u2=u1u2minμAtu1,μAtu2u1u2σBtu1,u2=u1u2maxσAtu1,σAtu2,u1,u2V

Then G1t is a self-complementary t-IFG.

Proposition 9.

If G1t and G2t are two t-IFG such that VV= then G1t+G2t¯G1t¯G2t¯.

Proposition 10.

If G1t and G2t are two t-IFG such that VV= then G1tG2t¯G1t¯+G2t¯.

Proposition 11.

For any two t-IFG G1t and G2t. If G1t and G2t have a strong isomorphism, then G1t¯ and G2t¯ also have a strong isomorphism.

Proof.

Let φ be a strong isomorphism between G1t and G2t. Since φ is a bijective map, then φ-1 is also a bijective map such that φ-1w1=u11,q1V. Thus.

μAtφ-1w1=μAtu1andσAtφ-1w1=σAtu1,w1V.

By employing Definition (23), it becomes evident that:

μBt¯u1,w1=minμAtu1,μAtw1minμAtφu2,μAtφw2=minμAtu2,μAtw2=μBt¯u2,w2

Thus μBt¯u1,w1μBt¯u2,w2.

Also

σBt¯u1,w1=maxσAtu1,σAtw1maxσAtφu2,σAtφw2=maxσAtu2,σAtw2=σBt¯u2,w2

Consequently σBt¯u1,w1σBt¯u2,w2.

This shows that φ-1 is a strong isomorphism between G1t¯ and G2t¯.

Proposition 12.

Let G1t and G2t be two t-IFG. Then G1tG2t if and only if G1t¯G2t¯.

Proposition 13.

Let G1t and G2t be two t-IFG . If there is a co-strong isomorphism between G1t and G2t, then there is a homomorphism between G1t¯ and G2t¯.

Application of t-intuitionistic fuzzy graph

This section applies the theory of t-IFG to the decision-making process of alleviating poverty.

Developing nations have been profoundly affected by extreme destitution, which has significantly impacted their economies, societies, and a vast number of people globally. The escalation in the poverty rate can be attributed to various factors. Poverty is characterized by the inability to provide oneself and one's family with necessities such as food, clothing, and shelter. It can be examined from psychological, social, political, and economic perspectives. These circumstances can lead to criminal activity, drug abuse, and even fatalities. To address poverty reduction effectively, the t-IFG provides a mathematical representation and analysis of uncertain data. By utilizing the t-IFG, we can model and analyze elements related to poverty alleviation. This approach enables us to identify the most crucial variables in systematically and organized eliminating poverty, enhancing decision-making in poverty reduction efforts. Reducing poverty requires a multifaceted strategy that addresses the underlying causes of poverty and implements interventions designed to alleviate it. Some main factors are beneficial in reducing poverty, such as promoting economic growth f1, creating employment opportunities (f2), enhancing access to education and skills training (f3), promoting manufacturing sectors (f4), promoting industrialization (f5), improving agriculture (f6), and improving infrastructure (f7). Let V=f1,f2,f3,f4,f5,f6,f7 represents the vertex of the set of factors that significantly contribute to the fight against poverty. Let the edges depict the degree of connection or relationship between the factors as t-intuitionistic fuzzy values. The graphical representation of the factor of reduction poverty is displayed in Fig. 17. Within the poverty reduction framework, membership and non-membership functions in intuitionistic fuzzy logic denote the connection between two distinct items or factors. These functions capture the degree to which an element exhibits membership or non-membership in a particular factor, facilitating a complete understanding of their interconnections. Within the poverty reduction framework, the membership function concept pertains to the extent to which an element exhibits favorable alignment with a particular factor. The non-membership function is a measure that measures the extent to which an element deviates from or lacks affiliation with a particular factor. The integration of these two functions offers a comprehensive understanding of the correlation between an element and a particular factor, encompassing its positive correlation and divergence from said factor. Decision-makers can evaluate the intricate and uncertain connections between different aspects of poverty reduction efforts by considering membership and non-membership functions. The parameter 't' allows decision-makers to customize the t-IFG according to their domain knowledge and problem.

Figure 17.

Figure 17

Graphical representation of poverty reduction factors.

Moreover, different parameter values of 't' indicate different attitudes towards risk and uncertainty. The direction of threshold values for membership and non-membership allows decision-makers to highlight or de-emphasize certain facts depending on their desired degree of membership and non-membership. The parameter denoted as 't' enables the adaptation of t-IFG to different contexts and sensitivities. Adjusting variable 't' allows decision-makers to explore various possibilities by manipulating the balance between positive and opposing viewpoints. This ability is critical when making decisions in uncertain contexts or during ongoing changes.

The IFS and 0.8-IFS defined on the edges is shown in the following Table 1.

Table 1.

Edges of IFS and 0.8-IFS.

Edges IFS 0.8-IFS Edges IFS 0.8-IFS
e12=f1,f2 0.9,0.1 0.8,0.2 e34=f3,f4 0.9,0.1 0.8,0.2
e13=f1,f3 0.7,0.3 0.7,0.3 e35=f3,f5 0.8,0.2 0.6,0.4
e14=f1,f4 0.8,0.2 0.8,0.2 e36=f3,f6 0.7,0.3 0.7,0.3
e15=f1,f5 0.5,0.5 0.5,0.5 e37=f3,f7 0.6,0.4 0.5,0.5
e16=f1,f6 0.9,0.1 0.8,0.2 e45=f4,f5 0.4,0.4 0.4,0.4
e17=f1,f7 0.7,0.3 0.7,0.3 e46=f4,f6 0.3,0.4 0.3,0.4
e23=f2,f3 0.5,0.4 0.5,0.4 e47=f4,f7 0.7,0.3 0.7,0.3
e24=f2,f4 0.6,0.4 0.6,0.4 e56=f5,f6 0.5,0.5 0.5,0.5
e25=f2,f5 0.7,0.3 0.7,0.3 e57=f5,f7 0.9,0.1 0.8,0.2
e26=f2,f6 0.5,0.5 0.5,0.5 e67=f6,f7 0.6,0.4 0.6,0.4
e27=f2,f7 0.5,0.5 0.5,0.5

In Table 1, the edge e12 from “promoting economic growth” to "creating employment opportunities" indicates that promoting economic growth is related to creating more job opportunities. In edge e12=0.8,0.2, the membership degree 0.8 indicates a strong connection between these factors, and the non-membership degree 0.2 shows a weak connection between these factors in reducing poverty. In the same way, an edge e36 from "improving access to education and skills training" to "improving agriculture" shows that better education and skills training can lead to better farming practices and higher productivity. In the given context, the membership degree of 0.7 for the edge e36=0.7,0.3 signifies a significant correlation or positive influence between the factors to reduce poverty. Conversely, the non-membership degree of 0.3 suggests a relatively low perception of disassociation or lack of relevance between these factors and poverty reduction efforts. Here, the parameter “t” suggests which factor can reduce poverty by 80%.

As shown in Table 2, the application of part 1 of Definition (10) yields the following results.

Table 2.

Table of membership and non-membership degree of each factor.

Factors Degree of each factor
f1 degf1=4.3,1.7
f2 degf2=3.6,2.3
f3 degf3=3.8,2.1
f4 degf4=3.6,1.9
f5 degf5=3.5,2.3
f6 degf6=3.4,2.3
f7 degf7=3.8,2.2

The score function of the edges is defined as:

T=μj2+1-σj2,1j7

The score function of the edges is calculated to find the optimal factor.

The results shown in Table 3 are then obtained by using the score function formula from Table 2.

Table 3.

Score value of each factor.

Factors Score function Tfj
f1 4.3566
f2 3.8275
f3 3.9560
f4 3.7108
f5 3.7336
f6 3.6401
f7 3.9850

Figure 18 depicts the graphical representation of the score function for the factors listed in Table 3.

Figure 18.

Figure 18

Graphical representation of score function of factor.

Consequently, Tf1=4.3566 is the greatest value, and according to the parameter t, f1 is the most significant factor in reducing poverty. Promoting economic growth can create jobs, raise incomes, encourage entrepreneurship and new ideas, lower the prices of goods and services, and give governments more money to spend on social services and programs. All of these things can help reduce poverty.

Comparative analysis

The t-IFG is an improved variant of the intuitionistic fuzzy graph that includes an additional parameter referred to as t,t0,1. By adjusting the ‘t’ parameter, uncertainty modeling can be fine-tuned to fit specific requirements and domain characteristics better. By changing the value of the parameter t various decision-making or preference scenarios can be depicted, providing a more precise representation of uncertainty and vagueness. The t-IFG offer various applications in diverse situations and decision-making processes. Their adjustable parameter ‘t’ within the closed unit interval enables the capture of varying degrees of conservatism or optimism, allowing for customization according to specific requirements. This notion is beneficial in problem-solving domains where multiple levels of uncertainty, hesitancy, and decision preferences must be considered simultaneously. Their effectiveness shines in complex decision-making scenarios, including medical diagnosis, pattern recognition, and decision support systems, as they can accommodate different levels of uncertainty and hesitancy. The exceptional flexibility and adaptability of t-IFG make them the preferred choice when a more precise representation of uncertainty is necessary.

Furthermore, when the parameter t is assigned a value of 0.1 within the framework of utilizing t-intuitionistic fuzzy sets to tackle the problem of poverty reduction, it signifies a prudent and somewhat negative assessment of the effectiveness of different factors in alleviating poverty. A membership degree of 0.1 indicates a weak association between the variables, implying that the impact of poverty reduction is limited. On the other hand, a non-membership degree of 0.9 signifies a perceived lack of a robust correlation or a fragile link between these variables and the mitigation of poverty. When the degrees of membership and non-membership stay consistent, the elements under examination possess a uniform and equivalent amount of association with a certain factor and a consistent level of non-association. The observed uniformity indicates that all aspects are seen as equally connected to the factor in question, without any noticeable differentiation based on their levels of membership or non-membership. The constancy of ambiguity or reluctance in associating these elements with the factor persists uniformly across all dimensions. Choosing a parameter value of 't' near zero signifies a need for more precision about the impacts on poverty alleviation.

Conclusion

In this research, the concept of t-intuitionistic fuzzy graphs (t-IFG) has been initiated, and various fundamental features of this phenomenon have been explored. Many set-theoretical operations of t-IFG have been studied, and graphical representations of these operations have been demonstrated. Additionally, the idea of a complement of t-IFG has been defined, and some of its key features have been investigated. The notions of homomorphisms and isomorphisms of t-IFG have been introduced. Furthermore, a practical application of the newly defined technique in reducing poverty has been presented.

The use of t-IFG effectively addresses real-world problems and improves decision-making processes. It is a flexible and robust framework that deals with imprecision and uncertainty in decision-making while optimizing complex systems, recognizing patterns, and offering various applications for computational intelligence. This idea has the potential for future use in healthcare systems, transportation networks, pattern recognition, and machine learning.

Selecting a parameter value 't' close to zero indicates a lack of identifiable specificity in the effects of poverty reduction. In contrast, when the parameter value 't' approaches 1, it strongly signifies a robust and visible correlation with achieving objectives related to reducing poverty. In t-IFG, the parameter 't' measures the level of assurance or uncertainty over the effectiveness of poverty reduction efforts. The extremes of this parameter indicate either a negligible impact or a strong correlation with the desired outcome. Utilizing this calibrated parameter allows decision-makers to precisely adjust the depiction of uncertainty and its influence on analytical results, leading to a sophisticated and flexible structure for tackling the intricate complications of poverty reduction.

One of our primary goals for future studies is to apply the proposed strategy to solve MCDM problems, specifically supplier selection, risk management, and renewable energy selection. The proposed techniques will also be applied to neural networks, clustering, feature selection, and risk management. In addition, some advanced decision-making techniques of complex spherical fuzzy Aczel Alsina aggregation operators61 will also be studied within the context of the strategies presented in this article.

Acknowledgements

This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. 4376].

Author contributions

All authors made equal contributions to this paper.

Data availability

All data generated or analyzed during this study are included in this published article.

Competing interests

The authors declare no competing interest.

Footnotes

Publisher's note

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

Contributor Information

Asima Razzaque, Email: arazzaque@kfu.edu.sa.

Umer Shuaib, Email: mumershuaib@gcuf.edu.pk.

References

  • 1.Zadeh LA. Fuzzy sets. Inf. Control. 1965;8:338–353. [Google Scholar]
  • 2.Mapari BG, Naidu A. Study of fuzzy set theory and its applications. IOSR-JM. 2016;12:148–154. [Google Scholar]
  • 3.Kandel A. Fuzzy Mathematical Techniques with Applications. Boston: Addison-Wesley Educational Publishers Inc; 1986. p. 325. [Google Scholar]
  • 4.Klir GJ, Yuan B. Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice-Hall; 1995. pp. 1–12. [Google Scholar]
  • 5.Mendel JM. Fuzzy logic systems for engineering: A tutorial. Proc. IEEE. 1995;83:345–377. [Google Scholar]
  • 6.Zimmermann LA. Fuzzy Set Theory and Its Applications. 2. Kluwer; 1991. [Google Scholar]
  • 7.Atanassov KT. Intuitionistic fuzzy sets. Fuzzy Set Syst. 1986;20:87–96. [Google Scholar]
  • 8.De SK, Biswas R, Roy AR. Some operations on intuitionistic fuzzy sets. Fuzzy Set Syst. 2000;114:477–484. [Google Scholar]
  • 9.Atanassova L, Dworniczak P. On the operation ∆ over intuitionistic fuzzy sets. Mathematics. 2021;9:1518. [Google Scholar]
  • 10.Ejegwa PA, Onoja AM, Emmanue IT. A note on some models of intuitionistic fuzzy sets in real life. GRMA. 2014;2:42–50. [Google Scholar]
  • 11.Burillo, P., Bustince, H. & Mohedano, V. Some definition of intuitionistic fuzzy number, fuzzy based expert systems. Fuzzy Bulgarian Enthusiasts, 1994, 28–30.
  • 12.Faizi S, Salabun W, Rashid T, Zafar S, Wątrobski J. Intuitionistic fuzzy sets in multi-criteria group decision making problems using the characteristic objects method. Symmetry. 2020;12:1382. [Google Scholar]
  • 13.Dai J, Chen T, Zhang K. The intuitionistic fuzzy concept oriented three-way decision model. Inf. Sci. 2023;2023(619):52–83. [Google Scholar]
  • 14.Das S, Kar MB, Kar S. Group multi-criteria decision making using intuitionistic multi-fuzzy sets. J. Uncertainty Anal. Appl. 2013;10:1–16. [Google Scholar]
  • 15.Chen Y, Li B. Dynamic multi-attribute decision-making model based on triangular intuitionistic fuzzy numbers. Sci. Iran. 2011;8:268–274. [Google Scholar]
  • 16.Yu D. Group decision making based on generalized intuitionistic fuzzy prioritized geometric operator. Int. J. Intell. Syst. 2012;27:635–661. [Google Scholar]
  • 17.Liao H, Xu Z. Intuitionistic fuzzy hybrid weighted aggregation operators. Int. J. Intell. Syst. 2014;29:971–993. [Google Scholar]
  • 18.Keshteli MH, Cenk Z, Erdebilli B, Özdemir YS, Jouybari FG. Pythagorean fuzzy TOPSIS method for green supplier selection in the food industry. Expert Syst. Appl. 2023;224:120036. [Google Scholar]
  • 19.Zhang H, Yu L. MADM method based on cross-entropy and extended TOPSIS with interval-valued intuitionistic fuzzy sets. Knowl.-Based Syst. 2012;30:115–120. [Google Scholar]
  • 20.Boran F, Genç S, Kurt M, Akay D. A multi-criteria intuitionistic fuzzy group decision making for supplier selection with TOPSIS method. Expert Syst. Appl. 2009;36:11363–11368. [Google Scholar]
  • 21.Aloini D, Dulmin R, Mininno V. A peer IF-TOPSIS based decision support system for packaging machine selection. Expert Syst. Appl. 2014;41:2157–2165. [Google Scholar]
  • 22.Yue Z. TOPSIS-based group decision-making methodology in intuitionistic fuzzy setting. Inf. Sci. 2014;277:141–153. [Google Scholar]
  • 23.Liu M, Sun X, Deng H, Chaohui Y, Zhou X. Image enhancement based on intuitionistic fuzzy sets theory. IET Image Process. 2016;10:701–709. [Google Scholar]
  • 24.Bouchet, A., Montes, S. & Diaz, I. Intuitionistic fuzzy sets applied to color image processing, in 13th International Workshop on Fuzzy Logic and Applications, Vietri sul Mare, Italy, 20–22, December 2021.
  • 25.Nagman N, Karatas S. Intuitionistic fuzzy soft set theory and its decision making. J. Intell. Fuzzy Syst. 2013;24:829–836. [Google Scholar]
  • 26.Ali Z, Mahmood T, Aslam M, Chinram R. Another view of complex intuitionistic fuzzy soft sets based on prioritized aggregation operators and their applications to multi-attribute decision making. Mathematics. 1922;2021:9. [Google Scholar]
  • 27.Khan MJ, Kumam P, Liu P, Kumam W, Ashraf SA. Novel approach to generalized intuitionistic fuzzy soft sets and its application in decision support system. Mathematics. 2019;7:742. [Google Scholar]
  • 28.Bashir, M., Salleh, A. R. & Alkhazaleh, S. Possibility intuitionistic fuzzy soft set. Adv.Decis. Sci.24 (2012).
  • 29.Jiang Y, Tang Y, Chen Q, Liu H, Tang J. Interval-valued intuitionistic fuzzy soft sets and their properties. Comput. Math. Appl. 2010;60:906–918. [Google Scholar]
  • 30.Khalid A, Abbas M. Distance measures and operations in intuitionistic and interval-valued intuitionistic fuzzy soft set theory. Int. J. Fuzzy Syst. 2015;17:490–497. [Google Scholar]
  • 31.Deli I, Karats S. Interval valued intuitionistic fuzzy parameterized soft set theory and its decision making. J. Intell. Fuzzy Syst. 2016;30:2073–2082. [Google Scholar]
  • 32.Deli I, Cagman N. Intuitionistic fuzzy parameterized soft set theory and its decision making. Appl. Soft Comput. 2015;28:109–113. [Google Scholar]
  • 33.Abdullah L, Goh P, Othman M, Khalif KMNK. Choquet integral under pythagorean fuzzy environment and their application in decision making. In: Garg H, editor. Pythagorean Fuzzy Sets. Singapore: Springer; 2021. [Google Scholar]
  • 34.Rosenfeld, A. Fuzzy graphs and fuzzy hypergraphs. studies in fuzziness and soft computing. Physica, Heidelberg, Baden-Württemberg, Germany, (1975).
  • 35.Mordeson JN, Chang-Shyh P. Operations on fuzzy graphs. Inf. Sci. 1994;79:159–170. [Google Scholar]
  • 36.Bhattacharya P. Some remarks on fuzzy graphs. Pattern Recognit. Lett. 1987;5:297302. [Google Scholar]
  • 37.Bhutani KR. On automorphisms of fuzzy graphs. Pattern Recognit. Lett. 1989;3:159–162. [Google Scholar]
  • 38.Pathinathan T, Arockiaraj JJ, Rosline JJ. Hesitancy fuzzy graphs. Indian J. Sci. Technol. 2015;2015(8):1–5. [Google Scholar]
  • 39.Javaid M, Kashif A, Rashid T. Hesitant fuzzy graphs and their products. Fuzzy Inf. Eng. 2020;12:238–252. [Google Scholar]
  • 40.Akram M, Nawaz S. On fuzzy soft graphs. Ital. J. Pure Appl. Math. 2015;34:497–514. [Google Scholar]
  • 41.Akram M, Nawaz S. Fuzzy soft graphs with applications. J. Intell. Fuzzy Syst. 2016;30:3619–3632. [Google Scholar]
  • 42.Hussain, A., Alsanad, A., Ullah, K., Ali, Z., Jamil, M. K. & Mosleh, M. A. Investigating the short-circuit problem using the planarity index of complex q-rung orthopair fuzzy planar graphs. Complexity 1–22 (2021).
  • 43.Ullah K, Hussain A, Mahmood T, Ali Z, Alabrah A, Rahman SMM. Complex q-rung orthopair fuzzy competition graphs and their applications. Electron. Res. Arch. 2022;30:1558–1605. [Google Scholar]
  • 44.Li HJ, Xiang J. Explore of the fuzzy community structure integrating the directed line graph and likelihood optimization. J. Intell. Fuzzy Syst. 2017;32:4503–4511. [Google Scholar]
  • 45.Bhattacharya A, Pal M. Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs. Soft Comput. 2021;25:7095–7118. [Google Scholar]
  • 46.Peng Y, Zhu X, Nie F, Kong W, Ge Y. Fuzzy graph clustering. Inf. Sci. 2021;571:38–49. [Google Scholar]
  • 47.Samanta S, Pal M. A new approach to social networks based on fuzzy graphs. J. Mass Commun. J. 2014;5:078–099. [Google Scholar]
  • 48.Shannon, A. & Atanassov, K. T. A first step to a theory of the intuitionistic fuzzy graphs, in Proceeding of the FUBEST (Lakov, D.), ed., Sofia, Bulgaria, September, 59–61 (1994).
  • 49.Shannon A, Atanassov KT. Intuitionistic fuzzy graphs from α, β- levels. NIFS. 1995;1:32–35. [Google Scholar]
  • 50.Parvathi, R., Karunambigai, M. G. & Atanassov, K. T. Operations on intuitionistic fuzzy graphs, in Fuzzy Systems, FUZZ-IEEE. IEEE International Conference on IEEE 1369–1401 (2019).
  • 51.Gani AN, Begum SS. Degree, order and size in intuitionistic fuzzy graphs. Int. J. Algorithms Comput. Math. 2010;3:11–16. [Google Scholar]
  • 52.Shahzadi S, Akram M. Graphs in an intuitionistic fuzzy soft environment. Axioms. 2018;7:20. [Google Scholar]
  • 53.Yaqoob N, Gulistan M, Kadry S, Wahab HA. Complex intuitionistic fuzzy graphs with application in cellular network provider companies. Mathematics. 2019;7:35. [Google Scholar]
  • 54.Anwar A, Chaudhry F. On certain products of complex intuitionistic fuzzy graphs. J. Funct. Spaces. 2021;2021:1–9. [Google Scholar]
  • 55.Nandhinii R, Amsaveni D. On bipolar complex intuitionistic fuzzy graphs. TWMS J. Appl. Eng. Math. 2022;12:92–106. [Google Scholar]
  • 56.Shoaib M, Mahmood W, Xin Q, Tchier F, Tawfiq FM. Certain operations on complex picture fuzzy graphs. IEEE Access. 2022;10:114284–114296. [Google Scholar]
  • 57.Akram, M., Sattar, A. & Saeid, A. B. Competition graphs with complex intuitionistic fuzzy information. Granul. Comput. 1–23 (2022).
  • 58.Nazeer I, Rashid T. Connectivity concepts in intuitionistic fuzzy incidence graphs with application. Int. J. Appl. Comput. Math. 2022;8:263. doi: 10.1007/s40819-022-01461-8. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 59.Dinar J, Hussain Z, Zaman S, Rehman SU. Wiener index for an intuitionistic fuzzy graph and its application in water pipeline network. Ain Shams Eng. J. 2023;14:101826. [Google Scholar]
  • 60.Sharma PK. t-Intuitionistic fuzzy subgroups. Int. J. Fuzzy Syst. 2012;2:233–243. [Google Scholar]
  • 61.Hussain A, Ullah K, Senapati T, Moslem S. Complex spherical fuzzy Aczel Alsina aggregation operators and their application in assessment of electric cars. Heliyon. 2023;9:e18100. doi: 10.1016/j.heliyon.2023.e18100. [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

All data generated or analyzed during this study are included in this published article.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES