Next Article in Journal
A New Effective Jackknifing Estimator in the Negative Binomial Regression Model
Next Article in Special Issue
Bipolar Fuzzy Supra Topology via (Q-) Neighborhood and Its Application in Data Mining Process
Previous Article in Journal
Delay Differential Equations with Several Sublinear Neutral Terms: Investigation of Oscillatory Behavior
Previous Article in Special Issue
Fuzzy Logic and Its Application in the Assessment of Information Security Risk of Industrial Internet of Things
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Concept of Level Graph in Interval-Valued Fuzzy Graphs with Application

1
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
2
Department of Mathematics, University of Mazandaran, Babolsar 4741613534, Iran
3
School of Physics, Damghan University, Damghan 3671641167, Iran
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(12), 2106; https://doi.org/10.3390/sym15122106
Submission received: 13 October 2023 / Revised: 15 November 2023 / Accepted: 21 November 2023 / Published: 23 November 2023
(This article belongs to the Special Issue Research on Fuzzy Logic and Mathematics with Applications II)

Abstract

:
Many problems of practical interest can be modeled and solved by using interval-valued fuzzy graph (IVFG) algorithms. An IVFG is a very useful and effective tool for studying various calculations, fields of intelligence, and computer science, such as networking, imaging, and other fields, such as biological sciences. In different applications, they present an appropriate construction means. There were limitations in the definition of fuzzy graphs (FGs), which prompted us to propose a new definition for IVFGs. Some interesting properties related to the new IVFGs are investigated, and enough conditions under which the level graph on IVFGs is equivalent are obtained. Therefore, in this study, we present the properties of a level graph (LG) of an IVFG, and four operations, the Cartesian product (CP), composition (CO), union, and join, are investigated on it. Today, in a treatment system, one of the issues that can be very valuable and important to the quality of service to patients is finding qualified and efficient people in each department, which is not an easy task. But the interval-valued fuzzy graph, as an important fuzzy graph, can help us by considering the ability of each person in the form of intervals of numbers and the effectiveness of each one on the other (according to the relationships between them) in order to find the most worthy people. So, an application of IVFG to find the most effective person in a hospital information system has been introduced.

1. Introduction

Graph theory started its journey with the famous Konigsberg bridge problem. This problem was the birth of graph theory. Euler finally solved this problem with the help of graphs. Though graph theory is a relatively old subject, its growing applications are shown in research. After the presentation of fuzzy sets by Zadeh [1], fuzzy set (FS) theory has become a massive and strong study area in different fields, including life sciences, management science, statistics, graph theory, and decision making. Zadeh [2] presented the notion of an interval-valued fuzzy set (IVFS) as a continuation of FSs. Since the concept of IVFSs is a very useful issue, some researchers have conducted studies in this regard. Roy and Biswas [3] defined IVF relations. Rosenfeld [4] introduced the concept of fuzzy graphs (FGs). FG theory has various applications in medicine, engineering, psychology, and urban planning. Many researchers are trying to use it to optimize and save time. FG theory is finding an increasing number of applications in modeling real-time systems where the level of information in the system is different with various levels of precision. Some remarks on FGs were expressed by Bhattacharya [5]. Mordeson and Peng [6] described several notations on FGs. Akram et al. [7,8,9,10] introduced the definition of an IVFG and examined several of its properties. Hongmei and Lianhua [11] explained the new concept of IVFGs. Turksen [12] defined IVFSs based on normal forms. Some root-level modifications in IVFGs were presented by Jan et al. [13]. Nagoorgani and Radha [14] studied isomorphism on FGs. Rashmanlou and Pal [15] defined antipodal IVFGs. Certain types of m-polar IVFGs were proposed by [16]. Zihni et al. [17] introduced IVF soft graphs. IVFGs are of the FG family and have many abilities when involved with issues that FGs and VGs cannot explain. Since the membership value is not known, impartiality is a good advantage that can be well protected with an IVFG. Therefore, in this study, we extend the FG notion to the IVFG and discuss the well-known problems of level graphs, CP, CO, union, and join, on IVFGs. The level graph has a variety of applications in other sciences. They are used to identify the most effective person in an organization. Krishna et al. [18] explained new information in cubic graphs. Dey et al. [19,20,21] introduced the fuzzy minimum spanning tree with an interval type 2 fuzzy arc length and an interval type 2 FS in a fuzzy shortest path problem. Qiang et al. [22] expressed a novel description of VG structure and also investigated the new results of it. Some types of FGs were studied in [23,24].
The following points influenced us to write this article:
  • Due to the enormous applications of LGs in fuzzy graphs, including level graphs for FGs in distinct decision-making problems, it also seems advantageous to expand the notion of LGs in IVFGs.
  • There are numerous applications for the operation of LGs in chemistry, computer science, psychology, and other disciplines.
  • Moreover, the LG of an IVFG has not yet been discussed and studied in the literature; therefore, we expanded the notion of a LG of an FG to a LG of an IVFG, and four operations, the Cartesian product, composition, union, and join, are investigated.
The intention of our proposed research work is given as follows:
  • The aim of this research study is to investigate the notion of the Cartesian product and the composition of interval-valued fuzzy graphs.
  • We introduce the concept of union and join of LGs on IVFGs and study their properties with some examples.
  • The properties of LGs in IVFGs under important operations, the Cartesian product, composition, union, and join, are clearly shown.
  • Finally, we present an application of an IVFG to find the most effective person in a hospital information system.
This paper is organized as follows.
In the first part, we study some theoretical background. In the second part, we explain some essential definitions of IVFGs and give details of new operations of them, such as the CP, CO, union, and join. In the third part, we introduce some operations of level graphs of IVFGs. In the last part, an application of IVFG is given.

2. Preliminaries

In this part, we present some definition which will be used throughout the paper.
A graph G is a ordered pair ( X , E ) , where X is a nonempty set called the vertex set and E X × X is called the edge set.
Definition 1
([5]). An FG of a graph G = ( X , E ) is a pair G = ( δ , ρ ) , where δ is an FS on X and ρ is an FS on E, so that
ρ ( e   f ) min { δ ( e ) , δ ( f ) } ,
for all e   f E .
The set of all closed interval on [ 0 , 1 ] is denoted by I [ 0 , 1 ] .
Definition 2.
Let X be a nonempty set. A mapping R = [ ρ R l , ρ R u ] : X I [ 0 , 1 ] , ( x [ ρ R l ( x ) , ρ R u ( x ) ] I [ 0 , 1 ] ) is called an IVFS on X. The lower and upper values of the vertex interval in IVFS are defined by ρ R l and ρ R u , respectively.
Definition 3
([7]). A pair G = ( R , S ) of a graph G = ( X , E ) is named an IVFG so that R = [ ρ R l , ρ R u ] is an IVFS on X and S = [ ρ S l , ρ S u ] is an IVFS on E that satisfies the following conditions:
ρ S l ( e   f ) min { ρ R l ( e ) , ρ R l ( f ) } ,
ρ S u ( e   f ) min { ρ R u ( e ) , ρ R u ( f ) } ,
for all e   f E .
Definition 4.
Assume that G 1 = ( R 1 , S 1 ) and G 2 = ( R 2 , S 2 ) are two IVFGs of G 1 = ( X 1 , E 1 ) and G 2 = ( X 2 , E 2 ) , respectively.
(i) 
The union G 1 G 2 is defined as the pair ( R , S ) of IVFSs on the union of graphs G 1 and G 2 , so that
(a) 
( ρ R 1 l ρ R 2 l ) ( e ) = ρ R 1 l ( e ) i f e X 1 , e X 2 ( ρ R 1 l ρ R 2 l ) ( e ) = ρ R 2 l ( e ) i f e X 2 , e X 1 ( ρ R 1 l ρ R 2 l ) ( e ) = max { ρ R 1 l ( e ) , ρ R 2 l ( e ) } i f e X 1 X 2
(b) 
( ρ R 1 u ρ R 2 u ) ( e ) = ρ R 1 u ( e ) i f e X 1 , e X 2 ( ρ R 1 u ρ R 2 u ) ( e ) = ρ R 2 u ( e ) i f e X 2 , e X 1 ( ρ R 1 u ρ R 2 u ) ( e ) = max { ρ R 1 u ( e ) , ρ R 2 u ( e ) } i f e X 1 X 2
(c) 
( ρ S 1 l ρ S 2 l ) ( e f ) = ρ S 1 l ( e f ) i f e f E 1 , e f E 2 ρ S 1 l ρ S 2 l ) ( e f ) = ρ S 2 l ( e f ) i f e f E 2 , e f E 1 ( ρ S 1 l ρ S 2 l ) ( e f ) = max { ρ S 1 l ( e f ) , ρ S 2 l ( e f ) } i f e f E 1 E 2
(d) 
( ρ S 1 u ρ S 2 u ) ( e f ) = ρ S 1 u ( e f ) i f e f E 1 , e f E 2 ( ρ S 1 u ρ S 2 u ) ( e f ) = ρ S 2 u ( e f ) i f e f E 2 , e f E 1 ( ρ S 1 u ρ S 2 u ) ( e f ) = max { ρ S 1 u ( e f ) , ρ S 2 u ( e f ) } i f e f E 1 E 2 .
(ii) 
The CP of IVFGs G 1 and G 2 , denoted by G 1 × G 2 , is the pair ( R , S ) of IVFSs defined on the CP of graphs G 1 and G 2 , so that
(a) 
( ρ R 1 l × ρ R 2 l ) ( e 1 , e 2 ) = min { ρ R 1 l ( e 1 ) , ρ R 2 l ( e 2 ) } ( ρ R 1 u × ρ R 2 u ) ( e 1 , e 2 ) = min { ρ R 1 u ( e 1 ) , ρ R 2 u ( e 2 ) } for all (e1, e2) ∈ X1 × X2
(b) 
( ρ S 1 l × ρ S 2 l ) ( ( e , e 2 ) ( e , f 2 ) ) = min { ρ R 1 l ( e ) , ρ S 2 l ( e 2 f 2 ) } ( ρ S 1 u × ρ S 2 u ) ( ( e , e 2 ) ( e , f 2 ) ) = min { ρ R 1 u ( e ) , ρ S 2 u ( e 2 f 2 ) } for all eX1, e2f2 ∈ E2
(c) 
( ρ S 1 l × ρ S 2 l ) ( ( e 1 , k ) ( f 1 , k ) ) = min { ρ S 1 l ( e 1 f 1 ) , ρ R 2 l ( k ) } ( ρ S 1 u × ρ S 2 u ) ( ( e 1 , k ) ( f 1 , k ) ) = min { ρ S 1 u ( e 1 f 1 ) , ρ R 2 u ( k ) } for all k ∈ X2e1f1 ∈ E1.
(iii) 
The CO of two IVFGs G 1 and G 2 ,shown by G 1 [ G 2 ] , is the pair ( R , S ) of IVFSs defined on the CO G 1 [ G 2 ] ,so that
(a) 
( ρ R 1 l ρ R 2 l ) ( e 1 , e 2 ) = min { ρ R 1 l ( e 1 ) , ρ R 2 l ( e 2 ) } ( ρ R 1 u ρ R 2 u ) ( e 1 , e 2 ) = min { ρ R 1 u ( e 1 ) , ρ R 2 u ( e 2 ) } for all (e1, e2) X1 × X2
(b) 
( ρ S 1 l ρ S 2 l ) ( ( e , e 2 ) ( e , f 2 ) ) = min { ρ R 1 l ( e ) , ρ S 2 l ( e 2 f 2 ) } ( ρ S 1 u ρ S 2 u ) ( ( e , e 2 ) ( e , f 2 ) ) = min { ρ R 1 u ( e ) , ρ S 2 u ( e 2 f 2 ) } for all e ∈ X1e2f2 ∈ E2
(c) 
( ρ S 1 l ρ S 2 l ) ( ( e 1 , k ) ( f 1 , k ) ) = min { ρ S 1 l ( e 1 f 1 ) , ρ R 2 l ( k ) } ( ρ S 1 u ρ S 2 u ) ( ( e 1 , k ) ( f 1 , k ) ) = min { ρ S 1 u ( e 1 f 1 ) , ρ R 2 u ( k ) } for all k ∈ X2e1f1 ∈ E1.
(d) 
( ρ S 1 l ρ S 2 l ) ( ( e 1 , e 2 ) ( f 1 , f 2 ) ) = min { ρ S 1 l ( e 1 f 1 ) , ρ R 2 l ( e 2 ) , ρ R 2 l ( f 2 ) } ( ρ S 1 u ρ S 2 u ) ( ( e 1 , e 2 ) ( f 1 , f 2 ) ) = min { ρ S 1 u ( e 1 f 1 ) , ρ R 2 u ( e 2 ) , ρ R 2 u ( f 2 ) } for all e2 f2 ∈ X2, e1f1 ∈ E1, e2 ≠ f2.

3. Level Graphs of the Interval-Valued Fuzzy Graphs

In this section, we introduce a new concept of [ ψ , θ ] level graph on IVFGs.
Definition 5.
For all [ ψ , θ ] I [ 0 , 1 ] , [ ψ , θ ] -level set of an IVFS R on X is defined to be R [ ψ , θ ] = { e X : ρ R l ( e ) ψ , ρ R u ( e ) θ } .
Theorem 1.
Suppose that X is a nonempty set, and R = [ ρ R l , ρ R u ] and S = [ ρ S l , ρ S u ] are IVFGs on X and E, respectively. Then, G = ( R ,   S ) is an IVFG if and only if ( R [ ψ , θ ] ,   S [ ψ , θ ] ) , named the [ ψ , θ ] -level graph of G , is a graph for every [ ψ , θ ] I [ 0 , 1 ] .
Proof. 
Let G = ( R ,   S ) be an IVFG. For each [ ψ , θ ] I [ 0 , 1 ] , if e   f S [ ψ , θ ] , then, ρ S l ( e f ) ψ , ρ S u ( e f ) θ . Since G is an IVFG,
ψ ρ S l ( e   f ) min { ρ R l ( e ) , ρ R l ( f ) } ,
θ ρ S u ( e   f ) min { ρ R u ( e ) , ρ R u ( f ) } ,
and so ψ ρ R l ( e ) , ψ ρ R l ( f ) , θ ρ R u ( e ) , θ ρ R u ( f ) , that is, e ,   f R [ ψ , θ ] .
Therefore, ( R [ ψ , θ ] , S [ ψ , θ ] ) is a graph for every [ ψ , θ ] I [ 0 , 1 ] .
Conversely, suppose ( R [ ψ , θ ] , S [ ψ , θ ] ) is a graph for all [ ψ , θ ] I [ 0 , 1 ] . For each e   f E , we consider ρ S l ( e   f ) = ψ and ρ S u ( e   f ) = θ . Then, e   f S [ ψ , θ ] . Since ( R [ ψ , θ ] , S [ ψ , θ ] ) is a graph; thus, we have e ,   f R [ ψ , θ ] . Hence, ψ ρ R l ( e ) , ψ ρ R l ( f ) , θ ρ R u ( e ) , and θ ρ R u ( f ) . Therefore,
ρ S l ( e   f ) = ψ min { ρ R l ( e ) , ρ R l ( f ) } ,
ρ S u ( e   f ) = θ min { ρ R u ( e ) , ρ R u ( f ) } ,
that is, G = ( R ,   S ) is an IVFG. □
Theorem 2.
Suppose G 1 = ( R 1 ,   S 1 ) and G 2 = ( R 2 ,   S 2 ) are the IVFGs of G 1 = ( X 1 ,   E 1 ) and G 2 = ( X 2 ,   E 2 ) , respectively. Then, the pair G = ( R ,   S ) of an IVFG on G 1 and G 2 is the CP of G 1 and G 2 if and only if for every [ ψ , θ ] I [ 0 , 1 ] the [ ψ , θ ] -level graph ( R [ ψ , θ ] , S [ ψ , θ ] ) is the CP of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) .
Proof. 
Suppose that G = ( R ,   S ) is the CP of the IVFGs G 1 and G 2 . For each [ ψ , θ ] I [ 0 , 1 ] , if ( e ,   f ) R [ ψ , θ ] , then
ψ ρ R l ( e ,   f ) = min { ρ R 1 l ( e ) , ρ R 2 l ( f ) } ,
θ ρ R u ( e ,   f ) = min { ρ R 1 u ( e ) , ρ R 2 u ( f ) } .
Therefore, e ( R 1 ) [ ψ , θ ] and f ( R 2 ) [ ψ , θ ] ; that is, ( e ,   f ) ( R 1 ) [ ψ , θ ] × ( R 2 ) [ ψ , θ ] .
Therefore, R [ ψ , θ ]     ( R 1 ) [ ψ , θ ]   ×   ( R 2 ) [ ψ , θ ] . If ( e ,   f )     ( R 1 ) [ ψ , θ ]   ×   ( R 2 ) [ ψ , θ ] , then e     ( R 1 ) [ ψ , θ ] and f     ( R 2 ) [ ψ , θ ] . Here, we have
ψ min { ρ R 1 l ( e ) , ρ R 2 l ( f ) } ,
θ min { ρ R 1 u ( e ) , ρ R 2 u ( f ) } .
Because ( R ,   S ) is the CP of G 1 and G 2 , ψ ρ R l ( e , f ) and θ ρ R u ( e ,   f ) , so we have ( e ,   f ) R [ ψ , θ ] . Thus,
( R 1 ) [ ψ , θ ]   ×   ( R 2 ) [ ψ , θ ]     R [ ψ , θ ]
and so
( R 1 ) [ ψ , θ ]   ×   ( R 2 ) [ ψ , θ ]   =   R [ ψ , θ ] .
Now, we prove S [ ψ , θ ]   =   E , such that E is the edge set of the CP ( G 1 ) [ ψ , θ ]   ×   ( G 2 ) [ ψ , θ ] for every [ ψ , θ ]     I [ 0 , 1 ] .
Suppose ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )     S [ ψ , θ ] . Therefore,
ρ S l ( e 1 ,   e 2 ) ( f 1 ,   f 2 )     ψ , ρ S u ( e 1 ,   e 2 ) ( f 1 ,   f 2 )     θ .
Since ( R ,   S ) is the CP of G 1 and G 2 , it satisfies one of the below conditions:
(i)
e 1 = f 1 and e 2 f 2 E 2 ,
(ii)
e 2 = f 2 and e 1 f 1 E 1 .
In the first condition (i), we have:
ρ S l ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) = min { ρ R 1 l ( e 1 ) ,   ρ S 2 l ( e 2 f 2 ) }     ψ ,
ρ S u ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) = min { ρ R 1 u ( e 1 ) ,   ρ S 2 u ( e 2 f 2 ) }     θ ,
and so ρ R 1 l ( e 1 )     ψ , ρ R 1 u ( e 1 ) θ , ρ S 2 l ( e 2 f 2 ) ψ , ρ S 2 u ( e 2 f 2 )     θ .
It follows that e 1   =   f 1     ( R 1 ) [ ψ , θ ] and e 2 f 2 ( S 2 ) [ ψ , θ ] ; that is, ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) E .
Similarly, for condition (ii), we conclude ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) E . Thus, S [ ψ , θ ]     E . For each ( ( e ,   e 2 ) ( e ,   f 2 ) ) E , ρ R 1 l ( e ) ψ , ρ R 1 u ( e ) θ , ρ S 2 l ( e 2 f 2 ) ψ , ρ S 2 u ( e 2 f 2 ) θ .
Because ( R ,   S ) is the CP of G 1 and G 2 , we have:
ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) ) = min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) }     ψ ,
ρ S u ( ( e , e 2 ) ( e ,   f 2 ) ) = min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) }     ψ .
Therefore, ( ( e ,   e 2 ) ( e ,   f 2 ) ) S [ ψ , θ ] . Similarly, for each ( e 1 ,   k ) ( f 1 ,   k ) E , we have ( ( e 1 ,   k ) ( f 1 ,   k ) ) S [ ψ , θ ] . Thus, E     S [ ψ , θ ] , and so E   =   S [ ψ , θ ] .
Conversely, suppose the [ ψ , θ ] -level graph ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the CP of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) , for all [ ψ , θ ] I [ 0 , 1 ] .
Suppose min { ρ R 1 l ( e 1 ) ,   ρ R 2 l ( e 2 ) }   =   ψ and min { ρ R 1 u ( e 1 ) ,   ρ R 2 u ( e 2 ) }   =   θ , for ( e 1 ,   e 2 ) X 1 × X 2 . Then, e 1 R 1 [ ψ , θ ] and e 2 R 2 [ ψ , θ ] . By the hypothesis, ( e 1 ,   e 2 ) R [ ψ , θ ] . Hence,
ρ R l ( e 1 ,   e 2 ) ψ = min { ρ R 1 l ( e 1 ) , ρ R 2 l ( e 2 ) } ,
ρ R u ( e 1 ,   e 2 ) θ = min { ρ R 1 u ( e 1 ) , ρ R 2 u ( e 2 ) } .
Consider ρ R l ( e 1 ,   e 2 )   =   ψ and ρ R u ( e 1 ,   e 2 )   =   θ . Then, we have ( e 1 ,   e 2 ) R [ ψ , θ ] . Since ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the CP of ( R 1 [ ψ , θ ] ,   S 1 [ ψ , θ ] ) and ( R 2 [ ψ , θ ] ,   S 2 [ ψ , θ ] ) , then e 1     R 1 [ ψ , θ ] and e 2     R 2 [ ψ , θ ] . Hence,
ρ R 1 l ( e 1 )     ψ   =   ρ R l ( e 1 ,   e 2 ) , ρ R 1 u ( e 1 ) θ   =   ρ R u ( e 1 , e 2 ) ,  
ρ R 2 l ( e 2 ) ψ   =   ρ R l ( e 1 ,   e 2 ) , ρ R 2 u ( e 2 ) θ   =   ρ R u ( e 1 ,   e 2 ) .
It follows that
ρ R l ( e 1 ,   e 2 ) min { ρ R 1 l ( e 1 ) ,   ρ R 2 l ( e 2 ) } ,  
ρ R u ( e 1 ,   e 2 ) min { ρ R 1 u ( e 1 ) ,   ρ R 2 u ( e 2 ) } .
Therefore,
ρ R l ( e 1 ,   e 2 )   =   min { ρ R 1 l ( e 1 ) ,   ρ R 2 l ( e 2 ) } ,  
ρ R u ( e 1 ,   e 2 ) = min { ρ R 1 u ( e 1 ) ,   ρ R 2 u ( e 2 ) } ,  
for all ( e 1 ,   e 2 ) X 1 × X 2 . That is, ρ R l   =   ρ R 1 l × ρ R 2 l ,   ρ R u   =   ρ R 1 u   ×   ρ R 2 u .
For each e     X 1 and e 2 f 2 E 2 , suppose
min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) } = ψ , min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) } = θ ,
ρ S l ( ( e ,   e 2 ) ( e , f 2 ) ) = ψ , ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) )   =   θ .
Then, ρ R 1 l ( e ) ψ , ρ R 1 u ( e )     θ , ρ S 2 l ( e 2 f 2 )     ψ , ρ S 2 u ( e 2 f 2 ) θ and ( ( e ,   e 2 ) ( e ,   f 2 ) ) S [ ψ ,   θ ] , i.e., e     R 1 [ ψ , θ ] , e 2 f 2 S 2 [ ψ , θ ] , and ( e ,   e 2 ) ( e ,   f 2 )     S [ ψ ,   θ ] .
Since ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the CP of ( [( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) , and also ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the CP of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) , we have ( e ,   e 2 ) ( e , f 2 ) S [ ψ , θ ] , e     R 1 [ ψ , θ ] , and e 2 f 2     S 2 [ ψ , θ ] , which implies ( ( e ,   e 2 ) ( e ,   f 2 ) )     S [ ψ , θ ] , ρ R 1 l ( e )     ψ ,   ρ R 1 u ( e )     θ ,   ρ S 2 l ( e 2 f 2 )     ψ ,   ρ S 2 u ( e 2 f 2 )     θ .
Therefore,
ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) )     ψ   =   min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) } ,
ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) )     θ   =   min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) } ,
and also
min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) } ψ = ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) ) ,
min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) } θ   =   ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) ) .
Thus,
min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) } = ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) ) ,
min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) }   =   ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) ) ,
for all e     X 1 and e 2 f 2     E 2 . Also, similarly, we obtain
min { ρ S 1 l ( e 1 f 1 ) ,   ρ R 2 l ( k ) }   =   ρ S l ( ( e 1 ,   k ) ( f 1 ,   k ) ) ,
min { ρ S 1 u ( e 1 f 1 ) ,   ρ R 2 u ( k ) }   =   ρ S l ( ( e 1 ,   k ) ( f 1 ,   k ) ) ,
for all k     X 2 and e 1 f 1     E 1 .
Example 1.
Suppose G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) are two IVFGs of the graphs G 1 = ( X 1 ,   E 1 ) and G 2 = ( X 2 ,   E 2 ) , respectively, so that X 1   =   { a ,   b ,   c ,   d } , X 2   =   { g ,   h } , E 1   =   { a b ,   b d , ,   c d ,   a c ,   b c } , and E 2   =   { g h } , as is shown in Figure 1.
( ρ S 1 l   ×   ρ S 2 l ) ( ( a ,   g ) ( b ,   g ) )   =   0.1 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( a ,   g ) ( b ,   g ) )   =   0.2
( ρ S 1 l × ρ S 2 l ) ( ( a ,   g ) ( a ,   h ) )   =   0.1 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( a ,   g ) ( a ,   h ) )   =   0.2
( ρ S 1 l   ×   ρ S 2 l ) ( ( a ,   g ) ( c ,   g ) )   =   0.1 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( a ,   g ) ( c ,   g ) )   =   0.2
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( b ,   h ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   g ) ( b ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( d ,   g ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   g ) ( d ,   g ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( c ,   g ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   g ) ( c ,   g ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   h ) ( d ,   h ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   h ) ( d ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   h ) ( a ,   h ) )   =   0.1 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   h ) ( a ,   h ) )   =   0.2
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   h ) ( c ,   h ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   h ) ( c ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( d ,   h ) ( d ,   g ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( d ,   h ) ( d , g ) )   =   0.5
( ρ S 1 l   ×   ρ S 2 l ) ( ( d ,   h ) ( c ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( d ,   h ) ( c ,   h ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   h ) ( c ,   g ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   h ) ( c ,   g ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   h ) ( a ,   h ) )   =   0.1 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   h ) ( a ,   h ) )   =   0.2
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   g ) ( d ,   g ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   g ) ( d ,   g ) )   =   0.4
We obtained the CP of the IVFGs G 1 and G 2 , which are shown in Figure 2.
Assume [ ψ , θ ] = [ 0.2 , 0.4 ] . Then, R 1 [ 0.2 , 0.4 ]   =   { c , d } , R 2 [ 0.2 , 0.4 ]   =   { g , h } , E 1 [ 0.2 , 0.4 ]   =   { c d } , and E 2 [ 0.2 , 0.4 ]   =   { g h } , as is shown in Figure 3.
We obtain the CP of the IVFGs G 1 [ 0.2 , 0.4 ] and G 2 [ 0.2 , 0.4 ] . The CP of the IVFGs G 1 [ 0.2 , 0.4 ] and G 2 [ 0.2 , 0.4 ] is shown in Figure 4.
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   g ) ( c ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   g ) ( c ,   h ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( d ,   g ) ( d ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( d ,   g ) ( d ,   h ) )   =   0.5
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   h ) ( d ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c   , h ) ( d ,   h ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   g ) ( d ,   g ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   g ) ( d ,   g ) )   =   0.4
Here, we investigated the properties of the CP IVFGs G 1 and G 2 from their [ 0.2 , 0.4 ] -level graphs of G 1 and G 2 .
We concluded that the pair G   =   ( R ,   S ) is the CP of G 1 and G 2 if and only if the [ 0.2 , 0.4 ] -level graph ( R [ 0.2 , 0.4 ] , S [ 0.2 , 0.4 ] ) is the CP of the two graphs G 1 [ 0.2 , 0.4 ] and G 2 [ 0.2 , 0.4 ] .
Also, we consider [ ψ , θ ]   =   [ 0.2 , 0.3 ] . Then, R 1 [ 0.2 , 0.3 ]   =   { c ,   d } , R 2 [ 0.2 , 0.3 ]   =   { g ,   h } , E 1 [ 0.2 , 0.3 ]   =   { b c ,   b d ,   c d } , and E 2 [ 0.2 , 0.3 ]   =   { g h } , is shown in Figure 5.
We obtain the CP of the IVFGs G 1 [ 0.2 , 0.3 ] and G 2 [ 0.2 , 0.3 ] . The CP of the IVFGs G 1 [ 0.2 , 0.3 ] and G 2 [ 0.2 , 0.3 ] is shown in Figure 6.
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( b ,   h ) )   =   0.2 , ( ρ S 1 u × ρ S 2 u ) ( ( b ,   g ) ( b ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( d ,   g ) ( d ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( d ,   g ) ( d ,   h ) )   =   0.5
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   g ) ( c ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   g ) ( c ,   h ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( d ,   g ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   g ) ( d ,   g ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   g ) ( c ,   g ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   g ) ( c ,   g ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( c ,   g ) ( d ,   g ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( c ,   g ) ( d ,   g ) )   =   0.4
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   h ) ( d ,   h ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   h ) ( d ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( b ,   h ) ( c ,   h ) )   =   0.2 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( b ,   h ) ( c ,   h ) )   =   0.3
( ρ S 1 l   ×   ρ S 2 l ) ( ( d ,   h ) ( c ,   h ) )   =   0.3 , ( ρ S 1 u   ×   ρ S 2 u ) ( ( d ,   h ) ( c ,   h ) )   =   0.4
In this example, we investigated the properties of the CP IVFGs G 1 and G 2 from their [ 0.2 , 0.3 ] -level graphs of G 1 and G 2 .
We concluded that the pair G   =   ( R ,   S ) is the CP of G 1 and G 2 if and only if the [ 0.2 , 0.4 ] -level graph ( R [ 0.2 , 0.3 ] ,   S [ 0.2 , 0.3 ] ) is the CP of two graphs G 1 [ 0.2 , 0.3 ] and G 2 [ 0.2 , 0.3 ] .
Corollary 1.
Let G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) be IVFGs. Then, the CP G 1   ×   G 2 is an IVFG.
Theorem 3.
Suppose G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) are two IVFGs of G 1 and G 2 , respectively. Then, the pair G   =   ( R ,   S ) of the IVFGs on G 1 [ G 2 ] is the CO of G 1 and G 2 if and only if for every [ ψ ,   θ ]     I [ 0 , 1 ] , the [ ψ ,   θ ] -level graph ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the CO of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) .
Proof. 
Suppose that G = ( R ,   S ) is the CO of the IVFGs G 1 and G 2 . By Theorem 2, we have R [ ψ , θ ]   =   ( R 1 ) [ ψ , θ ]   ×   ( R 2 ) [ ψ , θ ] . We prove S [ ψ , θ ]   =   E , where E is the edge set of the CO ( G 1 ) [ ψ , θ ] [ ( G 2 ) [ ψ , θ ] ] , for all [ ψ , θ ]     I [ 0 , 1 ] .
Suppose ( e 1 ,   e 2 ) ( f 1 ,   f 2 )     S [ ψ , θ ] . Then, ρ S l ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )     ψ and ρ S u ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )     θ .
Since G   =   ( R ,   S ) is the CO G 1 [ G 2 ] , one of the below conditions holds:
(i)
e 1   =   f 1 and e 2 f 2     E 2 ,
(ii)
e 2 = f 2 and e 1 f 1     E 1 ,
(iii)
e 2     f 2 and e 1 f 1     E 1 .
For conditions (i) and (ii) in the proof of Theorem 2, we obtain ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) E . For case (iii), we have
ρ S l ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )   =   min { ρ R 2 l ( e 2 ) ,   ρ R 2 l ( f 2 ) ,   ρ S 1 l ( e 1 f 1 ) }     ψ ,
ρ S u ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )   =   min { ρ R 2 u ( e 2 ) ,   ρ R 2 u ( f 2 ) ,   ρ S 1 u ( e 1 f 1 ) }     θ .
Therefore,
ρ R 2 l ( e 2 )     ψ , ρ R 2 l ( f 2 ) ψ , ρ S 1 l ( e 1 f 1 ) ψ ,  
ρ R 2 u ( e 2 ) θ , ρ R 2 u ( f 2 ) θ , ρ S 1 u ( e 1 f 1 ) θ .
It follows that e 2 ,   f 2 ( R 2 ) [ ψ , θ ] and e 1 f 1     ( S 1 ) [ ψ , θ ] ; that is, ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )     E . Thus, S [ ψ , θ ]     E . For each ( ( e ,   e 2 ) ( e ,   f 2 ) )     E ,
ρ R 1 l ( e )     ψ , ρ R 1 u ( e )     θ , ρ S 2 l ( e 2 f 2 )     ψ , ρ S 2 u ( e 2 f 2 )     θ .
Since G   =   ( R ,   S ) is the CO G 1 [ G 2 ] , we have
ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) )   =   min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) }     ψ
ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) )   =   min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) }     θ .
Thus, ( e ,   e 1 ) ( e ,   f 2 )     S [ ψ , θ ] . Similarly, for each ( ( e 1 ,   k ) ( f 1 ,   k ) ) E , we have ( e ,   e 2 ) ( e ,   f 2 )     S [ ψ , θ ] . For each ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )     E , e 2     f 2 .
ρ S 1 l ( e 1 f 1 )     ψ , ρ S 1 u ( e 1 f 1 ) θ ,
ρ R 2 l ( f 2 )     ψ , ρ R 2 u ( f 2 )     θ ,
ρ R 2 l ( e 2 )     ψ , ρ R 2 u ( e 2 )     θ .
Since G   =   ( R ,   S ) is the CO G 1 [ G 2 ] , we have:
ρ S l ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )   =   min { ρ R 2 l ( e 2 ) ,   ρ R 2 l ( f 2 ) ,   ρ S 1 l ( e 1 f 1 ) }     ψ ,
ρ S u ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) )   =   min { ρ R 2 u ( e 2 ) ,   ρ R 2 u ( f 2 ) ,   ρ S 1 u ( e 1 f 1 ) }     θ .
Hence, ( e 1 ,   e 2 ) ( f 1 ,   f 2 )     S [ ψ , θ ] . Therefore, E     S [ ψ , θ ] and so E   =   S [ ψ , θ ] .
Conversely, let ( R [ ψ , θ ] ,   S [ ψ , θ ] ) , [ ψ ,   θ ] I [ 0 , 1 ] be the CO of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) , and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) . By Theorem 2, we have
(i)
ρ R l ( e 1 ,   e 2 )   =   min { ρ R 1 l ( e 1 ) ,   ρ R 2 l ( e 2 ) } ρ R u ( e 1 ,   e 2 ) = min { ρ R 1 u ( e 1 ) ,   ρ R 2 u ( e 2 ) }  for all (e1, e2) ∈ X1 × X2.
(ii)
ρ S l ( ( e ,   e 2 ) ( e ,   f 2 ) )   =   min { ρ R 1 l ( e ) ,   ρ S 2 l ( e 2 f 2 ) } ρ S u ( ( e ,   e 2 ) ( e ,   f 2 ) )   =   min { ρ R 1 u ( e ) ,   ρ S 2 u ( e 2 f 2 ) }  for all eX1 and e2f2 ∈ E2.
(iii)
ρ S l ( ( e 1 ,   k ) ( f 1 ,   k ) )   =   min { ρ S 1 l ( e 1 f 1 ) ,   ρ R 2 l ( k ) } ρ S u ( ( e 1 ,   k ) ( f 1 ,   k ) )   =   min { ρ S 1 u ( e 1 f 1 ) ,   ρ R 2 u ( k ) }  for all kX2 and e1f1E1.
Also, we obtain:
ρ S l ( ( e 1 ,   e 2 ) ( f 1 ,   f 2 ) ) = min { ρ R 2 l ( e 2 ) ,   ρ R 2 l ( f 2 ) ,   ρ S 1 l ( e 1 f 1 ) } ,
ρ S u ( ( e 1 ,   e 2 ) ( f 1 , f 2 ) )   =   min { ρ R 2 u ( e 2 ) ,   ρ R 2 u ( f 2 ) ,   ρ S 1 u ( e 1 f 1 ) } ,
for all e 2 , f 2 X 2 , e 2 f 2 and e 1 f 1 E 1 .
Corollary 2.
Let G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) be IVFGs. Then, the CO G 1 [ G 2 ] is an IVFG.
Theorem 4.
Assume G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) are IVFGs of G 1   =   ( X 1 ,   E 1 ) and G 2   =   ( X 2 ,   E 2 ) , respectively, so that X 1     X 2   =   . Then, G   =   ( R ,   S ) is the union of G 1 and G 2 if and only if for every [ ψ , θ ] I [ 0 , 1 ] , the level graph ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the union of ( ( R 1 ) [ ψ , θ ] , ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) .
Proof. 
Suppose that G   =   ( R ,   S ) is the union of the IVFGs G 1 and G 2 . We show that R [ ψ , θ ]   =   ( R 1 ) [ ψ , θ ] ( R 2 ) [ ψ , θ ] for every [ ψ , θ ] I [ 0 , 1 ] .
Assume that e R [ ψ , θ ] , then e     X 1 X 2 or e     X 2 X 1 . If e     X 1 X 2 , then ρ R 1 l ( e )   =   ρ R l ( e )     ψ and ρ R 1 u ( e )   =   ρ R u ( e )     θ , which implies e     ( R 1 ) [ ψ , θ ] . If e     X 2 X 1 , we have e     ( R 2 ) [ ψ , θ ] . Therefore, e     ( R 1 ) [ ψ , θ ]     ( R 2 ) [ ψ , θ ] , and so R [ ψ , θ ]     ( R 1 ) [ ψ , θ ]     ( R 2 ) [ ψ , θ ] .
Let e     ( R 1 ) [ ψ , θ ]     ( R 2 ) [ ψ , θ ] , then e     ( R 1 ) [ ψ , θ ] , e     ( R 2 ) [ ψ , θ ] or e     ( R 2 ) [ ψ , θ ] and e     ( R 1 ) [ ψ , θ ] . In the first situation, ρ R l ( e )   =   ρ R 1 l ( e )     ψ and ρ R u ( e )   =   ρ R 1 u ( e )     θ , which implies e     R [ ψ , θ ] . In the second condition, ρ R l ( e )   =   ρ R 2 l ( e )     ψ and ρ R u ( e )   =   ρ R 2 u ( e )     θ , hence e     R [ ψ , θ ] .
Consequently, ( R 1 ) [ ψ , θ ]     ( R 2 ) [ ψ , θ ]     R [ ψ , θ ] . We prove that ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ]   =   S [ ψ , θ ] for all [ ψ , θ ] I [ 0 , 1 ] . Assume that e f     S [ ψ , θ ] , then e f     E 1 E 2 or e f     E 2 E 1 .
For e f     E 1 E 2 , we have ρ S 1 l ( e f )   =   ρ S l ( e f )     ψ and ρ S 1 u ( e f )   =   ρ S u ( e f )     θ . Therefore, e f     S 1 [ ψ , θ ] . Also, if e f     E 2 E 1 , then e f     S 2 [ ψ , θ ] . Thus, S [ ψ , θ ]     ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ] .
If e f     ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ] , then e f     ( S 1 ) [ ψ , θ ] ( S 2 ) [ ψ , θ ] or e f     ( S 2 ) [ ψ , θ ] ( S 1 ) [ ψ , θ ] .
In the first situation, ρ S l ( e f )   =   ρ S 1 l ( e f )     ψ and ρ S u ( e f )   =   ρ S 1 u ( e f )     θ , which implies e     S [ ψ , θ ] .
In the second condition, there is also e f     S [ ψ , θ ] . Thus, ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ]     S [ ψ , θ ] .
Conversely, suppose for all [ ψ , θ ]     I [ 0 , 1 ] , ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the union of ( ( R 1 [ ψ , θ ] ) ,   ( S 1 [ ψ , θ ] ) ) and ( ( R 2 [ ψ , θ ] ) ,   ( S 2 [ ψ , θ ] ) ) . Let e     X 1 and ρ R 1 l ( e )   =   ψ , ρ R 1 u ( e )   =   θ , ρ R l ( e )   =   ψ , ρ R u ( e )   =   θ , for ψ , θ , ψ , θ [ 0 , 1 ] .
Then, e     ( R 1 ) [ ψ , θ ] and e     R [ ψ , θ ] . By the hypothesis, e     R [ ψ , θ ] and e     ( R 1 ) [ ψ , θ ] .
Therefore,
ρ R l ( e )     ψ , ρ R u ( e )     θ , ρ R 1 l ( e ) ψ , ρ R 1 u ( e ) θ .
It follows, ρ R 1 l ( e )     ρ R l ( e ) , ρ R 1 u ( e )     ρ R u ( e ) , ρ R 1 l ( e )     ρ R l ( e )   ρ R 1 u ( e )     ρ R u ( e ) . Hence, ρ R 1 l ( e )   =   ρ R l ( e ) ,   ρ R 1 u ( e )   =   ρ R u ( e ) .
Similarly, for every e     X 2 , we obtain ρ R 2 l ( e )   =   ρ R l ( e ) , ρ R 2 u ( e )   =   ρ R u ( e ) .
Also, we obtain:
(i) ρ S l ( e f )   =   ρ S 1 l ( e f ) i f e f E 1 ρ S l ( e f )   =   ρ S 2 l ( e f ) i f e f E 2 .
(ii) ρ S u ( e f )   =   ρ S 1 u ( e f ) i f e f E 1 ρ S u ( e f )   =   ρ S 2 u ( e f ) i f e f E 2
Corollary 3.
Let G 1 = ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) be IVFGs of G 1   =   ( X 1 ,   E 1 ) and G 2   =   ( X 2 ,   E 2 ) , respectively, and X 1 X 2   =   , then G 1 G 2 is an IVFG.
Theorem 5.
Suppose G 1   =   ( R 1 ,   S 1 ) and G 2   =   ( R 2 ,   S 2 ) are IVFGs of G 1   =   ( X 1 ,   E 1 ) and G 2   =   ( X 2 ,   E 2 ) , respectively, and X 1 X 2   =   . Then, the pair G   =   ( R ,   S ) of the IVFGd on G 1   +   G 2 is the join of G 1 and G 2 if and only if for every [ ψ , θ ] I [ 0 , 1 ] , ( R [ ψ , θ ] , S [ ψ , θ ] ) is the join of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) .
Proof. 
Suppose that G   =   ( R ,   S ) is the join of the IVFGs G 1 and G 2 . We show that R [ ψ , θ ] = ( R 1 ) [ ψ , θ ] ( R 2 ) [ ψ , θ ] and S [ ψ , θ ]   =   ( S 1 ) [ ψ , θ ] ( S 2 ) [ ψ , θ ] E [ ψ , θ ] for all [ ψ , θ ] I [ 0 , 1 ] , where E [ ψ , θ ] is the set of all edges joining the nodes ( R 1 ) [ ψ , θ ] and ( R 2 ) [ ψ , θ ] .
According to the proof of Theorem 4, ( S 1 ) [ ψ , θ ] ( S 2 ) [ ψ , θ ] S [ ψ , θ ] . If e f     E [ ψ , θ ] , then ρ R 1 l ( e )     ψ , ρ R 1 u ( e )     θ , ρ R 2 l ( f )     ψ , ρ R 2 u ( f )     θ . Hence,
ρ S l ( e f )   =   min { ρ R 1 l ( e ) ,   ρ R 2 l ( f ) }     ψ ,  
and
ρ S u ( e f )   =   min { ρ R 1 u ( e ) ,   ρ R 2 u ( f ) }     θ .
Therefore, e f     S [ ψ , θ ] . It follows, ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ]     E [ ψ , θ ]     S [ ψ , θ ] .
For each e f     S [ ψ , θ ] , if e f     E 1     E 2 , then e f     ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ] . If e     X 1 and f X 2 , then
min { ρ R 1 l ( e ) ,   ρ R 2 l ( f ) }   =   ρ S l ( e f )     ψ ,
and
min { ρ R 1 u ( e ) ,   ρ R 2 u ( f ) }   =   ρ S u ( e f )     θ .
Therefore, e     ( R 1 ) [ ψ , θ ] , f     ( R 2 ) [ ψ , θ ] , and e f     E [ ψ , θ ] .
Thus, S [ ψ , θ ]     ( S 1 ) [ ψ , θ ]     ( S 2 ) [ ψ , θ ]     E [ ψ , θ ] .
Conversely, suppose ( R [ ψ , θ ] ,   S [ ψ , θ ] ) is the join of ( ( R 1 ) [ ψ , θ ] ,   ( S 1 ) [ ψ , θ ] ) and ( ( R 2 ) [ ψ , θ ] ,   ( S 2 ) [ ψ , θ ] ) for [ ψ , θ ] I [ 0 , 1 ] .
We have
(i)
ρ R l ( e )   =   ρ R 1 l ( e ) i f e     X 1 ρ R l ( e )   =   ρ R 2 l ( e ) i f e     X 2
(ii)
ρ R u ( e )   =   ρ R 1 u ( e ) i f e     X 1 ρ R u ( e )   =   ρ R 2 u ( e ) i f e     X 2 .
Also, we obtain
(iii)
ρ S l ( e f )   =   ρ S 1 l ( e f ) i f e f     E 1 ρ S l ( e f )   =   ρ S 2 l ( e f ) i f e f     E 2
(iv)
ρ S u ( e f )   =   ρ S 1 u ( e f ) i f e f     E 1 ρ S u ( e f )   =   ρ S 2 u ( e f ) i f e f     E 2 .
Suppose e     X 1 , f     X 2 and consider m i n { ρ R 1 l ( e ) ,   ρ R 2 l ( f ) }   =   ψ , m i n { ρ R 1 u ( e ) ,   ρ R 2 u ( f ) } = τ , ρ S l ( e f )   =   ψ , ρ S u ( e f )   =   θ .
Then, e     ( R 1 ) [ ψ , θ ] , f     ( R 2 ) [ ψ , θ ] and e f     S [ ψ , θ ] .
It follows that e f     S [ ψ , θ ] , e     ( R 1 ) [ ψ ,   θ ] and f ( R 2 ) [ ψ ,   θ ] . So, ρ S l ( e f )     ψ , ρ S u ( e f )     θ , ρ R 1 l ( e ) ψ , ρ R 1 u ( e )     θ , ρ R 2 l ( f )     ψ , ρ R 2 u ( f )     θ . Therefore,
ρ S l ( e f )     ψ   =   min { ρ R 1 l ( e ) ,   ρ R 2 l ( f ) }     ψ   =   ρ S l ( e f ) ,  
ρ S u ( e f )     θ   =   min { ρ R 1 u ( e ) ,   ρ R 2 u ( f ) }     θ   =   ρ S u ( e f ) ,  
and then we have
ρ S l ( e f )   =   min { ρ R 1 l ( e ) ,   ρ R 2 l ( f ) } , ρ S u ( e f )   =   min { ρ R 1 u ( e ) ,   ρ R 2 u ( f ) } .

4. Application of Interval-Valued Fuzzy Graph to Find the Most Effective Person in a Hospital Information System

The growth of the communication, telecommunication, and informatics industries is facing a new revolution every day. The information and communication technology revolution has had a profound effect on all economic, social, political, and security sectors of the country. One of the most important areas of information technology applications is in the field of health and treatment. A hospital information system is the first and most basic system for providing health care. Hospital information systems are computer systems designed to easily manage medical and hospital information and to improve the quality of health care. Research has shown that the use of hospital information systems has improved the quality of health services and increased customer satisfaction. Some of the problems of health care systems are as follows: the dispersion of patients’ information and lack of access to their records, poor cooperation between physicians and health care workers, and poor access to required medical information. These problems can be solved through the development of information technology, especially hospital (health) information systems. Hospital information systems are designed to automate the affairs of hospitals, such as reporting test results, entering doctor’s instructions, prescribing medication, controlling pharmacy inventory, central warehouses, feeding units, etc. In the hospital information system, an electronic file is created for each patient that covers all hospital activities (including treatment, diagnosis, finance, etc.) from admission to discharge. In this system, all medical procedures, medication orders, and diagnostic services are sent through the system to clinics and paraclinics and even administrative centers, such as accounting, pharmacies, warehouses, and other units, and their answers are received. Therefore, the start and end times of all actions in the system are clear and traceable. Hence, a hospital information system is an information system in which information is stored in a comprehensive database and is available to consumers in special forms at the time and place of need. Therefore, considering the importance of the hospital information system and its role in improving medical and health services, we intend to specify the most effective employee in the field of technology and information of a hospital in terms of registering information about patients, medicines, finances, laboratories, etc. Suppose the vertices of the IVFG are an information register building and the edges of this graph are the degree of interaction in between. The set of staff is
A = {Moradi, Kamali, Ahmadi, Yegane, Bahmani, Nazari}
(a)
Moradi and Bahmani have been co-workers for 16 years.
(b)
Yegane is very accurate in calculating and recording information about the hospital’s finances, and all employees are satisfied with him.
(c)
In recording information about nurses, it is very important to record their expertise, work experience, and the duration of each activity during a day with great care to have the most active nurses serve patients. Kamali is the best choice to undertake this accountability process.
(d)
Nazari and Ahmadi have a long history of conflict.
(e)
According to Ahmadi’s experiences recognizing drugs and their effectiveness, he is the best option for recording information about drugs.
According to the above values, we consider an IVFG. The vertices show each of the department staff members. The edges indicate the level of friendship and fondness between staff. For the weight of the vertices, the lower bound and the upper bound mean the level of staff capability. The lower bound and the upper bound for the weight of the edges mean the amount of friendship and conflict, respectively. The name of the staff and level of staff capability are indicated in Table 1 and Table 2. The adjacency matrix corresponding to Figure 7 is indicated in Table 3.
Figure 7 shows that Ahmadi has 20 % of the necessary ability to register drug information in the system, but unfortunately, he does not have the necessary 30 % authority to do so. The directional edge Yegane–Nazari indicates that there is only 10 % comradeship among these two staff members, and unfortunately they have 20 % conflict. Clearly, Kamali has dominion over both Moradi and Yegane, with his dominance over both at 30 % . It is clear that Kamali is the most influential staff member of the hospital information system because he inspects both the laboratory information officer and the pecuniary information officer and has 30 % of the authority in the hospital.
As we saw in the above example, fuzzy influence graphs play a significant role in determining worthy and effective people in an organization and social institutions, and they are used in the fields of medical and psychological sciences to diagnose diseases. Interval-valued fuzzy influence graphs are useful tools for chemical engineers to model various relationships in a process. These graphs are used to systematically map an entire chain of processes and controllers to describe the effect. The interval-valued fuzzy influence graph theory is growing as a dominant field of research in mathematics because of its application to a variety of problems, including clustering, data mining, decision-making, communication, etc. It has major contribution potential in modeling, preserving, and performing different types of physical problems in networking and trafficking. Several interval-valued fuzzy influence graph parameters are real indicators of network performance and efficiency. They are very useful to handle networks with extraneous support and flows. Especially, the modeling of the ramping system of highways can be performed using interval-valued fuzzy influence graphs in order to control the unpredicted flow between cities and highways.

5. Conclusions

IVFGs are very useful tools for studying different computational intelligence and computer science domains. They have many applications in different sciences, such as optimization, topology, neural networks, and operations research. In graph theory, operations are easily used in many hybrid applications. In different situations, they present appropriate construction means. Hence, in this paper, we introduced four important operations on an IVFG level graph: the Cartesian product, composition, union, and join. Some properties of level graphs of IVFGs were discussed. Finally, an application of IVFG was presented. Our upcoming investigation involves an in-depth exploration of diverse forms of domination on interval-valued fuzzy influence graphs, covering global domination, restrained domination, semi-global domination, and K-domination. We aim to provide a clear understanding of the properties and characteristics of each of these domination types and their practical implications for real-world applications.

Author Contributions

Y.R., S.L. and A.A.T.; methodology, S.L., M.M. and Y.R.; validation, S.L. and A.A.T.; formal analysis, Y.R. and M.M.; investigation, M.M., A.A.T. and S.L.; data curation, A.A.T., S.L. and Y.R.; writing—original draft preparation, Y.R. and A.A.T.; writing—review and editing, S.L., A.A.T. and M.M.; visualization, M.M., Y.R. and S.L.; supervision, S.L.; project administration, Y.R. and A.A.T.; funding acquisition, Y.R. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. 62172116).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. The Concept of a Linguistic Variable and Its Application to Approximate Reasoning-1. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  3. Roy, M.K.; Biswas, R. I-V fuzzy relations and Sanchez’s approach for medical diagnosis. Fuzzy Sets Syst. 1992, 47, 35–38. [Google Scholar] [CrossRef]
  4. Rosenfeld, A. Fuzzy graphs. In Fuzzy Sets and Their Applications; Zadeh, L.A., Fu, K.S., Shimura, M., Eds.; Academic Press: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
  5. Bhattacharya, P. Some remarks on fuzzy graphs. Pattern Recognit. Lett. 1987, 6, 297–302. [Google Scholar] [CrossRef]
  6. Mordeson, J.N.; Peng, C.S. Operations on fuzzy graphs. Inf. Sci. 1994, 79, 159–170. [Google Scholar] [CrossRef]
  7. Akram, M.; Dudek, W.A. Interval-valued fuzzy graphs. Comput. Math. Appl. 2011, 61, 289–299. [Google Scholar] [CrossRef]
  8. Akram, M. Interval-valued fuzzy line graphs. Neural Comput. Appl. 2012, 21, 145–150. [Google Scholar] [CrossRef]
  9. Akram, M.; Alshehri, N.O.; Dudek, W.A. Certain types of interval-valued fuzzy graphs. J. Appl. Math. 2013, 2013, 857070. [Google Scholar] [CrossRef]
  10. Akram, M.; Yousaf, M.M.; Dudek, W.A. Self Centered Interval-Valued Fuzzy Graphs. In African Mathematical Union; Springer: Berlin/Heidelberg, Germany, 2014. [Google Scholar]
  11. Hongmei, J.; Lianhua, W. Interval-valued fuzzy subsemigroups and subgroups sssociated by intervalvalued suzzy graphs. In Proceedings of the 2009 WRI Global Congress on Intelligent Systems, Xiamen, China, 19–21 May 2009; pp. 484–487. [Google Scholar]
  12. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef]
  13. Jan, N.; Ullah, K.; Mahmood, T.; Garg, H.; Davvaz, B.; Borumand, S.A.; Broumi, S. Some Root Level Modifications in Interval Valued Fuzzy Graphs and Their Generalizations Including Neutrosophic Graphs. Mathematics 2019, 7, 72. [Google Scholar] [CrossRef]
  14. Nagoorgani, A.; Radha, K. Isomorphism on fuzzy graphs. Int. J. Comput. Math. Sci. 2008, 2, 190–196. [Google Scholar]
  15. Rashmanlou, H.; Pal, M. Antipodal interval-valued fuzzy graphs. Int. J. Appl. Fuzzy Sets Artif. Intell. 2013, 3, 107–130. [Google Scholar]
  16. Pal, M. Certain types of m-polar interval-valued fuzzy graph. J. Intell. Fuzzy Syst. 2020, 39, 3137–3150. [Google Scholar]
  17. Zihni, O.; Kara, G. Interval-valued fuzzy soft graphs. Topol. Algebra Appl. 2017, 5, 19–27. [Google Scholar]
  18. Krishna, K.K.; Talebi, Y.; Rashmanlou, H.; Talebi, A.A.; Mofidnakhaei, F. New Concept of Cubic Graph with Application. J. Mult. Valued Log. Soft Comput. 2019, 33, 135–154. [Google Scholar]
  19. Dey, A.; Pal, A.; Pal, T. Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem. Mathematics 2016, 4, 62. [Google Scholar] [CrossRef]
  20. Dey, A.; Pradhan, R.; Pal, A.; Pal, T. A Genetic Algorithm for Solving Fuzzy Shortest Path Problems with Interval Type-2 Fuzzy Arc Lengths. Malays. J. Comput. Sci. 2018, 31, 255–270. [Google Scholar] [CrossRef]
  21. Dey, A.; Son, L.H.; Pal, A.; Long, H.V. Fuzzy minimum spanning tree with interval type 2 fuzzy arc length: Formulation and a new genetic algorithm. Soft Comput. 2020, 24, 3963–3974. [Google Scholar] [CrossRef]
  22. Qiang, X.; Akhoundi, M.; Kou, Z.; Liu, X.; Kosari, S. Novel Concepts of Domination in Vague Graphs with Application in Medicine. Math. Probl. Eng. 2021, 2021, 6121454. [Google Scholar] [CrossRef]
  23. 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]
  24. 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]
Figure 1. IVFGs G 1 and G 2 .
Figure 1. IVFGs G 1 and G 2 .
Symmetry 15 02106 g001
Figure 2. The CP of the IVFGs G 1 and G 2 .
Figure 2. The CP of the IVFGs G 1 and G 2 .
Symmetry 15 02106 g002
Figure 3. The [ 0.2 , 0.4 ] -level graphs of the IVFGs G 1 and G 2 .
Figure 3. The [ 0.2 , 0.4 ] -level graphs of the IVFGs G 1 and G 2 .
Symmetry 15 02106 g003
Figure 4. The CP of graphs G 1 [ 0.2 , 0.4 ] and G 2 [ 0.2 , 0.4 ] .
Figure 4. The CP of graphs G 1 [ 0.2 , 0.4 ] and G 2 [ 0.2 , 0.4 ] .
Symmetry 15 02106 g004
Figure 5. The [ 0.2 , 0.3 ] -level graphs of the IVFGs G 1 and G 2 .
Figure 5. The [ 0.2 , 0.3 ] -level graphs of the IVFGs G 1 and G 2 .
Symmetry 15 02106 g005
Figure 6. The CP of graphs G 1 [ 0.2 , 0.3 ] and G 2 [ 0.2 , 0.3 ] .
Figure 6. The CP of graphs G 1 [ 0.2 , 0.3 ] and G 2 [ 0.2 , 0.3 ] .
Symmetry 15 02106 g006
Figure 7. Interval-valued fuzzy digraph.
Figure 7. Interval-valued fuzzy digraph.
Symmetry 15 02106 g007
Table 1. The name of employees in hospital and their services.
Table 1. The name of employees in hospital and their services.
NameServices
MoradiResponsible for recording laboratory information
KamaliResponsible for registering nurses’ information
AhmadiResponsible for registering drug information
YeganeResponsible for registering financial information
BahmaniResponsible for registering  radiological information
NazariResponsible for registering clinical information
Table 2. The level of staff capability.
Table 2. The level of staff capability.
Name [ ρ S l , ρ S u ]
Moradi[0.3, 0.4]
Kamali[0.4, 0.5]
Ahmadi[0.2, 0.3]
Yegane[0.3, 0.4]
Bahmani[0.2, 0.4]
Nazari[0.1, 0.2]
Table 3. Adjacency matrix corresponding to Figure 7.
Table 3. Adjacency matrix corresponding to Figure 7.
NameMoradiKamaliAhmadiYeganeBahmaniNazari
Moradi [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ]
Kamali [ 0.3 , 0.4 ] [ 0 , 0 ] [ 0.1 , 0.2 ] [ 0.3 , 0.4 ] [ 0 , 0 ] [ 0 , 0 ]
Ahmadi [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ]
Yegane [ 0 , 0 ] [ 0 , 0 ] [ 0.2 , 0.2 ] [ 0 , 0 ] [ 0 , 0 ] [ 0.1 , 0.2 ]
Bahmani [ 0 , 0 ] [ 0 , 0 ] [ 0.1 , 0.3 ] [ 0 , 0 ] [ 0 , 0 ] [ 0 , 0 ]
Nazari [ 0 , 0 ] [ 0 , 0 ] [ 0.1 , 0.2 ] [ 0 , 0 ] [ 0.1 , 0.2 ] [ 0 , 0 ]
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

Rao, Y.; Lei, S.; Talebi, A.A.; Mojahedfar, M. A Novel Concept of Level Graph in Interval-Valued Fuzzy Graphs with Application. Symmetry 2023, 15, 2106. https://doi.org/10.3390/sym15122106

AMA Style

Rao Y, Lei S, Talebi AA, Mojahedfar M. A Novel Concept of Level Graph in Interval-Valued Fuzzy Graphs with Application. Symmetry. 2023; 15(12):2106. https://doi.org/10.3390/sym15122106

Chicago/Turabian Style

Rao, Yongsheng, Siran Lei, Ali Asghar Talebi, and Masomeh Mojahedfar. 2023. "A Novel Concept of Level Graph in Interval-Valued Fuzzy Graphs with Application" Symmetry 15, no. 12: 2106. https://doi.org/10.3390/sym15122106

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