Next Article in Journal
Similarity-Based Three-Way Clustering by Using Dimensionality Reduction
Previous Article in Journal
Bayesian Statistical Inference for Factor Analysis Models with Clustered Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Complex t-Intuitionistic Fuzzy Graph with Applications of Rubber Industrial Water Wastes

by
Murugan Kaviyarasu
1,
Mohammed Alqahtani
2,*,
Murugesan Rajeshwari
3 and
Gopikumar Sudalaimuthu
4
1
Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology, Chennai 600062, India
2
Department of Basic Sciences, College of Science and Theoretical Studies, Saudi Electronic University, P.O. Box 93499, Riyadh 11673, Saudi Arabia
3
Department of Mathematics, Presidency University, Bangalore 560064, India
4
Department of Civil Engineering, Vel Tech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology, Chennai 600062, India
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(13), 1950; https://doi.org/10.3390/math12131950
Submission received: 21 May 2024 / Revised: 18 June 2024 / Accepted: 21 June 2024 / Published: 23 June 2024
(This article belongs to the Section Fuzzy Sets, Systems and Decision Making)

Abstract

:
The main concept involved in this study explains the theme of complex t-intuitionistic fuzzy graphs (CTIFGs), which act as a powerful tool in analyzing and displaying the relationships among various applications that are difficult to recognize. The manuscript also demonstrates the capability of CTIFGs to create complex associations with multiple domains when considering a physical situation. Following this, the basic set of operations for CTIFGs is projected. The ideas on isomorphism and homomorphism of the CTIFGs are also presented. Moreover, the manuscript describes the importance of the above-mentioned technique in an effective way, giving a solution to the practical application associated with rubber processing industrial wastewater. The contributing factors and corresponding interdependencies are considered when calibrating the complex nature of industrial wastewater associated with the CTIFGs. The results highlight the adaptability and possible efficiencies of CTIFGs, which act as a decision-making tool and also indicate their importance for policy planners in important societal issues.

1. Introduction

1.1. Fuzzy Set and Graphs

Real-world problems can be meticulously addressed with the support of mathematical concepts using the applications associated with fuzzy graph theory. In [1], Zadeh depicts the importance of assigning membership values running from zero to one, which are used for understanding the set theory, where judgment, fuzziness, and human opinion are enforced for predictions. The fuzzy-based mathematical concept emerged in the 1960s and 1970s, and various research in the field of applications-focused theory in the area of tube trains, video cameras, and washing machines was conducted. Simultaneously, formal theories are used to obtain the qualitative outcome. The review paper [2] highlights the significant factors associated with fuzzy set theory, where natural and formal models are used to predict uncertainties with the support of modeling. The fuzzy set in this work is denoted in the form of
A = α , μ A α α   ϵ   A }
The pairs indicate the fuzzy set, μ A α epresents membership value, and it is denoted as 0 μ A α 1 .
The work in [3] described the role of variables linked with a potential prospective distribution and a probability distribution. The work of Zadeh and their teammates has demonstrated an idea in decision-making using the probability and possibility concept. They have established unique concepts in the name of the Zadeh fuzzy set, n-dimensional fuzzy set, and finite value fuzzy sets [4]. For an assigned methodology, introducing the algorithms supported by fuzzy graph theory gives the output on evaluating the multiple species-based fishery dynamics and will also provide a systematic introductory interpretation in the form of patterns. Fuzzy means it is represented as not having a clear vision in normal conditions. Most of the daily life problems can be modeled using fuzzy graphs [5].
The linear Diophantine fuzzy graphs play a significant role in categorizing the properties of various applications. Some of the most predominant outcomes are in the field of bridges, trees, forests, cut vertices, and cycles [6]. An algorithm is commonly involved in evaluating the number of components associated with rooted trees that are covered using fuzzy graphs and in addition, it also determines the complexity analysis [7]. There might be alternative solutions for the algorithms that are favored. The application of optimization with the support of algorithms will be an alternative and more advantageous than the application of neural network-based fuzzy models [8]. The application of a fuzzy model can even predict the functioning of the human heart and can be easily plotted using graphs for easy understanding the graphs [9]. Fuzzy methods play a significant role in compiling graphical content, which includes edge weight for balance, edge connectedness for continuity, edge existence for surveying, and vertex existence and are plotted in order to give concluding remarks in fuzziness [10,11]. These data are normally used in maintaining the ranking by fuzzy numbers. The introduction of a fuzzy hyper-based wiener index helps in calibrating various graphical similarities [12]. The role of the fuzzy cognitive map and its associated structure of output concepts minimizes all concepts of complicated connections in the graph [13].

1.2. Intuitionistic Fuzzy Set and Graphs

The advanced stage of conventional fuzzy set theory and the corresponding graphs are representations through intuitionistic fuzzy sets (IFSs) and (IFGs) intuitionistic fuzzy Graphs. Given the flexibility in making models, the Krassimir Atanassov pattern was introduced in 1980 when it addressed the inclusion and removal of a set of values. In cases where decisions are made in critical situations, the IFS models are considered as suitable solutions for correcting alternatives through graphical representation [14,15,16]. In decision-making, initially, the level of resistance is measured, and then the membership value perspectives and non-membership value viewpoints are considered when making flexible decisions with more information through the graphs [17,18].
In the case of technical content, the mathematical concept associated with IFSs and IFGs plays a significant role in developing algorithms and aggregation strategies. The major components involved in accurate modeling are networking, utilizing image recognition, clustering of data, and control systems, which provide significant changes to the decision-making process [19]. Framing a hypothesis for the IFG graph deliberately signifies the self-complimentary displays [20]. The importance of IFG components is examined and explained with the support of various typical examples [21]. In IFGs, the applicability of the vertex set is assessed through the upgraded algorithm [22]. Product operations are defined in the IFG with the support of graphs [23]. With the energy of a fuzzy graph, it is further transformed into the IFG concept for effective outcomes [24]. The combined effect of fuzzy and IFG clustering roles significantly considers the clustering of vertices [25]. Connectivity plays a predominant role in the study of IFGs, which has been discussed briefly [26]. Connectivity indexing supports IFG research by giving better outputs [27]. Multi-person thinking, multi-criteria-based decision-making support, and reliability scores are the outcomes of the intuitionistic fuzzy model [28].

1.3. Complex Fuzzy Sets (CFS) and Complex Fuzzy Graphs (CIFG)

In complex fuzzy theory, μ x has been highlighted as the membership function that covers the unit circle of the complex plane that has range values higher than [0, 1] with r as an identifier. Meanwhile μ x indicates the complex-valued function, which is represented as v x e i a x ,   i = 1 as a membership grade. In due course, amplitude term v x , has been disclosed with the unit interval [0, 1], and similarly, the phase term represented as a periodic term has (x) with the interval [0, 2π], as both the components united to form a membership in the CFS. With uniqueness in the phase term terminology, the CFS model is elevated. Membership degree has been utilized as the complex plane where the unit circle consists of additional components diverging for the fuzzy characterization in the CFS module. The importance of intersection in the compound, discussions in the complement, and support of unions comes from the complex parameters associated with the CFS examples for simplification, as discussed by Ramot et al. [29]. The reputation of CFS and their systematic analysis are detailed in a clear sketch by Yazdanbakhsh and Dick [30]. The non-membership degree developed by Alkouri and Salleh [31] connecting the CIFS and CFS database is given as v x = s e i β x and is further transformed to restriction r + s ≤ 1. In this case, the role of managing periodicity and considering uncertainty are significant factors that boost the knowledge concurrently.
Hesitation in concluding the decision may be reduced with the support of complex-valued truth factors and considering falsity membership degrees for effective discussion. Meanwhile, the application of physical phenomena such as wave functions, problem-solving situations, and resistance in the electrical sector significantly express uncertainty. Even though CIFS and CFS work together concept-wise in the field of cylindrical extensions, followed by projections and distant measurements, the individuality differs in the part of introducing a group of phase words, as CFS will always have one more additional term. The concept of IFG and its extensive application and evidence have been cited [32,33,34,35]. The recent research work by Asima Razzaque [36] in the area of TIFGs reveals solutions to complicated problems with the support of multiple factors considering the physical situations. Under a fundamental set of working conditions, the ideas of homomorphism and isomorphism were experimented with. Specifically, the work proposed a systematic view of the elimination of poverty in an identified community. In their new definition of SA, Shao et al. [37] discussed how applications were used in water supply systems and the degree of connectedness in IFGs. The first of its kind, the new video processing algorithm by Chen, Zhihua et al. [38] uses temporal intuitionistic fuzzy sets to enhance films via suitable examples in interval-valued IFGs and introduce some of the specific concepts in Xiaoli Qiang et al. [39], such as covering, matching, and paired domination via strong arc [40,41]. Interval-valued (S, T)-fuzzy graphs that are regular and fully regular were first conceptualized by Rashmanlou and Borzooei. Talebi, Kosari, and Shi et al. model challenges associated with this network and provide solutions to some of them, including the neutrality state [42], thus extending the energy idea on the fuzzy graph picture. Guan et al. [43] examine domination in intuitionistic fuzzy directed graphs (IFDGs) to discover dominant nodes with implications for social networks and network security. Imran et al. [44] create novel operations on intuitionistic fuzzy graphs that use the Sombor index to improve internet routing efficiency and reliability.
Sakander Hayat et al. [45] present two novel temperature-based topological indices for predicting the physicochemical features of polycyclic aromatic hydrocarbons, which apply to silicon carbide nanotubes. Sakander Hayat et al. use eigenvalue-based graphical indices to forecast the thermodynamic parameters of polycyclic aromatic hydrocarbons, with an emphasis on polyacenes [46]. Sakander Hayat et al. compare temperature-based graphical indicators to determine total π-electron energy in benzenoid hydrocarbons [47]. Sakander Hayat et al. [48] investigate structure-property modeling using temperature-based topological indices to predict the thermodynamic characteristics of benzenoid hydrocarbons. Sakander Hayat [49] uses distance-based graphical indices to forecast the thermodynamic parameters of benzene hydrocarbons, displaying a variety of applications. Sakander Hayat et al. investigate the statistical importance of valency-based topological descriptors in predicting the thermodynamic parameters of benzenoid hydrocarbons [50].
In this study, the CTIFG outperforms IFSs in handling ambiguity and uncertainty. This tactic is beneficial since it provides an adaptable approach to managing the ambiguity and uncertainty that accompany decision-making. Due to their efforts to bridge the gap between classical computational models used in technology and the sciences and symbolic models used in expert systems, complicated ITF models are becoming more and more valuable.
The CTIFG theory is a useful instrument for defining and elucidating difficult and ambiguous issues that emerge in real-world situations. This phenomenon can be explained by its capacity to convey the innate qualities of complexity, imprecision, ambiguity, and predictableness that are associated with the items that fall under these categories. However, in order to address the actual issues pertaining to membership and non-membership functions, these approaches must be rewritten using particular numerical values. We introduced the idea of a CTIFG, which makes use of the linear t-norm and t-conform operators, to get around this restriction. The implementation of the CTIFG was prompted by the need for an organized and flexible technique to manage ambiguity and facilitate decision-making under the direction of established parameters.
Here, the use of the parameter “t” makes the process easier to understand by defining specific standards for determining the level of membership or non-membership. It becomes necessary to base decisions on varying degrees of confidence in several real-life scenarios. The goal of adding the parameter “t” to the CTIFG is to get around the IFG’s limitations. This parameter provides distinct thresholds for decision-making, improves customization, decreases uncertainty, and gives exact control over stringency. Because of the aforementioned advantages, the CTIFG is an extremely useful method for illustrating uncertainty and assisting in informed decision-making in situations where a customized and controlled approach to uncertainty management is required. When classical IFG is insufficient, the CTIFG makes complicated decision environments easier to grasp and manipulate.
In the context of difficult decision-making, the impact of complex, ambiguous relationships cannot be overstated. These graphs provide decision-makers with strong tools for evaluating and analyzing various options by providing a detailed description of the intricate interaction between input and output factors. Decision-makers can determine choices fully and systematically by taking into account several criteria and their interdependencies, thanks to complex fuzzy connections. This makes it easier to handle complex decision-making challenges holistically. Decision-making has advanced significantly with the help of this sophisticated technique, especially when complex membership, non-membership, and parameter t are present. It opens the door for improved decision-making precision and denotes a departure from the constraints of binary logic.

1.4. Motivation for the Research

  • The main reason for employing CTIFGs is their ability to manage complex and uncertain situations with hesitant and variable elemental interactions.
  • These graphs, which incorporate the “t” parameter, provide a framework for evaluating and simulating various degrees of connection confidence and uncertainty.
  • A technique for managing the conjunction and disjunction of uncertain information is provided by including t-norms and t-conforms. This approach is specifically intended for decision-making scenarios involving a variety of inputs along with results in real-world scenarios.
  • This methodology is utilized in various domains, such as risk assessment, decision analysis, and systems optimization, where the aim is to attain a trade-off between pragmatic utility and unresolved relationships.

1.5. Novelties of the Work

  • The “t” parameter is a threshold of reluctance that allows for the formation of a new, structured representation of ambiguous connections.
  • Adding the “t” option can improve the representation of interactions in which choosing nodes and their edges is contingent upon adhering to a protective confidence level.
  • This approach would enable a more methodical treatment of ambiguity by providing a more exact difference between effective and sensitive relationships.
  • Multi-layered analysis, in which distinct graph layers are linked to different parameter values “t”, is possible with a CTIFG. Using this method would allow for a complete analysis of the graph’s relationships while accounting for varying levels of assurance. It makes the fundamental framework easier to comprehend.

1.6. Primary Goals for This Article Are to Make the Following Contributions

  • Propose the idea of the CTIFG. 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.
  • Examine and demonstrate several important characteristics of the recently defined CTIFG set theory procedures. These functions make it possible to integrate data, investigate relationships, and support well-informed decision-making in a variety of application domains.
  • Explain what homomorphism and isomorphism of CTIFG mean, and give examples of some recently defined important characteristics. This idea is utilized to make conducting comparative analysis and data transmission more comfortable in situations where there are uncertain and hesitant graph topologies.
  • Introduce the concept of the complement of a CTIFG and demonstrate several essential aspects of this approach. The concept of uncertainty highlights inverse linkages that the initial graph might not have made clear. Applications for this technology include analyzing decisions, network verification, and error detection.
  • Utilizing the recently defined technique, determine the essential elements for mitigating poverty within a certain community. By strengthening representation, identifying vulnerable populations, assigning resources, monitoring and assessing results, and developing thoughtful policies, this strategy will aid in the reduction of rubber processing industrial wastewater.
  • Examines the complexities and uncertainties surrounding industrial wastewater, culminating in an evaluation of its roots, evolution, and effects.

1.7. Strengths and Weaknesses

Finally, while complex t-intuitionistic fuzzy networks provide an effective framework for representing ambiguity and uncertainty in graph theory, they also present computational difficulties and necessitate meticulous parameter adjustment for best interpretation and performance. Their strengths are their strong mathematical foundation and their capacity to deal with a variety of uncertainty types; their shortcomings are their increased computing complexity and interpretability problems.

1.8. Structure of the Paper

A quick overview of the CTIFG (see Table 1) is followed by the remainder of the article, which is organized as follows: The “Preliminaries of CTIFGs” section offers some basic definitions to aid the reader in understanding the uniqueness of the work that is described in this article. Numerous set-theoretical operations of CTIFGs are examined and illustrated graphically in the section “Operations on CTIFGs”. The definitions of homomorphisms and isomorphisms of CTIFGs are given in the section “Isomorphism of CTIFGs”. The freshly defined approach is used to create a mechanism for lowering poverty in a particular society in the “Application of CTIFGs” section. The final portions of the paper are titled “Comparative analysis” and “Conclusion”, respectively, and they include some comparative analysis and specific findings.

2. Preliminaries CTIFGs

Definition 1.
Given a universal set U, let G be its intuitionistic fuzzy set (IFS) and t∈ [0, 1]. Known as a t-intuitionistic fuzzy set (TIFS), the  I F S Ğ t of U is defined as ϻ Ğ t ʊ 1 = { ϻ Ğ t ʊ 1 , t } , and ϼ Ğ t ʊ 1 = { ϼ Ğ t ʊ 1 , 1 t } ,   ʊ 1 U . The form of TIFS is Ğ t = ʊ 1 , ϻ Ğ t ʊ 1 , ϼ Ğ t ʊ 1 : ʊ 1 U where ϻ Ğ t   a n d   ϼ Ğ t are functions that assign a degree of truth membership and falsity membership, respectively. Moreover, the functions ϻ Ğ t   a n d   ϼ Ğ t satisfy the condition 0 ϻ Ğ t ʊ 1 + ϼ Ğ t ʊ 1 1 .
Definition 2.
A complex intuitionistic fuzzy set (CIFS) A, defined on a universe of discourse X is an objective of the form Ą = ʊ 1 ,   ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 ,   ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ t ʊ 1 , here i = 1 , ( ϻ Ğ Ą t ʊ 1 ,   ϼ Ğ Ą t ʊ 1 )   0,1 , 0 ϻ ϖ Ğ Ą t ʊ 1 ,   ϼ ς Ğ Ą t ʊ 1 2 π .
Definition 3.
For a given simple graph G = (V,E), let Ğ t = ( Ą t ,   Ɓ t ) be a t-intuitionistic fuzzy graph (TIFG). The notation Ğ t = ( Ą t ,   Ɓ t ) denotes a CTIFG, where Ą t = ( ʊ i , ϻ Ğ Ą t ʊ i e i ϻ ϖ Ğ Ą t ʊ i ,   ϼ Ğ Ą t ʊ i e i ϼ ς Ğ Ą t ʊ i ) : ʊ i V is a CTIFS on V and Ɓ t = ʊ i , ʊ j ,   ϻ Ğ Ɓ t ʊ i , ʊ j e i ϻ ϖ Ğ Ɓ t ʊ i ,   ʊ j ,   ϼ Ğ Ɓ t ʊ i , ʊ j e i ϼ ς Ğ Ɓ t ʊ i ,   ʊ j : ʊ i ,   ʊ j E is a CTIFS on E V × V , such that ( ʊ i , ʊ j ) E .
ϻ Ğ Ą t ʊ i , ʊ j e i ϻ ϖ Ğ Ą t ʊ i ,   ʊ j     { ϻ Ğ Ą t ʊ i , ϻ Ğ Ą t ʊ j } e i   { ϻ ϖ Ğ Ą t ʊ i ,     ϻ ϖ Ğ Ą t ʊ j }
ϼ Ğ Ɓ t ʊ i ,   ʊ j e i ϼ ς Ğ Ɓ t ʊ i ,   ʊ j   { ϼ Ğ Ɓ t ʊ i ,   ϼ Ğ Ɓ t ʊ j } e i { ϼ ς Ğ Ɓ t ʊ i ,     ϼ ς Ğ Ɓ t ʊ j }
for all ʊ i , ʊ j V .
Example 1.
Examine the G = ( V , E ) in which V = { a , b , c , d } and E = { a b , b c , c d , d a } . Let A be a complex t-intuitionistic subset (CTIS) of V and B be a CTIS of E   V × V , as given at t = 0.80 in Figure 1.
Ą 0.80 = a , 0.6   e i   0.5 π ,   0.4 e i   0.5 π   b , 0.7 e i 0.4 π ,   0.3 e i 0.7 π , c , 0.8 e i 0.4 π , 0.2 e i 0.3 π ( d , 0.6 e i 0.3 π ,   0.4 e i 0.4 π )
and
Ɓ 0.8 = a b , 0.6 e i 0.4 π , 0.4 e i 0.7 π b c , 0.7 e i 0.4 π , 0.3 e i 0.7 π c d , 0.6 e i 0.3 π , 0.4 e i 0.4 π d a , 0.5 e i 0.2 π , 0.3 e i 0.5 π
Definition 4.
Let Ğ t = ( Ą t , Ɓ t ) be a CTIFG. Then H t = ( Ą t , Ɓ t ) is considered a complex intuitionistic subgraph (CTISG) if Ą t Ą t and Ɓ t Ɓ t .
Definition 5.
A CTIFG Ğ t = ( Ą t , Ɓ t ) is termed a complete CTIFG if it satisfies the following conditions:
  ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 ,   ʊ 2 = ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t ʊ 2 e i ϻ ϖ Ğ Ą t ʊ 1 ,   ϻ ϖ Ğ Ą t ʊ 2
ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϼ ς Ğ Ɓ t ʊ 1 ,   ʊ 2 = ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ą t ʊ 2   e i     ϼ ς Ğ Ą t ʊ 1 ,   ϼ ς Ğ Ą t ʊ 2 ,   ʊ 1 , ʊ 2 E .
Example 2.
Figure 2 illustrates the entire -CTIFG Ğ 0.7 .
Definition 6.
In CTIFGs, the order is defined as follows
O Ğ t = ʊ 1 V ϻ Ğ Ą t ʊ 1   e i   ʊ 1 V ϻ ϖ Ğ Ą t ʊ 1   , ʊ 1 V ϼ Ğ A t ʊ 1 e i   ʊ 1 V ϼ ς Ğ Ą t ʊ 1
Example 3.
The order of the CTIFG Ğ t is ( 2.7 e i 1.6 π , 1.3 e i 1.9 π ) from Example 1.
Definition 7.
The CTIFG has a size defined by
S Ğ t = ʊ 1 , ʊ 2 E ϻ Ğ Ą t ʊ 1 , ʊ 2 e i   ϻ ϖ Ğ Ą t ʊ 1 , ʊ 2 , ʊ 1 , ʊ 2 E ϼ Ğ Ą t ʊ 1 , ʊ 2 e i   ϼ ς Ğ Ą t ʊ 1 , ʊ 2
Definition 8.
In CTIFGs, the degree of vertex ʊ 1 in Ğ t is defined as follows,
1.
d e g Ğ t ʊ 1 = d e g ϻ Ğ Ɓ t ʊ 1 , d e g ϼ Ğ Ɓ t ʊ 1
d e g Ğ t ʊ 1 = ʊ 1 , ʊ 2 E ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i   ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 , ʊ 1 , ʊ 2 E ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i   ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2
2.
The minimum degree δ Ğ t of CTIFG is given by
δ ( Ğ t ) = δ ϻ Ğ Ɓ t Ğ t e i δ ϻ ϖ Ğ Ɓ t Ğ t , δ ϼ Ğ Ɓ t Ğ t e i δ ϼ ς Ğ Ɓ t Ğ t
δ Ğ t = { d e g   ϻ Ğ Ɓ t ʊ 1 } e i   { d e g   ϻ ϖ Ğ Ɓ t ʊ 1 } , d e g   ϼ Ğ Ɓ t ʊ 1 e i   { d e g   ϼ ς Ğ Ɓ t ʊ 1 } ʊ 1 V
3.
The maximum degree Ğ t of CTIFG is given by
Ğ t = ϻ Ğ Ɓ t Ğ t e i ϻ ϖ Ğ Ɓ t Ğ t , ϼ Ğ Ɓ t Ğ t e i ϻ ϖ Ğ Ɓ t Ğ t
Ğ t = d e g ϻ Ğ Ɓ t ʊ 1 e i { d e g ϻ ϖ Ğ Ɓ t ʊ 1 } , , { d e g   ϼ Ğ Ɓ t ʊ 1 } e i { d e g ϼ Ğ Ɓ t ʊ 1 } ʊ 1 V
Example 4.
From Example 1, The degree of a vertex in Ğ t is
d e g Ğ t a = ( 1.1 e i 0.7 π , 0.7 e i 1.2 π ) ;   d e g Ğ t b = 1.3 e i 1.8 π ,   0.7 e i 1.4 π ;  
d e g Ğ t c = 1.3 e i 0.7 π , 0.7 e i 1.1 π ;   d e g Ğ t d = ( 1.1 e i 0.6 π , 0.7 e i 0.9 π ) .

3. Operations on CTIFG

3.1. Cartesian Product of CTIFG

Definition 9.
Let Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) be any two CTIFGs of G = (V, E) and G′= (V′, E′), respectively. The Cartesian product Ğ t × Ğ t of two CTIFG, Ğ t   and Ğ t is defined by ( Ą t × Ą t ,   Ɓ t × Ɓ t ) , where Ą t × Ą t and Ɓ t × Ɓ t are CTISs on V × V = ʊ 1 , 1 , ʊ 2 , 2 : ʊ 1 ,   ʊ 2 V ; 1   ,   2 V and E × E = ʊ 1 , 1 , ʊ 2 , 2 : ʊ 1 = ʊ 2 , ʊ 1   ,   ʊ 2 V , 1 , 2 E   U   ʊ 1 , 1 , ʊ 2 , 2 : 1 = 2 , 1 ,   2 V , ʊ 1 , ʊ 2 E   U   ʊ 1 , 1 , ʊ 2 , 2 : 1 2 , ʊ 1 ʊ 2 , 1 , 2 E , ʊ 1 , ʊ 2 E , respectively, which satisfy the following conditions.
1.
ʊ 1 , 1 V × V
(a) 
ϻ Ğ Ą t × Ą t ʊ 1 , 1 e i ϻ ϖ Ğ Ą t × Ą t ʊ 1 , 1 = ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t 1
(b) 
ϼ Ğ Ą t × Ą t ʊ 1 , 1 e i ϼ ς Ğ Ą t × Ą t ʊ 1 , 1 = ϼ Ğ Ą t ʊ 1 , ϼ ϑ Ğ Ą t 1 e i ϼ ς Ğ Ą t ʊ 1 , ϼ ς Ğ Ą t 1
2.
If  ʊ 1 = ʊ 2  and    1 , 2 E
(a) 
ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ɓ t 1 , 2
(b) 
ϼ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϼ Ğ Ą t ʊ 1 ,   ϼ Ğ Ɓ t 1 , 2 e i ϼ ς Ğ Ą t ʊ 1 ,   ϼ ς Ğ Ɓ t 1 ,   2
3.
If  1 = 2  and   ʊ 1 , ʊ 2 E
(a) 
ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ ϖ Ğ Ą t 1
(b) 
ϼ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϼ Ğ Ɓ t ʊ 1 ,   ʊ 2 ,   ϼ Ğ Ą t 1 e i   ϼ ς Ğ Ɓ t ʊ 1 ,   ʊ 2 ,   ϼ ς Ğ Ą t 1
Example 5.
Figure 3 and Figure 4 illustrate two CTIFGs, Ğ t and Ğ t , which are the elements of consideration. The Cartesian product Ğ 0.6 × Ğ 0.6 , which corresponds to them, is seen in Figure 5.
Definition 10.
The degree of a vertex in Ğ t × Ğ t is defined as follows: for any ( ʊ 1 , 1 ) V × V ,  
d e g   G t × G t ʊ 1 , 1 = deg ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 , , d e g ϼ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2
where
deg ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 = ʊ 1 = ʊ 2 , 1 , 2 E   ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ɓ t 1 , 2   e i ʊ 1 = ʊ 2 , 1 , 2 E   ϻ ϖ Ğ Ą t ʊ 1 ,   ϻ ϖ   Ğ Ɓ t 1 , 2 +   1 = 2 , ʊ 1 , ʊ 2 E   ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t t 1 e i   1 = 2 , ʊ 1 , ʊ 2 E   ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϻ ϖ Ğ Ą t t 1
and
deg ϼ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i   ϼ ς Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 2 , 2 = ʊ 1 = ʊ 2 , 1 , 2 E   ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ɓ t 1 , 2 e i   ʊ 1 = ʊ 2 , 1 , 2 E   ϼ ς Ğ Ą t ʊ 1 ,   ϼ ς   Ğ Ɓ t 1 , 2 +   1 = 2 , ʊ 1 , ʊ 2 E   ϼ Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ Ğ Ą t t 1   e i     1 = 2 , ʊ 1 , ʊ 2 E   ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 ,     ϼ ς   Ğ Ą t t 1
Theorem 1.
Two CTIFGs are Cartesian products, and the result is another CTIFG.
Proof. 
For A t × A t the condition is obvious. Assuming that ʊ 1 V and 1 , 2 E
then,
ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 = ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ą t ʊ 1 ,   ϻ ϖ Ğ Ɓ t 1 , 2 ϻ Ğ Ą t u 1 , { ϻ Ğ Ą t 1 , ϻ Ğ Ą t 2 } e i ϻ ϖ Ğ Ą t u 1 , { ϻ ϖ Ğ Ą t 1 , ϻ ϖ   Ğ Ą t 2 } ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t 1 , ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t 2
e i ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t 1 , { ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t 2 = ϻ Ğ Ą t × Ą t ʊ 1 , 1 , ϻ Ğ Ą t × Ą t 1 , 2 e i ϻ ϖ Ğ Ą t × Ą t ʊ 1 , 1 ,   ϻ ϖ Ğ Ą t × Ą t 1 , 2
Conseqʊently,
ϻ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 e i ϻ ϖ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 ϻ Ğ Ą t × Ą t ʊ 1 , 1 , ϻ Ğ Ą t × Ą t 1 , 2 e i ϻ ϖ Ğ Ą t × Ą t ʊ 1 , 1 ,   ϻ ϖ Ğ Ą t × Ą t 1 , 2
if ʊ 1 V , 1 , 2 E . Similarly for,
ϼ Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 e i ϼ ς Ğ Ɓ t × Ɓ t ʊ 1 , 1 , ʊ 1 , 2 ϼ Ğ Ą t × Ą t ʊ 1 , 1 , ϼ Ğ Ą t × Ą t 1 , 2 e i ϼ ς Ğ Ą t × Ą t ʊ 1 , 1 ,   ϼ ς Ğ Ą t × Ą t 1 , 2
if ʊ 1 V , 1 , 2 E . Likewise, we can demonstrate it for w 1 V , ʊ 1 , ʊ 2 E .  □

3.2. Composistion of CTIFG

Definition 11.
The composition Ğ t Ğ t of two CTIFGs, Ğ t and Ğ t , is a CTIFG and defined as a pair ( Ą t Ą t ,   Ɓ t Ɓ t ) . Where Ą t Ą t and Ɓ t Ɓ t are CTISs on V × V = ʊ 1 , 1 , ʊ 2 , 2 : ʊ 1 ,   ʊ 2 V ; 1 ,   2 V and E × E = ʊ 1 , 1 , ʊ 2 , 2 : ʊ 1 = ʊ 2 , ʊ 1 ,   ʊ 2 V , 1 , 2 E   U   ʊ 1 , 1 , ʊ 2 , 2 : 1 = 2 , 1 , 2 V , ʊ 1 , ʊ 2 E   U   ʊ 1 , 1 , ʊ 2 , 2 : 1 2 , ʊ 1 ʊ 2 , 1 , 2 E , ʊ 1 , ʊ 2 E , respectively, which satisfies the following condition
1. 
( ʊ 1 , 1 V V
(a) 
ϻ Ğ Ą t Ą t ʊ 1 , 1 e i ϻ ϖ Ğ Ą t Ą t ʊ 1 , 1 = ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t 1
(b) 
ϼ Ğ Ą t Ą t ʊ 1 , 1 e i ϼ ς Ğ Ą t Ą t ʊ 1 , 1 = ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ą t 1 e i ϼ ς Ğ Ą t ʊ 1 , ϼ ς Ğ Ą t 1
2. 
If  ʊ 1 = ʊ 2  and    1 , 2 E ,
(i) 
ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ą t ʊ 1 ,   ϻ ϖ Ğ Ɓ t 1 , 2
(ii) 
ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ɓ t 1 , 2 e i ϼ ς Ğ Ą t ʊ 1 ,   ϼ ς Ğ Ɓ t 1 ,   2
3. 
If  1 = 2  and    ʊ 1 , ʊ 2 E ,
(a) 
ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϻ ϖ Ğ Ą t 1
(b) 
ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϼ Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ Ğ Ą t 1 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϼ ς Ğ Ą t 1
4. 
If  1 2  and    ʊ 1 , ʊ 2 E ,
(a) 
ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t 1 , ϻ Ğ Ą t 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϻ ϖ Ğ Ą t 1 ,   ϻ ϖ Ğ Ą t 2
(b) 
ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2
= ϼ Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ Ğ Ą t 1 , ϼ Ğ Ą t 2 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϼ ς Ğ Ą t 1 ,   ϼ ς Ğ Ą t 2
Example 6.
Consider the two CTIFG Ğ t and Ğ t illustrated in Figure 6. Then, their corresponding composition Ğ t   Ğ t is in Figure 7.
Definition 12.
The following defines the degree of a vertex in Ğ t Ğ t for any
ʊ 1 , 1 V × V ; d e g Ğ t Ğ t   ʊ 1 , 1 = deg ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2   , , deg ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i   ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 .
where
deg ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2   = ʊ 1 = ʊ 2 , 1 , 2 E   ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ɓ t 1 , 2 e i ʊ 1 = ʊ 2 , 1 , 2 E   ϻ ϖ Ğ Ą t ʊ 1 ,   ϻ ϖ Ğ Ɓ t 1 , 2   +     1 = 2 , ʊ 1 , ʊ 2 E   ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t 1 e i     1 = 2 , ʊ 1 , ʊ 2 E   ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϻ ϖ Ğ Ą t 1     +   1 2 , ʊ 1 , ʊ 2 E   ϻ Ğ Ɓ t ʊ 1 , ʊ 2 , ϻ Ğ Ą t 1 , ϻ Ğ Ą t 2 e i     1 2 , ʊ 1 , ʊ 2 E   ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϻ ϖ Ğ Ą t 1 ,   ϻ ϖ Ğ Ą t 2  
and
deg ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2 e i ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 , ʊ 2 , 2   = ʊ 1 = ʊ 2 , 1 , 2 E   ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ɓ t 1 , 2 e i ʊ 1 = ʊ 2 , 1 , 2 E   ϼ ς Ğ Ą t ʊ 1 ,   ϼ ς Ğ Ɓ t 1 , 2   +   1 = 2 , ʊ 1 , ʊ 2 E   ϼ Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ Ğ Ą t 1 e i     1 = 2 , ʊ 1 , ʊ 2 E   ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 ,   ϼ ς Ğ Ą t 1     +   1 2 , ʊ 1 , ʊ 2 E   ϼ Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ Ğ Ą t 1 , ϼ Ğ Ą t 2 e i     1 2 , ʊ 1 , ʊ 2 E   ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 , ϼ ς Ğ Ą t 1 ,   ϼ ς Ğ Ą t 2

3.3. Union of CTIFG

Definition 13.
Let G = (V, E) and G′ = (V′, E′) be any two CTIFGs, such that Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) . The union Ğ t Ğ t of these two CTIFGs is defined, under certain assumptions, as ( Ą t Ą t , Ɓ t Ɓ t ) , where Ą t Ą t and Ɓ t Ɓ t , respectively, represent CTIS on V V and E E , which satisfies the following condition,
(1) 
If  ʊ 1 V  and  ʊ 1 V
(a) 
ϻ Ğ Ą t Ą t ʊ 1 e i ϻ ϖ Ğ Ą t Ą t ʊ 1 = ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1
(b) 
ϼ Ğ Ą t Ą t ʊ 1 e i ϼ ς Ğ Ą t Ą t ʊ 1 = ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1
(2) 
If  ʊ 1 V  and  ʊ 1 V
(a) 
ϻ Ğ Ą t Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 = ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1
(b) 
ϼ Ğ Ą t Ą t ʊ 1 e i ϼ ς Ğ Ą t Ą t ʊ 1 = ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1
(3) 
If  ʊ 1 V V
(a) 
ϻ Ğ Ą t Ą t ʊ 1 e i ϻ ϖ Ğ Ą t Ą t ʊ 1 = { ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t ʊ 1 } e i { ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t ʊ 1 }
(b) 
ϼ Ğ Ą t Ą t ʊ 1 e i ϼ ς Ğ Ą t Ą t ʊ 1 = { ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ą t ʊ 1 } e i { ϼ ς Ğ Ą t ʊ 1 , ϼ ς Ğ Ą t ʊ 1 }
(4) 
If ( ʊ 1 , 1 ) E and ( ʊ 1 , 1 ) E
(a) 
ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 )
(b) 
ϼ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 = ϼ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t ( ʊ 1 , 1 )
(5) 
If  ( ʊ 1 , 1 ) E  and  ( ʊ 1 , 1 ) E
(a) 
ϻ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) = ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , 1
(b) 
ϼ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) = ϼ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t ʊ 1 , 1
(6) 
If  ( ʊ 1 , 1 ) E E
(a) 
ϻ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 )
=   { ϻ Ğ Ɓ t ( ʊ 1 , 1 ) , ϻ Ğ Ɓ t ( ʊ 1 , 1 ) } e i { ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) ,   ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) }
(b) 
ϼ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t Ɓ t ( ʊ 1 , 1 )
=   { ϼ Ğ Ɓ t ( ʊ 1 , 1 ) , ϼ Ğ Ɓ t ( ʊ 1 , 1 ) } e i { ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) , ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) }
Example 7.
Consider the two 0.7 e i 0.6 π -CTIFG Ğ t   and Ğ t shown in Figure 8 and Figure 9. Figure 10 depicts the graphical representation of the union. Ğ 0.7 Ğ 0.7 of two 0.7-CTIFG Ğ 0.7   a n d   Ğ 0.7 .
Definition 14.
The degree of vertex ( ʊ 1 , 1 ) at a CTIFG for any ( ʊ 1 , 1 ) V × V
d e g Ğ t Ğ t ʊ 1 , 1 = deg ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 e i   ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 , , deg ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 e i   ϼ ς Ğ Ɓ t Ɓ t ʊ 1 ,   1
where
deg ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1 e i   ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1 = ʊ 1 ,   1 E   , ʊ 1 ,   1 E   ϻ Ğ Ɓ t ʊ 1 , 1 e i ʊ 1 ,   1 E   , ʊ 1 ,   1 E   ϻ ϖ Ğ Ɓ t ʊ 1 , 1   +   ʊ 1 ,   1 E , ʊ 1 , 1 E   ϻ Ğ Ɓ t ʊ 1 , 1 e i   ʊ 1 , 1 E , ʊ 1 , 1 E   ϻ ϖ Ğ Ɓ t ʊ 1 , 1 +   ( ʊ 1 ,   1 ) E E   { ϻ Ğ Ɓ t ( ʊ 1 , 1 ) , ϻ Ğ Ɓ t ( ʊ 1 , 1 ) } e i     ( ʊ 1 , 1 ) E E     { ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) ,   ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) } ,
and
deg ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1 e i   ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1 = ʊ 1 , 1 E   , ʊ 1 , 1 E   ϼ Ğ Ɓ t ʊ 1 , 1 e i ʊ 1 ,   1 E   , ʊ 1 ,   1 E   ϼ ς Ğ Ɓ t ʊ 1 ,   1 +   ʊ 1 , 1 E , ʊ 1 , 1 E   ϼ Ğ Ɓ t ʊ 1 , 1 e i   ʊ 1 , 1 E , ʊ 1 ,   1 E   ϼ ς Ğ Ɓ t ʊ 1 ,   1 +   ( ʊ 1 , 1 ) E E     { ϼ Ğ Ɓ t ( ʊ 1 , 1 ) , ϼ Ğ Ɓ t ( ʊ 1 , 1 ) } e i   ( ʊ 1 , 1 ) E E     { ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) ,   ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) }

3.4. Join of CTIFG

Definition 15.
Consider two CTIFGs Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) . The CTIFGs’ join operation Ğ t + Ğ t is described as ( Ą t + Ą t , Ɓ t + Ɓ t ), where Ą t + Ą t produces a CTIFG on V V and Ɓ t + Ɓ t forms a CTIFG on E E E , subject to certain requirements.
(1) 
If  ʊ 1 V  and  ʊ 1 V
(a) 
ϻ Ğ Ą t + Ą t ʊ 1 e i ϻ ϖ Ğ Ą t + Ą t ʊ 1 = ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1
(b) 
ϼ Ğ Ą t + Ą t ʊ 1 e i ϼ ς Ğ Ą t + Ą t ʊ 1 = ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1
(2) 
If  ʊ 1 V  and  ʊ 1 V
(a) 
ϻ Ğ Ą t + Ą t ʊ 1 e i ϻ ϖ Ğ Ą t + Ą t ʊ 1 = ϻ ϑ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1
(b) 
ϼ Ğ Ą t + Ą t ʊ 1 e i ϼ ς Ğ Ą t + Ą t ʊ 1 = ϼ ϑ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1
(3) 
If  ʊ 1 V V
(a) 
ϻ Ğ Ą t + Ą t ʊ 1 e i ϻ ϖ Ğ Ą t + Ą t ʊ 1 = { ϻ Ğ Ą t ʊ 1 , ϻ Ğ Ą t ʊ 1 } e i { ϻ ϖ Ğ Ą t ʊ 1 , ϻ ϖ Ğ Ą t ʊ 1 }
(b) 
ϼ Ğ Ą t + Ą t ʊ 1 e i ϼ ς Ğ Ą t + Ą t ʊ 1 = { ϼ Ğ Ą t ʊ 1 , ϼ Ğ Ą t ʊ 1 } e i { ϼ ς Ğ Ą t ʊ 1 , ϼ ς Ğ Ą t ʊ 1 }
(4) 
If  ( ʊ 1 , 1 ) E  and  ( ʊ 1 , 1 ) E
(a) 
ϻ Ğ Ɓ t + Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t + Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 )
(b) 
ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t + Ɓ t ʊ 1 , 1 = ϼ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t ( ʊ 1 , 1 )
(5) 
If  ( ʊ 1 , 1 ) E  and  ( ʊ 1 , 1 ) E
(a) 
ϻ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t + Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 )
(b) 
ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t + Ɓ t ʊ 1 , 1 = ϼ ϑ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t ( ʊ 1 , 1 )
(6) 
If  ( ʊ 1 ) E E
(a) 
ϻ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i   ϻ ϖ Ğ Ɓ t + Ɓ t ʊ 1 , 1 =   { ϻ Ğ Ɓ t ( ʊ 1 , 1 ) , ϻ Ğ Ɓ t ( ʊ 1 , 1 ) } e i { ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) , ϻ ϖ Ğ Ɓ t ( ʊ 1 , 1 ) }
(b) 
ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t + Ɓ t ʊ 1 , 1 = { ϼ Ğ Ɓ t ( ʊ 1 , 1 ) , ϼ Ğ Ɓ t ( ʊ 1 , 1 ) } e i { ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) , ϼ ς Ğ Ɓ t ( ʊ 1 , 1 ) }
(7) 
If  ( ʊ 1 , 1 ) E
(a) 
ϻ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 )   e i ϻ ϖ Ğ Ɓ t + Ɓ t ʊ 1 , 1 = { ϻ Ğ Ą t ( ʊ 1 ) , ϻ Ğ Ą t ( 1 ) } e i { ϻ ϖ Ğ Ą t ( ʊ 1 ) , ϻ ϖ ϻ Ğ Ą t ( 1 ) }
(b) 
ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t + Ɓ t ʊ 1 , 1 = { ϼ Ğ Ą t ( ʊ 1 ) , ϼ ϻ Ğ Ą t ( 1 ) } e i { ϼ ς Ğ Ą t ( ʊ 1 ) , ϼ ς ϻ Ğ Ą t ( 1 ) }
Example 8.
The graphical depiction of CTIFG Ğ t + Ğ t in Figure 11 is from Example 7.
Definition 16.
Consider the following two CTIFGs Ğ t and Ğ t . The vertex degree in the CTIFG Ğ t + Ğ t is described below. For any ʊ 1 , 1 V × V .
d e g Ğ t + Ğ t ʊ 1 , 1 = deg ϻ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   e i ϻ ϖ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   deg ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )
where
deg ϻ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   e i ϻ ϖ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   = ( ʊ 1 V × V   ϻ Ğ Ą t Ą t ʊ 1 e i   ʊ 1 V × V   ϻ ϖ Ğ Ą t Ą t ʊ 1 + ʊ 1 , 1 E E ϻ Ğ Ɓ t Ɓ t ʊ 1 , 1     e i ʊ 1 , 1 E E ϻ ϖ Ğ Ɓ t Ɓ t ʊ 1 , 1     +   ʊ 1 , 1 E     { ϻ Ğ Ą t ( ʊ 1 ) , ϻ Ğ Ą t ( 1 ) }   e i   ( ʊ 1 , 1 ) E     { ϻ ϖ Ğ Ą t ( ʊ 1 ) , ϻ ϖ Ğ Ą t ( 1 ) } )
and
deg ϼ Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   e i ϼ ς Ğ Ɓ t + Ɓ t ( ʊ 1 , 1 , ʊ 1 , 1 )   = ( ʊ 1 V × V   ϼ Ğ Ą t Ą t ʊ 1 e i   ʊ 1 V × V   ϼ ς Ğ Ą t Ą t ʊ 1 + ʊ 1 , 1 E E ϼ Ğ Ɓ t Ɓ t ʊ 1 , 1     e i ʊ 1 , 1 E E ϼ ς Ğ Ɓ t Ɓ t ʊ 1 , 1     +   ʊ 1 , 1 E     { ϼ Ğ Ą t ( ʊ 1 ) , ϼ Ğ Ą t ( 1 ) }   e i   ( ʊ 1 , 1 ) E     { ϼ ς Ğ Ą t ( ʊ 1 ) ,     ϼ ς Ğ Ą t ( 1 ) } )
Theorem 2.
For any two CTIFGs Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) of G = (V,E) and G′ = (V′,E′), respectively, where V V , their union Ğ t Ğ t = ( Ą t Ą t , Ɓ t Ɓ t ) is a CTIFG of G = G G′ iff G t and G t are CTIFG of G and G′, respectively.
Proof. 
Let us assume a CTIFG, Ğ t Ğ t . Let ʊ 1 , 1 E , ( ʊ 1 , 1 ) E , and ʊ 1 , 1 V   V .
Consider
ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϻ ϖ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) { ϻ   Ğ Ą t Ą t ʊ 1 , ϻ   Ğ Ą t Ą t 1 } e i { ϻ ϖ   Ğ Ą t Ą t ʊ 1 , ϻ ϖ   Ğ Ą t Ą t 1 } = { ϻ   Ğ Ą t ʊ 1 , ϻ   Ğ Ą t 1 } e i { ϻ ϖ   Ğ Ą t ʊ 1 , ϻ ϖ   Ğ Ą t 1 }
Consequently,
ϼ Ğ Ɓ t ʊ 1 , 1 e i ϼ ς Ğ Ɓ t ʊ 1 , 1 = ϼ Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t Ɓ t ( ʊ 1 , 1 ) { ϼ   Ğ Ą t Ą t ʊ 1 , ϼ   Ğ Ą t Ą t 1 } e i { ϼ ς   Ğ Ą t Ą t ʊ 1 , ϼ ς   Ğ Ą t Ą t 1 } = { ϼ   Ğ Ą t ʊ 1 , ϼ   Ğ Ą t 1 } e i { ϼ ς   Ğ Ą t ʊ 1 , ϼ ς   Ğ Ą t 1 }
This establishes Ğ t = ( Ą t , Ɓ t ) as a CTIFG. Similarly, we conclude that Ğ t = ( Ą t , Ɓ t ) is a CTIFG of G . Assuming Ğ t and Ğ t and understanding that the merging of two CTIFGs generates a CTIFG, it follows that Ğ t Ğ t . □

4. Isomorphism of CTIFGs

This section introduces the concepts of homomorphism and isomorphism of CTIFG and explores the essential properties of these ideas.
Definition 17.
Let Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) be any two CTIFG of G = (V, E) and G′ = (V′, E′) respectively. A homomorphism θ from CTIFG Ğ t and Ğ t is a mapping θ : V V satisfying the following conditions:
1.
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 ϻ Ğ Ą t θ ʊ 1 e i ϻ ϖ Ğ Ą t θ ʊ 1
ϼ ς Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1 ϼ Ğ Ą t θ ʊ 1 e i ϼ ς Ğ Ą t θ ʊ 1 ; ʊ 1 V .
2.
ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ ϼ Ğ Ɓ t ʊ 1 , 1 ϻ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϻ ϖ Ğ Ɓ t θ ʊ 1 , θ 1 ,
ϼ Ğ Ɓ t ( ʊ 1 , 1 ) e i ϼ ς Ğ Ɓ t ʊ 1 , 1 ϼ Ğ Ɓ t ( θ ( ʊ 1 ) , θ ( 1 ) ) e i ϼ ς Ğ Ɓ t θ ʊ 1 , θ 1 ; ( ʊ 1 , 1 ) E .
Definition 18.
A weak isomorphism θ : V V , from CTIFG Ğ t to Ğ t must meet the following conditions the following condition:
ϻ   Ğ Ą t ʊ 1 e i   ϻ ϖ Ğ Ą t ʊ 1 ϻ   Ğ Ą t θ ʊ 1 e i   ϻ ϖ Ğ Ą t θ ʊ 1 ,
ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1 ϼ Ğ Ą t θ ʊ 1 e i   ϼ ς Ğ Ą t θ ʊ 1 ;   ʊ 1 V
Definition 19.
A strong co-isomorphism is defined as a bijective mapping θ : V V between any two CTIFGs, Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) of G = (V,E) and G′ = (V′,E′), respectively, that meets the following conditions:
1.
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 ϻ Ğ Ą t θ ʊ 1 e ϻ ϖ Ğ Ą t θ ʊ 1 ,
ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1 ϼ Ğ Ą t θ ʊ 1 e i ϼ ς Ğ Ą t θ ʊ 1 ; ʊ 1 V .
2.
ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , 1 ϻ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϻ ϖ Ğ Ɓ t θ ʊ 1 , θ 1 ,
ϼ Ğ Ɓ t ʊ 1 , 1 e i ϼ ς Ğ Ɓ t ʊ 1 , 1 ϼ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϼ ς Ğ Ɓ t θ ʊ 1 , θ 1 ,   ( ʊ 1 , 1 ) E .
3.
ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϻ ϖ Ğ Ɓ t θ ʊ 1 , θ 1 ,
ϼ Ğ Ɓ t ʊ 1 , 1 e i ϼ ς Ğ Ɓ t ʊ 1 , 1 = ϼ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϼ ς Ğ Ɓ t θ ʊ 1 , θ 1 ,   ( ʊ 1 , 1 ) E .
Definition 20.
An isomorphism between CTIFGs Ğ t = ( Ą t , Ɓ t ) and Ğ t = ( Ą t , Ɓ t ) is a bijective homomorphism mapping θ : V V (written as Ğ t   Ğ t ) that satisfies the following condition:
1.
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 ϻ Ğ Ą t θ ʊ 1 e ϻ ϖ Ğ Ą t θ ʊ 1 ,
ϼ Ğ Ą t ʊ 1 e i ϼ ς Ğ Ą t ʊ 1 ϼ Ğ Ą t θ ʊ 1 ,   ʊ 1 V .
2.
ϻ Ğ Ɓ t ʊ 1 , 1 e i ϻ ϖ Ğ Ɓ t ʊ 1 , 1 = ϻ Ğ Ɓ t θ ʊ 1 , θ 1 e i ϻ ϖ Ğ Ɓ t θ ʊ 1 , θ 1 ,
ϼ Ğ Ɓ t ʊ 1 , 1 e i ϼ ς Ğ Ɓ t ʊ 1 , 1 = ϼ Ğ Ɓ t θ ʊ 1 , θ 1 , ( ʊ 1 , 1 ) E .
Example 9.
Take into consideration Ğ t and Ğ t as displayed in Figure 12 and Figure 13 based on the following figures.
According to definition (20), the mapping ζ(a) = g, ζ(b) = f, and ζ(c) = e gives us  Ğ 0.8 Ğ 0.8 .
Theorem 3.
The characteristics of an equivalence relation are satisfied by the connection of isomorphism between CTIFGs.
Proof. 
Both symmetry and reflexivity are clear. The isomorphism of Ğ t onto Ğ t and Ğ t onto Ğ t   , respectively, are denoted by the notations φ : V V and θ : V V . Accordingly, θ φ : V V is a bijective map from V to V , and it is defined as follows:
θ φ ʊ 1 = θ φ ʊ 1 ,   ʊ 1 V .
For a map φ : V V defined by φ ʊ 1 = 1 , ʊ 1 V , it is an isomorphism.
Considering definition (20), we have
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 = ϻ Ğ Ą t φ ʊ 1 e i ϻ ϖ Ğ Ą t φ ʊ 1 = ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ą t φ ʊ 1 , ʊ 1 V
  ϼ Ğ Ą t ʊ 1 e i ϼ ς Ą t ʊ 1 = ϼ Ğ Ą t φ ʊ 1 e i ϼ ς Ğ Ą t φ ʊ 1 = ϼ Ğ Ą t 1 e i ϼ ς Ğ Ą t 1 , ʊ 1 V
and
ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 = ϻ Ğ Ɓ t φ ʊ 1 , φ ʊ 2 e i ϻ ϖ Ğ Ɓ t φ ʊ 1 , φ ʊ 2   = ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ɓ t 1 , 2 , ( ʊ 1 , ʊ 2 ) E
ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 = ϼ Ğ Ɓ t φ ʊ 1 , φ ʊ 2 e i ϼ ς Ğ Ɓ t φ ʊ 1 , φ ʊ 2   = ϼ Ğ Ɓ t 1 , 2 e i ϼ ς Ğ Ɓ t 1 , 2 ( ʊ 1 , ʊ 2 ) E
In the same way, we obtained that
ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ą t 1 = ϻ Ğ Ą t v 1 e i ϻ ϖ Ğ Ą t v 1 ,   1 V
ϼ Ğ Ą t 1 e i ϼ ς Ğ Ą t 1 = ϼ Ğ Ą t v 1 e i ϼ ς Ğ Ą t v 1 ,   1 V  
and
  ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ɓ t 1 , 2 = ϻ Ğ Ɓ t v 1 , v 2 e i ϻ ϖ Ğ Ɓ t v 1 , v 2 , ( 1 , 2 ) E
ϼ Ğ Ɓ t 1 , 2 e i ϼ ς Ğ Ɓ t 1 , 2 = ϼ Ğ Ɓ t v 1 , v 2 e i ϼ ς Ğ Ɓ t v 1 , v 2 , ( 1 , 2 ) E
By using the relations (1), (3), and φ ʊ 1 = 1   ,   ʊ 1 V , we have
ϻ Ğ Ą t ʊ 1 e ϻ ϖ Ğ Ą t ʊ 1 = ϻ Ğ Ą t φ ʊ 1 e i ϻ ϖ Ğ Ą t φ ʊ 1   = ϻ Ğ Ą t 1 e i ϻ ϖ Ğ Ą t 1   = ϻ Ğ Ą t θ 1 e i ϻ ϖ Ğ Ą t θ 1   = ϻ Ğ Ą t θ φ ʊ 1 e i   ϻ ϖ Ğ Ą t θ φ ʊ 1
By using the relations (3), (7), and φ ʊ 1 = 1   ,   ʊ 1 V , we have
ϼ Ğ Ą t ʊ 1 e ϼ ς Ğ Ą t ʊ 1 = ϼ Ğ Ą t φ ʊ 1 e i ϼ ς Ğ Ą t φ ʊ 1   = ϼ Ğ Ą t 1 e i ϼ ς Ğ Ą t 1   = ϼ Ğ Ą t θ 1 e i ϼ ς Ğ Ą t θ 1   = ϼ Ğ Ą t θ φ ʊ 1 e i   ϼ ς Ğ Ą t θ φ ʊ 1
When using the relations (4) and (10), the outcome is
ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 = ϻ Ğ Ɓ t 1 , 2 e i ϻ ϖ Ğ Ɓ t 1 ,   2   = ϻ Ğ Ɓ t θ 1 , θ 2 e ϻ ϖ Ğ Ɓ t θ 1   ,   θ 2   = ϻ Ğ Ɓ t θ φ ʊ 1 , θ φ ʊ 2 e i ϻ ϖ Ğ Ɓ t θ φ ʊ 1 ,   θ φ ʊ 2
When using the relations (6) and (12), the out come is
ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 = ϼ Ğ Ɓ t 1 , 2 e i ϼ ς Ğ Ɓ t 1 ,   2   = ϼ Ğ Ɓ t θ 1 , θ 2 e ϼ ς Ğ Ɓ t θ 1 ,   θ 2   = ϼ Ğ Ɓ t θ φ ʊ 1 , θ φ ʊ 2 e i ϼ ς Ğ Ɓ t θ φ ʊ 1 ,   θ φ ʊ 2
Hence, Ğ t and Ğ t are isomorphic to each other via θ φ . As a result, the proof is finished. □
Theorem 4.
A partial ordering relation between CTIFGs is a weak isomorphism.
Proof. 
The reflexivity and transitivity are obvious. To prove anti-symmetry, let φ : V V be a strong isomorphism of Ğ t onto Ğ t . Then, φ is a bijective map defined by φ ʊ 1 = ʊ 2 , for all ʊ 1 V satisfying
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 = ϻ Ğ Ą t φ ʊ 1 e i ϻ ϖ Ğ Ą t φ ʊ 1 , ʊ 1 V
  ϼ Ğ Ą t ʊ 1 e i ϼ ς Ą t ʊ 1 = ϼ Ğ Ą t φ ʊ 1 e i ϼ ς Ğ Ą t φ ʊ 1 , ʊ 1 V
and
ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 = ϻ Ğ Ɓ t φ ʊ 1 , φ ʊ 2 e i ϻ ϖ Ğ Ɓ t φ ʊ 1 , φ ʊ 2 , ( ʊ 1 , ʊ 2 ) E
ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 = ϼ Ğ Ɓ t φ ʊ 1 , φ ʊ 2 e i ϼ ς Ğ Ɓ t φ ʊ 1 , φ ʊ 2   ( ʊ 1 , ʊ 2 ) E
Let θ : V V be a strong isomorphism of Ğ t and Ğ t   . Then, θ is a bijective map defined by θ   ʊ 2 = ʊ 1 , for all ʊ 2 V satisfying
ϻ Ğ Ą t ʊ 1 e i ϻ ϖ Ğ Ą t ʊ 1 = ϻ Ğ Ą t θ ʊ 1 e i ϻ ϖ Ğ Ą t θ ʊ 1 , ʊ 2 V
  ϼ Ğ Ą t ʊ 1 e i ϼ ς Ą t ʊ 1 = ϼ Ğ Ą t θ ʊ 1 e i ϼ ς Ğ Ą t θ ʊ 1 , ʊ 2 V
and
ϻ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϻ ϖ Ğ Ɓ t ʊ 1 , ʊ 2 = ϻ Ğ Ɓ t θ ʊ 1 , θ ʊ 2 e i ϻ ϖ Ğ Ɓ t θ ʊ 1 ,   θ ʊ 2 , ʊ 1 , ʊ 2 E
ϼ Ğ Ɓ t ʊ 1 , ʊ 2 e i ϼ ς Ğ Ɓ t ʊ 1 , ʊ 2 = ϼ Ğ Ɓ t θ ʊ 1 ,   θ ʊ 2 e i ϼ ς Ğ Ɓ t θ ʊ 1 , θ ʊ 2   ( ʊ 1 , ʊ 2 ) E
Only in cases when Ğ t and Ğ t have an equal number of edges and corresponding edges with the same weight do the inequalities (9), (10), (11), and (12) hold on the finite sets V and V . G t and G t are hence the same. As a result, Ğ t and Ğ t are strongly isomorphized by φ θ . The proof is now complete. □

5. Real World Applications of Rubber Industrial Waste Water

This paper focuses on the application of industrial wastewater that has been treated at different parameters using CTIFGs. The major physicochemical parameters that are considered for stabilizing the rubber industrial waste water are turbidity, BOD, and COD, where they play an active role in identifying the pollutant level. Using an easy approach with the support of an intuitionistic fuzzy graph, the performance of the treatment is assessed.

5.1. Experiment Description

In this experiment, the CTIFGs play a significant role in investigating the rubber industrial wastewater parameters. The CTIFGs are incorporated with decision-making support, which enables the evaluation of complicated data sets and typically estimates the importance of effluent parameters such as Biological Oxygen Demand (BOD), Chemical Oxygen Demand (COD), pH, alkalinity, nitrogen, phosphorous, and turbidity.
The CTIFGs in this stage outlined the truth-membership and the falsity-membership roles for the characterization of parameters connected with the degree of alignment or the factors considering divergence.

Findings

1.
CTIFGs can initiate the identification of the critical factors that directly contribute to the treatment of rubber industry effluent for fixing the decision-making components in association with complex parameters related to the effluents.
2.
CTIFGs can flexibly used to examine the comparison among effluent parameters and give prior importance to interventions that allow the decision-making module to effectively identify more competitive decisions.
3.
The parameter that highlights ‘t’ in CTIFGs naturally causes the decision-makers to plot a graph associated with location-specific regional knowledge on effluent and to identify the typical problem associated with the domain, which naturally leads to identifying the optional targeted interventions and simultaneously giving preference for effluent treatment.
4.
The visualization of CTIFGs naturally provides a view of the complex relationships interlinked between the various effluent characterizations that are directly contributing to the formation of an effective pollution-free treated effluent that favors a toxic free zone environment.

5.2. Application of CTIFGs in Evaluating the Rubber Industrial Effluents

The pollutants in the synthesis of rubber industry naturally emit a larger volume of wastewater that is naturally treated before being subjected to final disposal in water bodies. The need for rubber and allied products is increasing day by day due to its vast applications. Addressing the mixed composition of waste materials in the rubber-synthesized effluent needs a meticulous treatment strategy that naturally controls the pollutants. Using the CTIFG, the role of decision-making parameters associated with effluent gives a clear picture of how to eliminate the pollutant. In addition to this, the importance of individual physicochemical parameters linked with the effluent is to be evaluated with the support of decision-making strategies, and necessary treatment strategies are also suggested. The important key factor associated with rubber effluent is BOD.
Regarding BOD P 1   , COD P 2 , pH P 3 , alkalinity P 4 , nitrogen P 5 , phosphorous P 6 , and turbidity P 7 , let M = P 1 , P 2 , P 3 , P 4 , P 5 , P 6 , P 7 be the physicochemical parameters that strongly contribute to the elimination of pollutants in the effluent. The values in each corner stone represents the characteristics of effluent and their linkage are connected with t-intuitionistic values. CTIFGs play an active role in covering the truth-membership factor and falsity-membership functions, which highlight the relationship among positive node and negative node of a single parameter. The parameter ‘t’ permits the decision-making process to give valuable suggestions through the CTIFGs, which will be a focused result for further processing. In addition, it will give an indication of risk factors and the possibility of uncertaininity. This process will give a clear picture through visual representation for an effective pollutant removal strategy. The important factors associated with the work are directly interlinked with truth-membership and falsity-membership, which determine certain features that are connected with the range of confidence level and concern confidence level. The importance of parameter ‘t’ in this stage normally covers the entire circumference and sensitivity parameters. The change in ‘t’ values at consecutive zones in the intuitionistic graphs determines the factor of acceptance of values at one end and simultaneously accepting the rejection of values at the other end. In addition to this, they also cover the factors of risk and uncertainity. During customization with CTIFGs, the role of ‘t’ plays a significant role as it may focus on numerous factors associated with the parameter in a concluding favorable path and, at the same time, consider the opposing point of view. These concepts may be crucial when facing unacceptable effluent discharge. Finalizing the threshold value with the CTIFGs is comfortable in identifying the sensitivity levels of the effluents. Table 2 displays the set of CIF and 0.8-CTIFs connected to the vertices and graphical representation given in Figure 14.

Algorithm to Investigate Rubber Industrial Wastewater Parameters Using CTIFGs

  • Step 1. Define parameters M = P 1 , P 2 , P 3 , P 4 , P 5 , P 6 , P 7 ( P 1 is BOD, P 2 is COD, P 3 is pH, P 4 is alkalinity, P 5 is nitrogen, P 6 is phosphorus, and P 7 is turbidity). Initialize the CTIFGs framework.
  • Step 2. Obtain effluent data from rubber industry samples. Preprocess data (manage missing values and outliers). Normalize the data for consistency.
  • Step 3. Establish truth-membership (t), indeterminacy (i), and falsity-membership (f) for each parameter.
  • Step 4. Use CTIFGs to determine parameter relevance. Calculate the alignment and divergence for each parameter.
  • Step 5. Use CTIFGs to compare parameters, prioritize actions, and emphasize the relevance of parameter t when visualizing effluent concerns.
  • Step 6. Use CTIFGs to visualize parameter correlations, make graphs and charts, detect issues, and recommend targeted remedies.
  • Step 7. Implement recommended treatment procedures, regularly check efficacy, and adapt tactics in response to data and feedback.
Table 2 displays the values identified in the edge R 13 , which normally connects the physicochemical parameters that determine the removal of pollutants in rubber industrial wastewater. In the assigned framework of the module, the edge R 13 = 0.7 e i 0.5 π , 0.3 e i   0.4 π and its truth membership value is 0.7 e i 0.5 π and the corresponding falsity membership is 0.3 e i   0.4 π these values indicate the correlation efforts. The outcome of this module connected with ‘t’ highlights an 80% possible reduction in pollutant removal.
Table 3 focuses on the application part (1) that correlated with the definition (8), and the respective outcomes are described.
The score value of each edge has been defined based on the below-mentioned equation.
S V = ϻ 2 + ( 1 ϼ ) 2 + 1 2 π ( ϖ 2 + ( 1 ς ) 2 ) , 1 j 7
With respect to Table 3 and using the scoring function formula, the results are obtained and have been highlighted in Table 4. The values in Table 4 are further considered for the visual depiction that has been represented in Figure 15, which is supported through the score function. Turbidity value P 7 = 5.1046 is obtained as the greatest value that naturally highlights the most influential factor for the removal of pollutants in the rubber industrial wastewater that is represented in terms of (parameter ‘t’). Table 4 clearly illustrates that the respective values associated with the module have a huge impact on treating industrial wastewater.

5.3. Performance Comparative Analysis

The CTIFGs play a significant role in fine-tuning the uncertainity module corresponding to individual parameters. A range of parameters, when subjected to diverse representation, gives a systematic and optimistic problem-solving source. The CTIFGs role is crucial in observing the change in degrees of vagueness and unwillingness. The graphical representation clearly highlights the uniformity in all elements that are considered equal links in the study, which correlates with the independence of truth, followed by falsity membership levels. In connection with this, the truth membership has been assigned a 0.6 value, which suggests a strong link; meanwhile, the falsity membership is assigned a 0.4 value, which implies a weak link among elements. The determination of uncertainity among the parameters in the linking factor shows consistency across and in all dimensions, highlighting greater accuracy in defining solutions for the removal of industrial pollution. The score values corresponding to the parameters associated with CTIFGs are highlighted in Table 4 and are graphically illustrated in Figure 15.

5.4. Sensitivity Analysis

The sensitivity analysis of the study is focused on considering the parameter ‘t’ in the CTIFGs that normally highlight the importance of the removal of pollutants from industrial wastewater. The major source incorporated in this analysis normally covers ‘t’, which facilitates the decision-makers to observe a balanced view on each elemental acceptance and rejection, which systematically observes the role of different levels of uncertainity and risk. The importance of decision-makers in the experimentation on varying situations is commonly associated with the value of ‘t’, which highlights the important key factors in suggesting the favorite confidence levels. The flexibility in the experimentation promotes effective decision-making support in unpredicted contexts and varying situations, which normally plays a significant path in handling the difficulties aligned with the pollutant removal from the rubber industrial wastewater. Further, the ability to adapt to ‘t’ helps the treatment of industrial effluent from a different perspective connected to risk and uncertainity; in this case, the decision-maker’s role plays a major part in prioritizing the operations.

6. Conclusions

The concept of CTIFGs has been presented in this study, and the fundamentals related to the rubber industrial wastewater physicochemical parameters have been clearly investigated. The CTIFGs comprise various studies and demonstrations that are incorporated in the graphical format, which is a representation of various sets of theoretical operations such as the Cartesian product, compositions, unions, and joints. In addition to that, a graphical representation of the above-mentioned operations is also depicted. The homomorphism and isomorphism concepts in the CTIFGs have been neatly presented. With the support of these advanced techniques, the application part has been studied to evaluate the pollutant removal from industrial rubber wastewater.
Current pollution prevention strategies have given a wide-ranging statement on the standard for effluent disposal and the norms have been followed in this observational study; when the value of parameter ‘t’ near 0 is used, distinct specificity is lacking. At the same time, a most relevant and superficial link has been generated for effective pollutant removal when the parameter ‘t’ value is associated closer to 1. It is clear that the parameter ‘t’ value in the CTIFGs indicates the level of degree of confidence or considers doubt on the rate of success relevant to the removal of pollutants from the industrial wastewater. These two factors play a significant role in classifying the metrics that determine the strongest association or considering the negligible impact pertaining to the desired outcome. Meanwhile, by engaging with this calibrated parameter, the decision-maker’s role may be accurately observed with regard to how the values on uncertainty are clearly portrayed, and at the same time, it also predicts the impacts on the analytical outcomes. Theses factors naturally result in obtaining a more complex and, at the same time, an adaptable strategical framework, which has been predicted for clearly addressing the fact on complex challenges that is associated with the removal of pollutant from industrial wastewater.
In future, the topological indicies of CTIFGs will be studied with suitable real time applications in decision-making problems like neural networks, Machine learning, and Artificial Intelligence.

Author Contributions

Conceptualization and methodology, M.K.; investigation, M.A.; writing-review and editing, M.R.; supervision, M.R.; project administration, G.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No data were used in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zadeh, L.A. Fuzzy set. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Zimmermann, H.J. Fuzzy set theory. Wiley Interdiscip. Rev. Comput. Stat 2010, 2, 317–332. [Google Scholar] [CrossRef]
  3. Zadeh, L.A. Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1978, 1, 3–28. [Google Scholar] [CrossRef]
  4. Shang, Y.G.; Yuan, X.H.; Lee, E.S. The n-dimensional fuzzy sets and Zadeh fuzzy sets based on the finite valued fuzzy sets. Comput. Math. Appl. 2010, 60, 442–463. [Google Scholar] [CrossRef]
  5. Saila, S.B. Application of fuzzy graph theory to successional analysis of a multispecies trawl fishery. Trans. Am. Fish. Soc. 1992, 121, 211–233. [Google Scholar] [CrossRef]
  6. Prakash, K.; Parimala, M.; Garg, H.; Riaz, M. Lifetime prolongation of a wireless charging sensor network using a mobile robot via linear diophantine fuzzy graph environment. Complex Intell. Syst. 2022, 8, 2419–2434. [Google Scholar] [CrossRef]
  7. Bhattacharya, A.; Pal, M. A fuzzy graph theory approach to the facility location problem: A case study in the Indian banking system. Mathematics 2023, 11, 2992. [Google Scholar] [CrossRef]
  8. Cao, B.; Zhao, J.; Lv, Z.; Gu, Y.; Yang, P.; Halgamuge, S.K. Multi objective evolution of fuzzy rough neural network via distributed parallelism for stock prediction. IEEE Trans. Fuzzy Syst. 2020, 28, 939–952. [Google Scholar] [CrossRef]
  9. Sun, H.; Wang, D.; Zhao, G. Application of fuzzy graph theory to evaluation of human cardiac function. Hang Tian Yi Xue Yu Yi Xue Gong Cheng Space Med. Med. Eng. 1997, 10, 11–13. [Google Scholar]
  10. Blue, M.; Bush, B.; Puckett, J. Unified approach to fuzzy graph problems. Fuzzy Sets Syst. 2002, 125, 355–368. [Google Scholar] [CrossRef]
  11. Das, R.; Sahoo, L.; Samanta, S.; Simic, V.; Senapati, T. Identifying the shortest path of a semidirected graph and its application. Mathematics 2022, 10, 4807. [Google Scholar] [CrossRef]
  12. Islam, S.R.; Pal, M. Hyper-Wiener index for fuzzy graph and its application in share market. J. Intell. Fuzzy Syst. 2021, 41, 2073–2083. [Google Scholar] [CrossRef]
  13. Poczeta, K.; Kubu’s, L.; Yastrebov, A. Analysis of an evolutionary algorithm for complex fuzzy cognitive map learning based on graph theory metrics and output concepts. Biosystems 2019, 179, 39–47. [Google Scholar] [CrossRef]
  14. Majumder, P.; Bhowmik, P.; Das, A.; Senapati, T.; Simic, V.; Pamucar, D. An intuitionistic fuzzy based hybrid decision-making approach to determine the priority value of indicators and its application to solar energy feasibility analysis. Optik 2023, 295, 171492. [Google Scholar] [CrossRef]
  15. Senapati, T.; Chen, G.; Mesiar, R.; Yager, R.R. Intuitionistic fuzzy geometric aggregation operators in the framework of Aczel-Alsina triangular norms and their application to multiple attribute decision making. Expert Syst. Appl. 2023, 212, 118832. [Google Scholar] [CrossRef]
  16. Senapati, T.; Simic, V.; Saha, A.; Dobrodolac, M.; Rong, Y.; Tirkolaee, E.B. Intuitionistic fuzzy power Aczel-Alsina model for prioritization of sustainable transportation sharing practices. Eng. Appl. Artif. Intell. 2023, 119, 105716. [Google Scholar] [CrossRef]
  17. Jin, L.S.; Yager, R.R.; Ma, C.; Lopez, L.M.; Rodrguez, R.M.; Senapati, T.; Mesiar, R. Intuitionistic fuzzy type basic uncertain information. Iran. J. Fuzzy Syst. 2023, 20, 189–197. [Google Scholar]
  18. Khan, M.S.A.; Jan, S.U.; Jan, R.; Senapati, T.; Moslem, S. Complex interval-valued intuitionistic fuzzy decision support system with application to COVID-19 healthcare facilities. Complex Intell. Syst. 2023, 9, 7103–7132. [Google Scholar] [CrossRef]
  19. Azam, M.; Khan, M.S.S.; Yang, S.; Jan, S.U.; Senapati, T.; Moslem, S.; Mashwani, W.K. Novel dual partitioned Maclaurin symmetric mean operators for the selection of computer network security system with complex intuitionistic fuzzy setting. IEEE Access 2023, 11, 85050–85066. [Google Scholar] [CrossRef]
  20. Akram, M.; Davvaz, B. Strong intuitionistic fuzzy graphs. Filomat 2012, 26, 177–196. [Google Scholar] [CrossRef]
  21. Parvathi, R.; Karunambigai, M.G. Intuitionistic fuzzy graphs. In Computational Intelligence, Theory and Applications, Proceedings of the International Conference 9th Fuzzy Days in Dortmund, Germany, 18–20 September 2006; Springer: Berlin/Heidelberg, Germany, 2006; pp. 139–150. [Google Scholar]
  22. Nazir, N.; Shaheen, T.; Jin, L.S.; Senapati, T. An improved algorithm for identification of dominating vertex set inintuitionistic fuzzy graphs. Axioms 2023, 12, 289. [Google Scholar] [CrossRef]
  23. Rashmanlou, H.; Samanta, S.; Pal, M.; Borzooei, R.A. Intuitionistic fuzzy graphs with categorical properties. Fuzzy Inf. Eng. 2015, 7, 317–334. [Google Scholar] [CrossRef]
  24. Praba, B.; Chandrasekaran, V.M.; Deepa, G. Energy of an intuitionistic fuzzy graph. Ital. J. Pure Appl. Math. 2014, 32, 431–444. [Google Scholar]
  25. Karunambigai, M.G.; Akram, M.; Sivasankar, S.; Palanivel, K. Clustering algorithm for intuitionistic fuzzy graphs. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2017, 25, 367–383. [Google Scholar] [CrossRef]
  26. Rashmanlou, H.; Pal, M.; Raut, S.; Mofidnakhaei, F.; Sarkar, B. Novel concepts in intuitionistic fuzzy graphs with application. J. Intell. Fuzzy Syst. 2019, 37, 3743–3749. [Google Scholar] [CrossRef]
  27. Atanassov, K. Generalized nets and intuitionistic fuzziness as tools for modeling of data mining processes and tools. Notes Intuitionistic Fuzzy Sets 2020, 26, 9–52. [Google Scholar] [CrossRef]
  28. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  29. Ramot, D.; Friedman, M.; Langholz, G.; Kandel, A. Complex fuzzy logic. IEEE Trans. Fuzzy Syst. 2003, 11, 450–461. [Google Scholar] [CrossRef]
  30. Yazdanbakhsh, O.; Dick, S. A systematic review of complex fuzzy sets and logic. Fuzzy Sets. Syst. 2018, 338, 1–22. [Google Scholar] [CrossRef]
  31. Alkouri, A.; Salleh, A. Complex intuitionistic fuzzy sets. AIP Conf. Proc. 2012, 14, 464–470. [Google Scholar]
  32. Shoaib, M.; Mahmood, W.; Xin, Q.; Tchier, F.; Tawfq, F.M. Certain operations on complex picture fuzzy graphs. IEEE Access 2022, 10, 114284–114296. [Google Scholar] [CrossRef]
  33. Akram, M.; Sattar, A.; Saeid, A.B. Competition graphs with complex intuitionistic fuzzy information. Granul. Comput. 2022, 7, 25–47. [Google Scholar] [CrossRef]
  34. Nazeer, I.; Rashid, T. Connectivity concepts in intuitionistic fuzzy incidence graphs with application. Int. J. Appl. Comput. Math. 2022, 8, 263. [Google Scholar] [CrossRef]
  35. Sharma, P.K. t-Intuitionistic fuzzy subgroups. Int. J. Fuzzy Syst. 2012, 2, 233–243. [Google Scholar]
  36. Razzaque, A.; Masmali, I.; Latif, L.; Shuaib, U.; Razaq, A.; Alhamzi, G.; Noor, S. On t-intuitionistic fuzzy graphs: A comprehensive analysis and application in poverty reduction. Sci. Rep. 2023, 13, 17027. [Google Scholar] [CrossRef]
  37. Shao, Z.; Kosari, S.; Rashmanlou, H.; Shoaib, M. New Concepts in Intuitionistic Fuzzy Graph with Application in Water Supplier Systems. Mathematics 2020, 8, 1241. [Google Scholar] [CrossRef]
  38. Chen, Z.; Kosari, S.; Kaarmukilan, S.P.; Yuvapriya, C.; Atanassov, K.T.; Rangasamy, P.; Rashmanlou, H. A Video Processing Algorithm Using Temporal Intuitionistic Fuzzy Sets. J. Intell. Fuzzy Syst. 2022, 43, 8057–8072. [Google Scholar] [CrossRef]
  39. Qiang, X.; Kosari, S.; Chen, X.; Talebi, A.A.; Muhiuddin, G.; Sadati, S.H. A Novel Description of Some Concepts in Interval-Valued Intuitionistic Fuzzy Graph with an Application. Adv. Math. Phys. 2022, 81, 2412012. [Google Scholar] [CrossRef]
  40. Rashmanlou, H.; Borzooei, R. New Concepts of Interval-valued Intuitionistic (S, T)-fuzzy Graphs. J. Intell. Fuzzy Syst. 2016, 30, 1893–1901. [Google Scholar] [CrossRef]
  41. Hossein Rashmanlou, R.A. Borzooei, Sovan Samanta, Madhumangal Pal, Properties of interval valued intuitionistic (S, T)—Fuzzy graphs. Pac. Sci. Rev. A Nat. Sci. Eng. 2016, 18, 30–37. [Google Scholar]
  42. Shi, X.; Kosari, S.; Talebi, A.A.; Sadati, S.H.; Rashmanlou, H. Investigation of the Main Energies of Picture Fuzzy Graph and its Applications. Int. J. Comput. Intell. Syst. 2022, 15, 31. [Google Scholar] [CrossRef]
  43. Guan, H.; Khan, W.A.; Fida, A.; Ali, K.; Shafi, J.; Khan, A. Dominations in Intutionistic Fuzzy Directed Graphs with Applications towards Influential Graphs. Mathematics 2024, 12, 872. [Google Scholar] [CrossRef]
  44. Imran, M.; Azeem, M.; Jamil, M.K.; Deveci, M. Some operations on intuitionistic fuzzy graphs via novel versions of the Sombor index for internet routing. Granul. Comput. 2024, 9, 53. [Google Scholar] [CrossRef]
  45. Hayat, S.; Alanazi, S.J.F.; Liu, J.-B. Two novel temperature-based topological indices with strong potential to predict physicochemical properties of polycyclic aromatic hydrocarbons with applications to silicon carbide nanotubes. Phys. Scr. 2024, 99, 055027. [Google Scholar] [CrossRef]
  46. Hayat, S.; Mahadi, H.; Alanazi, S.J.; Wang, S. Predictive potential of eigenvalues-based graphical indices for determining thermodynamic properties of polycyclic aromatic hydrocarbons with applications to polyacenes. Comput. Mater. Sci. 2024, 238, 112944. [Google Scholar]
  47. Hayat, S.; Liu, J.B. Comparative analysis of temperature-based graphical indices for correlating the total π-electron energy of benzenoid hydrocarbons. Int. J. Mod. Phys. B 2024, 2550047. [Google Scholar] [CrossRef]
  48. Hayat, S.; Khan, A.; Ali, K.; Liu, J.B. Structure-property modeling for thermodynamic properties of benzenoid hydrocarbons by temperature-based topological indices. Ain Shams Eng. J. 2024, 15, 102586. [Google Scholar] [CrossRef]
  49. Hayat, S. Distance-based graphical indices for predicting thermodynamic properties of benzenoid hydrocarbons with applications. Comput. Mater. Sci. 2023, 230, 112492. [Google Scholar] [CrossRef]
  50. Hayat, S.; Suhaili, N.; Jamil, H. Statistical significance of valency-based topological descriptors for correlating thermodynamic properties of benzenoid hydrocarbons with applications. Comput. Theor. Chem. 2023, 1227, 114259. [Google Scholar] [CrossRef]
Figure 1. CTIFG, where G 0.8 .
Figure 1. CTIFG, where G 0.8 .
Mathematics 12 01950 g001
Figure 2. CTIFG  Ğ 0.7 .
Figure 2. CTIFG  Ğ 0.7 .
Mathematics 12 01950 g002
Figure 3. C T I F   Ğ 0.6 .
Figure 3. C T I F   Ğ 0.6 .
Mathematics 12 01950 g003
Figure 4. C T I F   Ğ 0.6 .
Figure 4. C T I F   Ğ 0.6 .
Mathematics 12 01950 g004
Figure 5. Shows their corresponding Cartesian product Ğ 0.6 × Ğ 0.6 .
Figure 5. Shows their corresponding Cartesian product Ğ 0.6 × Ğ 0.6 .
Mathematics 12 01950 g005
Figure 6. Ğ 0.7   a n d   Ğ 0.7 .
Figure 6. Ğ 0.7   a n d   Ğ 0.7 .
Mathematics 12 01950 g006
Figure 7. Ğ 0.7 Ğ 0.7 .
Figure 7. Ğ 0.7 Ğ 0.7 .
Mathematics 12 01950 g007
Figure 8. ICTFG  Ğ 0.7 .
Figure 8. ICTFG  Ğ 0.7 .
Mathematics 12 01950 g008
Figure 9. ICTFG  Ğ 0.7 .
Figure 9. ICTFG  Ğ 0.7 .
Mathematics 12 01950 g009
Figure 10. Ğ 0.7 Ğ 0.7 .
Figure 10. Ğ 0.7 Ğ 0.7 .
Mathematics 12 01950 g010
Figure 11. Ğ 0.7 + Ğ 0.7 .
Figure 11. Ğ 0.7 + Ğ 0.7 .
Mathematics 12 01950 g011
Figure 12. CT I F G   Ğ 0.6 .
Figure 12. CT I F G   Ğ 0.6 .
Mathematics 12 01950 g012
Figure 13. CTIF Ğ 0.6 .
Figure 13. CTIF Ğ 0.6 .
Mathematics 12 01950 g013
Figure 14. Graphical representation of CTIFGs.
Figure 14. Graphical representation of CTIFGs.
Mathematics 12 01950 g014
Figure 15. Graphical representation of score values of CTIFGs.
Figure 15. Graphical representation of score values of CTIFGs.
Mathematics 12 01950 g015
Table 1. The list of abbreviations used in this article is shown in the table below.
Table 1. The list of abbreviations used in this article is shown in the table below.
IFSIntuitionistic Fuzzy Set
TIFSt-Intuitionistic Fuzzy Set
CIFSComplex Intuitionistic Fuzzy Set
IFGIntuitionistic Fuzzy Graph
CTISsComplex t-Intuitionistic Subset
CTIFGsComplex t-Intuitionistic Fuzzy Graphs
Table 2. Edges of CTIFS.
Table 2. Edges of CTIFS.
EdgesComplex 0.8-IFS
R1 ( 0.6 e i 0.4 π , 0.3 e i   0.3 π )
R2 ( 0.8 e i 0.4 π , 0.2 e i   0.4 π )
R3 ( 0.6 e i 0.5 π , 0.4 e i   0.4 π )
R4 ( 0.7 e i 0.4 π , 0.3 e i   0.4 π )
R5 ( 0.8 e i 0.5 π , 0.2 e i   0.5 π )
R6 ( 0.6 e i 0.4 π , 0.4 e i   0.5 π )
R7 ( 0.7 e i 0.4 π , 0.3 e i   0.4 π )
R8 ( 0.6 e i 0.4 π , 0.4 e i   0.4 π )
R9 ( 0.5 e i 0.4 π , 0.5 e i   0.4 π )
R 10 ( 0.6 e i 0.4 π , 0.3 e i   0.5 π )
R 11 ( 0.5 e i 0.4 π , 0.4 e i   0.5 π )
R 12 ( 0.6 e i 0.5 π , 0.4 e i   0.4 π )
R 13 ( 0.7 e i 0.5 π , 0.3 e i   0.4 π )
R 14 ( 0.8 e i 0.5 π , 0.4 e i   0.5 π )
R 15 ( 0.6 e i 0.5 π , 0.5 e i   0.5 π )
R 16 ( 0.6 e i 0.5 π , 0.4 e i   0.4 π )
R 17 ( 0.6 e i 0.5 π , 0.4 e i   0.5 π )
R 18 ( 0.6 e i 0.4 π , 0.4 e i   0.5 π )
R 19 ( 0.7 e i 0.5 π , 0.3 e i   0.5 π )
R 20 ( 0.6 e i 0.4 π , 0.4 e i   0.5 π )
R 21 ( 0.6 e i 0.5 π , 0.4 e i   0.5 π )
Table 3. Table of truth and falsity membership degree of each factor.
Table 3. Table of truth and falsity membership degree of each factor.
FactorDegree of Each Factor
P1 d e g ( P 1 ) = ( 4.1 e i   3.4 π ,   2.3 e i   3.0 π )
P2 d e g ( P 2 ) = ( 3.5 e i   2.4 π , 2.5 e i   2.5 π )
P3 d e g ( P 3 ) = ( 4.2 e i   2.8 π , 2.5 e i   3.0 π )
P4 d e g ( P 4 ) = ( 3.6 e i   2.8 π ,   2.5 e i   3.0 π )
P5 d e g ( P 5 ) = ( 3.5 e i   2.6 π ,   2.5 e i   3.0 π )
P6 d e g ( P 6 ) = ( 3.8 e i   3.2 π , 2.2 e i   2.6 π )
P7 d e g ( P 7 ) = ( 4.1 e i   2.8 π , 3.0 e i   3.0 π )
Table 4. Score value of CTIFGs.
Table 4. Score value of CTIFGs.
FactorScore Value of CTIFG
BOD   P 1 4.3025
COD P 2 4.2031
pH P 3 4.7600
Alkalinity P 4 4.5230
Nitrogen P 5 4.4244
Phosphorous P 6 4.4799
Turbidity P 7 5.1046
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kaviyarasu, M.; Alqahtani, M.; Rajeshwari, M.; Sudalaimuthu, G. Complex t-Intuitionistic Fuzzy Graph with Applications of Rubber Industrial Water Wastes. Mathematics 2024, 12, 1950. https://doi.org/10.3390/math12131950

AMA Style

Kaviyarasu M, Alqahtani M, Rajeshwari M, Sudalaimuthu G. Complex t-Intuitionistic Fuzzy Graph with Applications of Rubber Industrial Water Wastes. Mathematics. 2024; 12(13):1950. https://doi.org/10.3390/math12131950

Chicago/Turabian Style

Kaviyarasu, Murugan, Mohammed Alqahtani, Murugesan Rajeshwari, and Gopikumar Sudalaimuthu. 2024. "Complex t-Intuitionistic Fuzzy Graph with Applications of Rubber Industrial Water Wastes" Mathematics 12, no. 13: 1950. https://doi.org/10.3390/math12131950

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop