Next Article in Journal
Quantization for Infinite Affine Transformations
Previous Article in Journal
Boundary Value Problem for Fractional q-Difference Equations with Integral Conditions in Banach Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Graphical Fuzzy Metric Spaces with Application to Fractional Differential Equations

1
Department of Mathematics, University of Management and Technology Lahore, Lahore 54770, Pakistan
2
Office of Research, Innovation and Commercialization, University of Management and Technology Lahore, Lahore 54770, Pakistan
3
Department of Pharmaceutical Sciences, “Vasile Goldiș” Western University of Arad, L. Rebreanu Street, no. 86, 310048 Arad, Romania
4
Department of Mathematics, Babeș-Bolyai University, M. Kogălniceau Street, no. 1, 400084 Cluj-Napoca, Romania
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2022, 6(5), 238; https://doi.org/10.3390/fractalfract6050238
Submission received: 7 April 2022 / Revised: 20 April 2022 / Accepted: 23 April 2022 / Published: 25 April 2022

Abstract

:
In this article, the authors introduced the concept of graphical fuzzy metric spaces which is a generalization of fuzzy metric spaces with the help of a relation. The authors discussed some topological structure, convergence criteria, and proved a Banach fixed-point result in graphical fuzzy metric space. As an application of obtained results, the authors find a solution of an integral equation and nonlinear fractional differential equations in the context of graphical fuzzy metric spaces. The authors provided some examples to illustrate the obtained results herein.

1. Introduction

The subject of graph theory is gaining popularity due to its applications. It is in the mainstream of mathematics and applied sciences, where it plays an important role. A graph Ω = ( V ( Ω ) , E ( Ω ) ) is consisting upon an ordered pair, where V ( Ω )   is the set of all vertices of a graph   Ω and E ( Ω ) represents the relation among the vertices of the graph Ω , named as a set of edges. Further, | V | represents the cardinality of vertex set V (known as order of graph Ω ), and | E | represents the cardinality of edge set E of graph Ω . Main graph theory has two classes; one class deals with the undirected graphs if there is no direction or restriction for moving one vertex to the other if both vertices are connected, and other class deals with the directed graphs in which every edge has a particular direction. Edges in a directed graph are ordered pairs, while edges in an undirected graph are unordered pairs. Leonhard Eular (1736) solved the classic unsolved problem known as the Konigsberg Bridge Problem; he was named the “Father of Graph Theory.” Due to the graphical nature of this theory, there are several applications, including data flow diagrams, decision-making abilities, the capacity to demonstrate relationships between things, and the ability to easily adapt and modify the existing systems. Graph theory has a wide range of applications in chemical sciences [1,2], data science [3], and architecture [4].
On the other hand, Jachymski [5] used the graphical structure in fixed-point theory and proved several fixed-point results via graphical structure. Shukla et al. [6] used graphical structure in metric spaces and generalized several fixed-point results in graphical metric space with an application to integral equations. Chen et al. [7] introduced a graphical convex metric space and fixed-point results for set valued G-contraction mappings with application.
In 1965, fuzzy set theory initiated by L. A. Zadeh [8] introduced a method to deal with uncertainty and vagueness in our daily life. Kramosil and Michalek [9] used the notions of fuzzy sets with metric spaces established the notion of fuzzy metric spaces (FMSs) via continuous t-norms (CTNs), in which the notion of probabilistic metric spaces is generalized. George and Veeramani ([10,11]) modified the concept of FMSs and obtained a Hausdorff topology for this kind of FMSs. Moreover, the theory of fixed points on FMS was developed in many directions, generalizing the fuzzy metric space or using different type of operators [12,13,14,15,16,17,18,19].
In this manuscript, the authors will generalize the notion of FMSs. The main objectives of this manuscript are following:
(a)
to establish a novel notion of graphical FMSs;
(b)
to make a comparison between ordered FMS and graphical FMS;
(c)
to generalize several contraction mappings and fixed point results;
(d)
to find the existence of solution of integral equation via fixed-point theory;
(e)
to find the existence of a solution of fractional differential equations via fixed-point theory.

Some Basics from Graph Theory

In this section, the authors discuss some basic definitions from graph theory that are useful for readers to understand this work. For more details, the authors refer to the papers of Jachymski [5] and Shukla et al. [6].
Consider a non-empty set Ξ and assume Ξ × Ξ to be the cartesian product; the authors denote the diagonal of Ξ × Ξ by Λ . Suppose   Ω to be a direct graph in which the edges are not parallel, such that the set of its vertices V ( Ω ) coincides with   Ξ , and all loops are contained in the set of its edges E ( Ω ) ; then, call that Ξ is endowed with graph   Ω = ( V ( Ω ) , E ( Ω ) )   if   Λ E ( Ω ) . Here Ω 1 denote the graph’s Ω conversion and defined by:
V ( Ω 1 ) = V ( Ω )   and   E ( Ω 1 ) = { ( ʋ , ɵ ) Ξ × Ξ ( ɵ , ʋ )   E ( Ω ) } .  
The undirected graph examined from Ω is denoted by Ω ^ that contains all the edges of Ω 1 . The authors thus write:
V ( Ω ^ ) = V ( Ω )   and   E ( Ω ^ ) = E ( Ω )   E ( Ω 1 ) .
Suppose ʋ , ɵ are the vertices of a graph Ω ; then the path having length l from ʋ   to   ɵ in Ω is a sequence { ʋ i } i = 0 l of l + 1 vertices such that ʋ 0   =   ʋ ,   ʋ l   =   ɵ   and   ( ʋ i 1 , ʋ i ) E ( Ω )   for   i = 1 , 2 , , l . If there exists a path between any two vertices, then the authors say that Ω is connected. If there exists a path from ʋ   to   ɵ   and   ɵ   to   ʋ   between two vertices in a directed graph, then the authors say that vertices ʋ   and   ɵ are connected. If every one of its edges are dealt as being undirected and there is a path between every two vertices, then the authors say that Ω is weakly connected. Alternatively, if Ω ^ is connected, then Ω is weakly connected.
The authors define a relation P on Ξ by ( ʋ P ɵ ) Ω if and only if there is a direct path from ʋ   to   ɵ   in   Ω The authors say ω ( ʋ P ɵ ) Ω if ω is included in a direct path from   ʋ   to   ɵ   in   Ω . For l , the authors define:
[ ʋ ] Ω l = { ɵ Ξ there   is   a   directed   path   from   ʋ   to   ɵ   of   length   l } .
A sequence { ʋ } n   in   Ξ is known as Ω - termwise connected if it satisfies ( ʋ n P ʋ n + 1 ) Ω for all n . A connected component of an undirected graph is a sub-graph that has any two vertices connected to each other by pathways and is not connected to anymore vertices in the super-graph.
In this paper, the authors allot a fuzzy weight Ʋ Ω ( ʋ , ɵ , t ) to a degree of nearness between ʋ   and   ɵ at   t , where t is interpreted as a time. The authors assume that the graphs under study are directed with non-empty sets of vertices and edges throughout this paper.

2. New Notions with Examples

In this section, several novel notions are defined with some non-trivial examples.
Definition 1.
Suppose Ξ be a non-empty set endowed with a graph   Ω , is a continuous t-norm, and Ʋ Ω is a fuzzy set on Ξ × Ξ × ( 0 , + ) ; the mapping Ʋ Ω is known as a graphical fuzzy metric (FM), if
 (a) 
Ʋ Ω ( ʋ , ɵ , t ) > 0 ;
 (b) 
Ʋ Ω ( ʋ , ɵ , t ) = 1 if and only if ʋ   =   ɵ ;
 (c) 
Ʋ Ω ( ʋ , ɵ , t ) = Ʋ Ω ( ɵ , ʋ , t ) ;
 (d) 
i f   ( ʋ P ɵ ) Ω   s u c h   t h a t   ω ( ʋ P ɵ ) Ω   i m p l i e s   Ʋ Ω ( ʋ , ɵ , t + s ) Ʋ Ω ( ʋ , ω , t ) Ʋ Ω ( ω , ɵ , s ) ;
 (e) 
Ʋ Ω ( ʋ , ɵ , · ) : ( 0 , + ) [ 0 , 1 ] is continuous,
for all   ʋ , ɵ   Ξ and t , s > 0 . Then ( Ξ , Ʋ Ω , ) is known as a graphical FMS.
Example 1.
Every FMS is a graphical FMS with a graph Ω , where V ( Ω ) = Ξ and E ( Ω ) = Ξ × Ξ at a time t .
Definition 2.
Let ( Ξ , ) be a partially ordered set, is a continuous t-norm, and Ʋ is a fuzzy set on Ξ × Ξ × ( 0 , + ) ; the mapping Ʋ is known as ordered fuzzy metric, if
 (i) 
Ʋ ( ʋ , ɵ , t ) > 0 ;
 (ii) 
Ʋ ( ʋ , ɵ , t ) = 1 if and only if ʋ   =   ɵ ;
 (iii) 
Ʋ ( ʋ , ɵ , t ) =   Ʋ ( ɵ , ʋ , t ) ;
 (iv) 
Ʋ ( ʋ , ɵ , t + s )     Ʋ ( ʋ , ω , t ) Ʋ ( ω , ɵ , s ) ;
 (v) 
Ʋ ( ʋ , ɵ , · ) : ( 0 , + ) [ 0 , 1 ] is continuous.
For all   ʋ , ɵ , ω Ξ and t , s > 0 . Then ( Ξ , ʋ , ) is known as ordered FMS.
Example 2.
Let ( Ξ , ʋ , ) be an ordered FMS and Ω I be a graph defined by V ( Ω I ) = Ξ and E ( Ω I ) = { ( ʋ , ɵ ) Ξ × Ξ : Ʋ     ɵ } at a time t . Then   ( Ξ , ʋ Ω I , ) is a graphical FMS, where Ʋ Ω I ( ʋ , ɵ , t ) =   Ʋ ( ʋ , ɵ , t ) for all ʋ , ɵ   Ξ and t > 0 . Therefore, each ordered FMS is a graphical FMS with the given graph Ω I , Where Ω I is an induced graph by the partial order .
Example 3.
Let Ξ = define CTN by a b = min { a , b } and partial order by   = { ( ʋ , ɵ ) × ɵ   i s   d i v i s i b l e   b y   ʋ } . Define Ʋ by:
Ʋ ( ʋ , ɵ , t ) = { 1   if   ʋ   =   ɵ t t + ʋ ɵ         if   otherwise
Then Ʋ is an ordered FM and ( Ξ , Ʋ , ) is an ordered FMS. Then the graphical FM Ʋ Ω I ( ʋ , ɵ , t ) =   Ʋ ( ʋ , ɵ , t ) is not a fuzzy metric. Indeed, for   t   =   s   =   1 , ʋ   =   5 ,   ɵ   =   1 and   ω = 3 , the authors obtain:
Ʋ ( ʋ , ω , t + s ) = t + s t + s + ʋ ω = 2 17 .
On the other hand:
Ʋ ( ʋ , ɵ , t ) Ʋ ( ɵ , ω , s ) = min { t t + ʋ ɵ , s s + ɵ ω } = min { 1 6 , 1 4 } = 1 6 .
The authors have Ʋ ( ʋ , ω , t + s ) = 2 17 < 1 6 = Ʋ ( ʋ , ɵ , t ) Ʋ ( ɵ , ω , s ) .
Example 4.
Suppose an undirected graph Ω ( V , E ) with V ( Ω ) = Ξ . Let Ω j ,   j = 1 , 2 , , n be the components of Ω that are connected such that V ( Ω ) = j = 1 n V ( Ω j ) , E ( Ω ) = Λ   { j = 1 n E ( V j ) } at a time t . Let l ʋ ɵ be the length of the shortest from ʋ to ɵ . Now define Ʋ Ω : Ξ × Ξ × ( 0 , + ) [ 0 , 1 ] with a b = a · b by
Ʋ Ω ( ʋ , ɵ , t ) = { 1     if   ʋ   =   ɵ   o r   ʋ V i ,   ɵ V j ,   i , j { 1 , 2 , , n } ,   i j ; t t + l ʋ ɵ                                                           if       ʋ , ɵ V i ,   i { 1 , 2 , , n } .
Then, Ʋ Ω is a graphical FM on Ξ and ( Ξ , Ʋ Ω , ) is a graphical FMS.
Example 5.
Suppose Ξ = [ 0 , 1 ] and the graph Ω ( V , E ) described by V ( Ω ) = Ξ and E ( Ω ) = Λ   { ( ʋ , ɵ ) Ξ × Ξ ʋ , ɵ ( 0 , 1 ] ,   ʋ ɵ } at a time t . Let   a b = min { a , b } and describe a mapping Ʋ Ω Ξ × Ξ × ( 0 , + ) [ 0 , 1 ] by
Ʋ Ω ( ʋ , ɵ , t ) = { 1                                                             if     ʋ   =   ɵ ; t t + ʋ ɵ     if     ʋ , ɵ ( 0 , 1 ] ,   ʋ     ɵ ; t t + ( ʋ + ɵ )                                         if otherwise .
Then, Ʋ Ω is a graphical FM on Ξ and ( Ξ , Ʋ Ω , ) is a graphical FMS. Indeed, Ʋ Ω is not an FM on Ξ . Let   ʋ   = 1 2 ,   ɵ   = 1 10 ,   ω   = 1 and t = s = 1 , therefore deducing that:
Ʋ Ω ( ʋ , ω , t + s ) = 4 5 < 20 21 = Ʋ Ω ( ʋ , ɵ , t ) Ʋ Ω ( ɵ , ω , s ) .
As seen in the above examples, every FMS is a graphical FMS, but the converse is not true.
Definition 3.
Let ( Ξ , Ʋ Ω , ) be a graphical FMS. An open ball B Ω ( ʋ , r , t ) with center   ʋ     Ξ , radius r > 0 and t > 0 is defined by
B Ω ( ʋ , r , t ) = { ɵ     Ξ ( ʋ P ɵ ) Ω ,   Ʋ Ω ( ʋ , ɵ , t ) > 1 r } .
Since Λ E ( Ω ) , then the authors have ʋ B Ω ( ʋ , r , t ) for all ʋ     Ξ ,   r > 0   a n d   t > 0 . The collection is known as the neighbourhood system for the topology τ Ω and defined by β = { B Ω ( ʋ , r , t ) ʋ     Ξ , r > 0 , t > 0 } on Ξ induced by the graphical FM Ʋ Ω . Openly, U is a subset of Ξ that is known as open for each ʋ     U if there exists an r > 0 such that B Ω ( ʋ , r , t ) U for t > 0 . Indeed, if complement Ξ \ C is open of a subset C of Ξ then it is known as closed.
Lemma 1.
Every open ball in Ξ is an open set.
Proof. 
Suppose an open ball B Ω ( ʋ , r , t ) with center ʋ , radius r , and time t . Assume ɵ   =   B Ω ( ʋ , r , t ) , then Ʋ Ω ( ʋ , ɵ , t ) > 1 r . Since Ʋ Ω ( ʋ , ɵ , t ) > 1 r , there exist t 0 ( 0 , t ) such that Ʋ Ω ( ʋ , ɵ , t 0 ) > 1 r . Put r 0 = Ʋ Ω ( ʋ , ɵ , t 0 ) . As r 0 > 1 r , there exists u ( 0 , 1 ) such that r 0 > 1 u > 1 r . At this instant for specified r 0 and u such that r 0 > 1 u , there exists r 1 , r 2 ( 0 , 1 ) such that r 0 r 1 > 1 u . Set r 3 = max { r 1 , r 2 } and let the open ball B Ω ( ɵ , 1 r 3 , t t 0 ) . The authors claim that B Ω ( ɵ , 1 r 3 , t t 0 ) B Ω ( ʋ , r , t ) . By definition, there is ( ʋ P ɵ ) Ω and ( ɵ P ω ) Ω such that ( ʋ P ω ) Ω . At this instant, suppose ω B Ω ( ɵ , 1 r 3 , t t 0 ) . Then Ʋ Ω ( ɵ , ω , t t 0 ) > r 3 . Therefore,
Ʋ Ω ( ʋ , ω , t ) Ʋ Ω ( ʋ , ɵ , t 0 ) Ʋ Ω ( ɵ , ω , t t 0 ) r 0 r 3 r 0 r 1 1 u > 1 r .
Therefore, ω B Ω ( ʋ , r , t ) and B Ω ( ɵ , 1 r 3 , t t 0 ) B Ω ( ʋ , r , t ) .
Next, in graphical FMS, the authors define the terms convergence, Cauchy sequence, and completeness.
Definition 4.
Assume ( Ξ , Ʋ Ω , ) to be a graphical FMS and a sequence { ʋ n } in Ξ . Then   { ʋ n } is known as convergent and converges to ʋ Ξ if, for known ε > 0 , there exists n 0 such that Ʋ Ω ( ʋ n , ʋ , t ) > 1 ε for all n > n 0 . It is obvious that the sequence { ʋ n } is convergent and converges to ʋ , if and only if lim n + Ʋ Ω ( ʋ n , ʋ , t ) = 1 .
Remark 1.
In a graphical FMS, the limit of a sequence may not be unique. In order to examine this, suppose Ξ = { 1 2 n   { 0 } n } , and let Ω be a graph with V ( Ω ) = Ξ and   E ( Ω ) = { ( ʋ , ɵ ) Ξ × Ξ ɵ ʋ } at a time t . Let a b = a · b and describe a mapping Ʋ Ω Ξ × Ξ × ( 0 , + ) [ 0 , 1 ] by:
Ʋ Ω ( ʋ , ɵ , t ) = { 1                                                                             if ʋ = ɵ ; t t + ʋ ɵ     if     ʋ , ɵ Ξ \ { 0 } ,   ʋ ɵ ; 1 2                                                       if otherwise .
Then, Ʋ Ω is a graphical FM on Ξ and ( Ξ , Ʋ Ω , ) is a graphical FMS. Suppose { ʋ n } to be a sequence in Ξ , where ʋ n = 1 2 n for each n , and then for any fixed k , we deduce:
Ʋ Ω ( 1 2 n ,   1 2 k , t ) = t t + 1 2 n + k 1   as   n + .
Therefore, the sequence { 1 2 n } converges to 1 2 k for every fixed k .
Remark 2.
Suppose ( Ξ , Ʋ Ω , ) to be a graphical FMS in the above remark, and 1 2 is a limit of the sequence   { 1 2 n } , but for any k ,   k > 1 the authors have:
lim n + Ʋ Ω ( 1 2 n ,   1 2 k , t ) = 1 Ʋ Ω ( 1 2 ,   1 2 k , t ) .
That is, a graphical FM need not be continuous.
Lemma 2.
Suppose ( Ξ , Ʋ Ω , ) to be a graphical FMS with topology τ Ω induced by graphical FM. Then   τ Ω is a T 1 but not T 2 generally, i.e., Hausdorff.
Proof. 
The authors will demonstrate that for each ʋ     Ξ , the set { ʋ } that is singleton is a closed subset of Ξ , i.e., the set Ξ \ { ʋ } is open in Ξ . Assume ɵ     Ξ \ { ʋ } , then ɵ     ʋ , i.e., Ʋ Ω ( ʋ , ɵ , t ) > 0 . Now, let r = Ʋ Ω ( ʋ , ɵ , t ) 2 > 0 . Then the authors observe that ʋ   B Ω ( ɵ , r , t ) , otherwise Ʋ Ω ( ʋ , ɵ , t ) 2 = r > Ʋ Ω ( ʋ , ɵ , t ) , which is a contradiction. It shows that B Ω ( ɵ , r , t ) Ξ \ { ʋ } , and so Ξ \ { ʋ } is open. □
Definition 5.
Let ( Ξ , Ʋ Ω , ) be a graphical FMS and a sequence { ʋ n } in Ξ . Then { ʋ n } is known as a Cauchy sequence if, specified ε > 0 , there exists n 0 such that Ʋ Ω ( ʋ n , ʋ m , t ) > 1 ε for all n , m > n 0 . It is obvious that the sequence { ʋ n } is a Cauchy sequence if and only if lim n , m + + Ʋ Ω ( ʋ n , ʋ m , t ) = 1 .
Definition 6.
A graphical FMS ( Ξ , Ʋ Ω , ) is known as complete if each Cauchy sequence in Ξ converges in Ξ . Suppose Ω is a different graph from Ω such that V ( Ω ) = Ξ , if Ω - t e r m w i s e connected the sequence in Ξ converges in Ξ , then ( Ξ , Ʋ Ω , ) is known as Ω - c o m p l e t e .

3. Fixed-Point Theorems

In this section, the authors discuss the existence of fixed-point theorems under some circumstances.
Definition 7.
Suppose ( Ξ , Ʋ Ω , ) to be a graphical FMS, a mapping ϸ : Ξ Ξ and Ω to be a sub-graph of Ω such that Λ E ( Ω ) . Then, ϸ is known as ( Ω , Ω ) fuzzy graphical contraction ( ( Ω , Ω ) F G C ) on Ξ if satisfying the following conditions:
 (FC1) 
( ʋ , ɵ ) E ( Ω ) implies ( ϸ ʋ , ϸ ɵ ) E ( Ω ) at a time t , that is, ϸ preserves edges in E ( Ω ) .
 (FC2) 
There exists ϖ ( 0 , 1 ) such that:
Ʋ Ω ( ϸ ʋ , ϸ ɵ , ϖ t ) Ʋ Ω ( ʋ , ɵ , t ) ,   for   all   ʋ , ɵ Ξ   with   ( ʋ , ɵ ) E ( Ω )   at   time   t .
A sequence { ʋ n } with initial value ʋ 0 Ξ is known as the ϸ - Picard sequence if ʋ n = ϸ ʋ n 1 for all n . In order to continue the discussion, the authors suppose that Ω is a sub-graph of Ω such that Λ E ( Ω ) .
Theorem 1.
Suppose a Ω - complete graphical FMS   ( Ξ , Ʋ Ω , ) , and let ϸ : Ξ Ξ be a   ( Ω , Ω ) F G C . Assume that the below circumstances fulfill:
 (A) 
ϸ ʋ 0 [ ʋ 0 ] Ω l if there exists ʋ 0 Ξ for some l
 (B) 
If sequence { ʋ n } , that is, Ω - termwise connected ϸ - Picard converges in Ξ , then for { ʋ n } there exist a limit ω Ξ and n 0 such that ( ʋ n , ω ) E ( Ω ) or ( ω , ʋ n ) E ( Ω ) at a time t for all n n 0 .
Then, there exists ʋ Ξ such that a sequence { ʋ n } is a ϸ - Picard is Ω - termwise connected with initial value ʋ 0 Ξ and converges to both ʋ and ϸ ʋ .
Proof. 
Suppose ʋ 0     Ξ to be the extent that ϸ ʋ 0 [ ʋ 0 ] Ω l for some and the ϸ Picard sequence { ʋ n } starting from ʋ 0 . After that, there exists a path [ ɵ i ] i = 0 l such that ʋ 0   =   ɵ 0 ,   ϸ ʋ 0   =   ϸ ɵ l and ( ɵ i 1 , ɵ i ) E ( Ω ) at a time for i = 1 , 2 , , l . Since ϸ is a ( Ω , Ω ) F G C , by (FC1), ( ϸ ɵ i 1 , ϸ ɵ i ) E ( Ω ) at a time t for i = 1 , 2 , , l . Therefore, [ ϸ ɵ i ] i = 0 l is a path from ϸ ɵ 0 = ϸ ʋ 0 = ʋ 1 to ϸ ɵ l = ϸ 2 ʋ 0 = ʋ 2 of length l and so ʋ 2 [ ʋ 1 ] Ω l . Continuing this process, we obtain that [ ϸ n ɵ i ] i = 0 l is a path from ϸ n ɵ 0 = ϸ n ʋ 0 = ʋ n to ϸ n ɵ l = ϸ n ϸ ʋ 0 = ʋ n + 1 of length l and so, ʋ n + 1 [ ʋ n ] Ω l for all n . Thus { ʋ n } is a Ω - termwise connected sequence. Since ( ϸ n ɵ i 1 , ϸ n ɵ i ) E ( Ω ) at a time t for i = 1 , 2 , , l and n , by (FC2), the authors obtain:
ʋ Ω ( ϸ n ɵ i 1 , ϸ n ɵ i , ϖ t )   ʋ Ω ( ϸ n 1 ɵ i 1 , ϸ n 1 ɵ i , t )   ʋ Ω ( ɵ i 1 , ɵ i , t ϖ n ) .
Since Ω is a sub-graph of Ω and a Ω - termwise connected sequence that is { ʋ n } , for any n , the authors achieve by utilizing (d) of Definition 1, and (1), whereinthe authors have:
Ʋ Ω ( ʋ n , ʋ n + 1 , t ) = Ʋ Ω ( ϸ n ʋ 0 ,   ϸ n + 1 ʋ 0 , t ) = Ʋ Ω ( ϸ n ɵ 0 ,   ϸ n ɵ l , t ) i = 1 l [ Ʋ Ω ( ϸ n ɵ i 1 , ϸ n ɵ i , ϖ t ) ] i = 1 l [ Ʋ Ω ( ɵ i 1 , ɵ i , t ϖ n ) ] .
Therefore, the sequence { ʋ n } is Ω - termwise connected for n , m with m > n . We examined that
Ʋ Ω ( ʋ n , ʋ m , t ) i = n m 1 [ Ʋ Ω ( ʋ i , ʋ i + 1 , t ) ] i = 1 l [ Ʋ Ω ( ɵ i 1 , ɵ i , t ϖ n ) ] .
Since ϖ ( 0 , 1 ) , the authors obtain lim n , m + + Ʋ Ω ( ʋ n , ʋ m , t ) = 1 . Therefore, { ʋ n } is a Cauchy sequence in Ξ . Utilizing the fact that Ξ have Ω - completeness, the sequence { ʋ n } converges in Ξ and utilizing circumstance (B), there exist ʋ Ξ ,   n 0 such that ( ʋ n , ʋ ) E ( Ω ) or ( ʋ , ʋ n ) E ( Ω ) at a time t , for all n > n 0 and lim n + + Ʋ Ω ( ʋ n , ʋ , t ) = 1 . Therefore { ʋ n } converges to ʋ Ξ , At this instant, if ( ʋ n , ʋ ) E ( Ω ) at a time t , for all n > n 0 , applying (FC2), the authors deduce:
Ʋ Ω ( ʋ n + 1 , ϸ ʋ , t ) = Ʋ Ω ( ϸ ʋ n , ϸ ʋ , t ) Ʋ Ω ( ʋ n , ʋ , t ϖ )
for all n > n 0 . Since lim n + + Ʋ Ω ( ʋ n , ʋ , t ) = 1 , the authors deduce lim n + + Ʋ Ω ( ʋ n + 1 , ϸ ʋ , t ) = 1 . A similar result holds if ( ʋ , ʋ n ) E ( Ω ) at a time t for all n > n 0 , and this gives us the sequence { ʋ n } that converges to ʋ and ϸ ʋ .
Remark 3.
The above finding explains the convergence of a Picard sequence generated by a ( Ω , Ω ) F G C on Ω - complete graphical FMS. This theorem should not be regarded as an existence theorem, as seen in the below example in the context of Ω - complete graphical FMS.
Example 6.
Assume Ξ = { 1 2 n   { 0 } n } and a graph Ω = Ω with V ( Ω ) = Ξ and   E ( Ω ) = Λ   { ( ʋ , ɵ ) Ξ × Ξ ɵ     ʋ } at a time t . Suppose a b = a · b and describes a mapping Ʋ Ω Ξ × Ξ × ( 0 , + ) [ 0 , 1 ] by:
Ʋ Ω ( ʋ , ɵ , t ) = { 1                                                                   if   ʋ   =   ɵ ; t t + ʋ ɵ     if     ʋ , ɵ Ξ \ { 0 } ,   ʋ     ɵ ; 1 2                                                                 if otherwise .
Then, Ʋ Ω is a graphical FM on Ξ and ( Ξ , Ʋ Ω , ) is a Ω complete graphical FMS. Define a mapping ϸ Ξ Ξ by:
ϸ ʋ = { ʋ 6 ,       if   ʋ { 1 2 n n } 1 6 ,                                               if   ʋ = 0 .
Observe that ϸ is an F G C where ϖ = 1 2 and t = 1 . For each ʋ { 1 2 n n } , we have ( ʋ , ϸ ʋ ) E ( Ω ) at t , that is ϸ ʋ [ ʋ ] Ω 1 . Also, observe that all conditions of Theorem 1 and (B) hold, but ϸ has no fixed point in Ξ .
Definition 8.
Let ( Ξ , Ʋ Ω , ) be a graphical FMS and ϸ : Ξ Ξ be a map. Then, the five-tuple ( Ξ , Ʋ Ω , , Ω , ϸ )   is known to have property (2) if:
Whenever a Ω - termwise connected ϸ - Picard sequence { ʋ n } two limits ʋ and ɵ ,
if   ʋ Ξ   and   ɵ ϸ ( Ξ ) ,   then  
Theorem 2.
Suppose a Ω - complete graphical FMS   ( Ξ , Ʋ Ω , ) , and let ϸ : Ξ Ξ be a   ( Ω , Ω ) F G C . Assume that
 (A) 
ϸ ʋ 0 [ ʋ 0 ] Ω l for there exist ʋ 0 Ξ for some l ;
 (B) 
If sequence { ʋ n } that is Ω - termwise connected ϸ - Picard converges in Ξ , then for { ʋ n } there exists a limit ω Ξ and n 0 such that ( ʋ n , ω ) E ( Ω ) or ( ω , ʋ n ) E ( Ω ) at a time t for all n n 0 .
Then, there exists ʋ Ξ such that a sequence { ʋ n } that is ϸ - Picard is Ω - termwise connected with initial value ʋ 0 Ξ and converges to both ʋ and ϸ ʋ . Furthermore, if five-tuple ( Ξ , Ʋ Ω , , Ω , ϸ ) contains the property (2), then ϸ has a fixed point in Ξ .
Proof. 
Applying Theorem 1, a sequence { ʋ n } converges to ʋ and ϸ ʋ . Since ʋ Ξ and ϸ ʋ ϸ ( Ξ ) , consequently by applying (2) the authors must have ʋ = ϸ ʋ . □
The authors symbolize the set of all fixed points of ϸ by Fix ( ϸ ) , and the perception that the authors utilize is Ξ ϸ = { ʋ Ξ ( ʋ , ϸ ʋ ) E ( Ω )   at   time   t } .
Theorem 3.
Suppose ( Ξ , Ʋ Ω , ) to be a Ω - complete graphical FMS, and let ϸ : Ξ Ξ be a   ( Ω , Ω ) F G C . Assume that all conditions of Theorem 2 are satisfied; then,   ϸ has a fixed point. Furthermore, if Ξ ϸ is weakly connected (as a sub-graph of   Ω ), then the fixed point of ϸ is unique.
Proof. 
It is easy to observe that the existence of a fixed point follows from Theorem 2. Now, assume that Ξ ϸ is weakly connected. Let ʋ , ɵ Fix ( ϸ ) be two distinct fixed points of ϸ . Therefore, E ( Ω ) includes all the loops, that is, Fix ( ϸ ) Ξ ϸ and so ʋ , ɵ Ξ ϸ . The authors must get ( ʋ P ɵ ) Ω or ( ɵ P ʋ ) Ω because Ξ ϸ is a weakly connected graph. Assume that ( ʋ P ɵ ) Ω such that there exist a sequence { ʋ i } i = 0 l ,   ʋ 0 = ʋ ,   ʋ l = ɵ and ( ʋ i , ʋ i + 1 ) E ( Ω ) at a time t and for i = 0 , 1 , , l 1 . Therefore ϸ is a ( Ω , Ω ) fuzzy graphical contraction, and by consecutively utilizing (FC1), the authors deduce ( ϸ n ʋ i , ϸ n ʋ i + 1 ) E ( Ω ) at a time and for i = 0 , 1 , , l 1 , and for all n . Therefore, by (FC2) the authors have:
Ʋ Ω ( ϸ n ʋ i , ϸ n ʋ i + 1 , ϖ t ) Ʋ Ω ( ϸ n 1 ʋ i , ϸ n 1 ʋ i + 1 , t ) Ʋ Ω ( ʋ i , ʋ i + 1 , t ϖ n ) ,
for i = 0 , 1 , , l 1 and for all n . Now, by (d) of Definition 1, the authors get
Ʋ Ω ( ϸ n ʋ ,   ϸ n ɵ , ϖ t ) i = 0 l 1 [ Ʋ Ω ( ϸ n ʋ i , ϸ n ʋ i + 1 , ϖ t ) ] i = 0 l 1 [ Ʋ Ω ( ʋ i , ʋ i + 1 , t ϖ n ) ] .
Since ʋ , ɵ Fix ( ϸ ) , the authors have ϸ n ʋ   =   ʋ ,   ϸ n ɵ   =   ɵ ; consequently, letting n + + , as a result of the preceding inequality, the authors have Ʋ Ω ( ʋ ,   ɵ , t ) = 1 , which implies that ʋ =   ɵ . Hence, the fixed point of ϸ is unique. □

4. Applications

In this section, the authors utilize the fixed-point technique to find a solution of integral equations and nonlinear fractional differential equations.
First, the authors utilize a fixed-point technique to find a solution of integral equations on Ξ . The authors examine that the existence of a lower or upper solution to an integral equation implies the solution of the integral equation under certain conditions.
Let Ξ = C ( [ 0 , 1 ] , ) be the set of all real valued continuous functions on [ 0 , 1 ] . Let:
B = { ʋ Ξ 0 < sup u [ 0 , 1 ] ʋ ( u )   and   ʋ ( u ) 1 ,   u [ 0 , 1 ] }
and describe the graph Ω ,   Ω by Ω = Ω ,   V ( Ω ) = Ξ and:
E ( Ω ) = Λ   { ( ʋ , ɵ ) Ξ × Ξ ʋ , ɵ B ,   ʋ ( u ) ɵ ( u ) ,   for   all   u [ 0 , 1 ] } .
Now consider a graphical FM defined by Ʋ Ω Ξ × Ξ × ( 0 , + ) [ 0 , 1 ] as:
Ʋ Ω ( ʋ ( u ) , ɵ ( u ) , t ) = { 1                                                                                   if   ʋ = ɵ ; sup u [ 0 , 1 ] t t + ʋ ( u ) ɵ ( u )     if     ʋ , ɵ B ,   ʋ ɵ ; 1 2                                                                   if otherwise .
Then ( Ξ , Ʋ Ω , ) is a Ω - complete graphical FMS with a b = a · b . The authors suppose the integral equation as:
    ʋ ( u ) = 0 1 S ( u , c ) f ( c , ʋ ( c ) ) d c ,
where f [ 0 , 1 ] ×   and   S [ 0 , 1 ] × [ 0 , 1 ] [ 0 , + + ) are continuous functions. The function α C ( [ 0 , 1 ] , ) is known as a lower solution of Equation (3) if:
α ( u ) 0 1 S ( u , c ) f ( c , α ( c ) ) d c ,   u [ 0 , 1 ] .
It is obvious that reverse inequality is met by an upper solution of ( 3 ) . Now, the authors examine the existence of a lower solution of ( 3 ) that reveals the existence of a solution of ( 3 ) . The authors assume that ϸ Ξ Ξ is an operator and is described by
  ϸ ( ʋ ) ( u ) = 0 1 S ( u , c ) f ( c , ʋ ( c ) ) d c ,    
which provides the necessary conditions for the existence of a fixed point of ( 4 ) in Ξ . Obviously, such a fixed point is a solution of the integral Equation ( 3 ) .
Theorem 4.
Assume that the requirements listed below are met:
  • f ( c , · ) is increasing on ( 0 , 1 ] , for each c [ 0 , 1 ] . Furthermore S ( u , c ) f ( c , 1 ) 1 ;
  • t h e r e   e x i s t   ϖ ( 0 , 1 ) such that for ʋ , ɵ Ξ   w i t h   ( ʋ , ɵ ) E ( Ω )   a t   t , for each c , l [ 0 , 1 ] , the authors have:
f ( c , ʋ ( c ) ) f ( l , ɵ ( l ) ) ʋ ( c ) ɵ ( l )
and
0 1 0 1 S ( u , c ) S ( u , l ) d c d l ϖ ,   for   all   u [ 0 , 1 ] .
Then the existence of a lower solution of ( 3 ) in B demonstrates the existence of the solution of ( 3 )   i n   Ξ .
Proof. 
Observe that ϸ is well defined. Also, by utilizing (ii), the authors get:
ϖ t ϖ t + ϸ ( ʋ ) ( u ) ϸ ( ɵ ) ( u ) = ϖ t ϖ t + 0 1 0 1 S ( u , c ) S ( u , l ) f ( c , ʋ ( c ) ) f ( l , ɵ ( l ) ) d c d l ϖ t ϖ t + 0 1 0 1 S ( u , c ) S ( u , l ) ʋ ( c ) ɵ ( l ) d c d l ϖ t ϖ t + sup u [ 0 , 1 ] [ ʋ ( c ) ɵ ( l ) ] 0 1 0 1 S ( u , c ) S ( u , l ) d c d l ϖ t ϖ t + ϖ sup u [ 0 , 1 ] [ ʋ ( u ) ɵ ( u ) ] t t + sup u [ 0 , 1 ] [ ʋ ( u ) ɵ ( u ) ] Ʋ Ω ( ʋ , ɵ , t ) .
Further, for ʋ , ɵ Ξ   with   ʋ , ɵ E ( Ω )   at   time   t , the authors have ʋ , ɵ B   and   ʋ ( u ) ɵ ( u ) for all u [ 0 , 1 ] and by utilizing (i), the authors deduce sup u [ 0 , 1 ] ϸ ( ʋ ) ( u ) > 0 and:
ϸ ( ʋ ) ( u ) = 0 1 S ( u , c ) f ( c , ʋ ( c ) ) d c 0 1 S ( u , c ) f ( c , 1 ) d c 1
and
ϸ ( ʋ ) ( u ) = 0 1 S ( u , c ) f ( c , ʋ ( c ) ) d c 0 1 S ( u , c ) f ( c , f ( c , ɵ ( c ) ) ) d c = ϸ ( ɵ ) ( u ) .
Therefore, the existence of a lower solution of ( 3 ) , called α B , implies that Theorem 2′s condition (A) is fulfilled, which implies ϸ ( α ) [ α ] Ω 1 . Also, observe that condition (B) of Theorem 2 satisfies the equation and a five-tuple ( Ξ , Ʋ Ω , , Ω , ϸ ) has the condition (2). All the circumstances of Theorem 2 are fulfilled and hence the operator ϸ has a fixed point, which is a solution of the integral Equation ( 3 ) in Ξ .
In the case of an upper solution of an integral Equation (3), one can construct using comparable reasoning; in this scenario, one can assume the below set:
E ( Ω ) = { ( ʋ , ɵ ) Ξ × Ξ ʋ , ɵ B ,   ʋ ( u ) ɵ ( u )   for   all   u [ 0 , 1 ] }
continuing as above. Then, in order to avoid repetition, the authors leave out the details. □
Now the authors aim to apply Theorem 2 to obtain the existence of a solution to a nonlinear fractional differential equation:
    D 0 + p Þ ( t ) = g ( t , Þ ( t ) ) ,     0 < t < 1
with the boundary conditions:
Þ ( 0 ) + Þ ( 0 ) = 0 ,   Þ ( 1 ) + Þ ( 1 ) = 0 ,
where 1 < p 2 is a fractional order, D 0 + p is the Caputo fractional derivative, and g   : [ 0 , 1 ] × [ 0 , + ) [ 0 , + )   is a continuous function. Let Ξ = C ( [ 0 , 1 ] ,   ( 0 , 1 ] ) denote the space of all continuous functions defined on [ 0 ,   1 ] equipped with the graph Ω ( V , E ) described by V ( Ω ) = Ξ and E ( Ω ) = Λ   { ( Þ , δ ) Ξ × Ξ Þ ( t ) , δ ( t ) Ξ ,   Þ ( t ) δ ( t ) ,   for   all   t ( 0 , 1 ] } at a time t . Let a b = min { a , b } for all a , b   [ 0 , 1 ] and define a graphical FMS as follows:
ʋ Ω ( Þ ( t ) , δ ( t ) , ϖ ) = { 1       if   Þ ( t ) = δ ( t ) , α ϖ α ϖ + γ   max { sup t ϵ [ 0 , 1 ]   Þ ( t ) , sup t ϵ [ 0 , 1 ]   δ ( t ) } ,   otherwise .
Observe that Þ Ξ solves (5) whenever Þ Ξ solves the following integral equation:
Þ ( t ) = 1 Γ ( p ) 0 1 ( 1 s ) p 1 ( 1 t ) g ( s , Þ ( s ) ) d s + 1 Γ ( p 1 ) 0 1 ( 1 s ) p 2 ( 1 t ) g ( s , Þ ( s ) ) d s + 1 Γ ( p ) 0 t ( t s ) p 1 g ( s , Þ ( s ) ) d s .
Theorem 5.
The integral operator ξ : Ξ Ξ   is given by
ξ Þ ( t ) = 1 Γ ( p ) 0 1 ( 1 s ) p 1 ( 1 t ) g ( s , Þ ( s ) ) d s + 1 Γ ( p 1 ) 0 1 ( 1 s ) p 2 ( 1 t ) g ( s , Þ ( s ) ) d s + 1 Γ ( p ) 0 t ( t s ) p 1 g ( s , Þ ( s ) ) d s ,
where g : [ 0 , 1 ] × [ 0 , + ) [ 0 , + ) fulfilling the following criteria:
max { sup s [ 0 , 1 ]     g   ( s , Þ ( s ) ) ,   sup s [ 0 , 1 ]     g ( s , δ ( s ) ) }   1 4 max {   sup s [ 0 , 1 ]     Þ ( s ) ,   sup s [ 0 , 1 ]     δ ( s ) } , for   all   Þ , δ   Ξ ;
Also, suppose that:
sup t ( 0 , 1 )   1 4   [ 1 t Γ ( p + 1 ) + 1 t Γ ( p ) + t p Γ ( p + 1 ) ] ā < 1 .
Then nonlinear fractional differential equation has a unique solution in   Ξ .
Proof. 
max { ξ Þ ( t ) ,   ξ δ ( t ) }   = 1 t Γ ( p ) 0 1 ( 1 s ) p 1 max { sup s [ 0 , 1 ] g ( s , Þ ( s ) ) , sup s [ 0 , 1 ]   g ( s , δ ( s ) ) } d s +   1 t Γ ( p 1 ) 0 1 ( 1 s ) p 2   max { sup s [ 0 , 1 ] g ( s , Þ ( s ) ) , sup s [ 0 , 1 ]   g ( s , δ ( s ) ) } d s +   1 Γ ( p ) 0 t ( t s ) p 1 max { sup s [ 0 , 1 ] g ( s , Þ ( s ) ) , sup s [ 0 , 1 ]   g ( s , δ ( s ) ) } 1 t Γ ( p ) 0 1 ( 1 s ) p 1 max { sup s [ 0 , 1 ]   Þ ( s ) , sup s [ 0 , 1 ]   δ ( s ) } 4 d s + 1 t Γ ( p 1 ) 0 1 ( 1 s ) p 2 max { sup s [ 0 , 1 ] Þ ( s ) , sup s [ 0 , 1 ] δ ( s ) } 4 d s + 1 Γ ( p ) 0 t ( t s ) p 1 max { sup s [ 0 , 1 ] Þ ( s ) , sup s [ 0 , 1 ] δ ( s ) } 4 d s 1 4 max { sup s [ 0 , 1 ]   Þ ( s ) , sup s [ 0 , 1 ]   δ ( s ) }   ( 1 t Γ ( p ) 0 1 ( 1 s ) p 1 d s + 1 t Γ ( p 1 ) 0 1 ( 1 s ) p 2 d s + 1 Γ ( p ) 0 t ( t s ) p 1 d s ) 1 4 max { sup s [ 0 , 1 ]   Þ ( s ) , sup s [ 0 , 1 ]   δ ( s ) }   sup t [ 0 , 1 ] [ 1 t Γ ( p + 1 ) + 1 t Γ ( p ) + t p Γ ( p + 1 ) ] =   ā   max { sup s [ 0 , 1 ]   Þ ( s ) , sup s [ 0 , 1 ]   δ ( s ) }   ,
where:
ā =   sup t ϵ ( 0 , 1 ) 1 4   [ 1 t Γ ( p + 1 ) + 1 t Γ ( p ) + t p Γ ( p + 1 ) ] .
Therefore, the above equation:
max { sup t [ 0 , 1 ]   ξ Þ ( t ) , sup t [ 0 , 1 ]   ξ δ ( t ) } ā max { s u p t [ 0 , 1 ]   Þ ( t ) ,   s u p t [ 0 , 1 ]   δ ( t ) }   α ϖ + γ ā max { sup t [ 0 , 1 ]   ξ Þ ( t ) , sup t [ 0 , 1 ]   ξ δ ( t ) }   α ϖ + γ max { sup t [ 0 , 1 ]   Þ ( t ) ,   sup t [ 0 , 1 ]   δ ( t ) }   α ( ā ϖ ) α ( ā ϖ ) + γ max { sup t [ 0 , 1 ]   ξ Þ ( t ) , sup t [ 0 , 1 ]   ξ δ ( t ) } α ϖ α ϖ + γ max { sup t [ 0 , 1 ]   Þ ( t ) ,   sup t [ 0 , 1 ]   δ ( t ) } Ʋ Ω ( ξ Þ , ξ δ , ā ϖ ) Ʋ Ω ( Þ , δ , ϖ ) ,
for the variables α , γ > 0 . Observe that the conditions of the Theorem 2 are fulfilled. As a result, ξ has a fixed point; accordingly, the specified nonlinear fractional differential Equation (5) has a unique solution. □

5. Open Problem

(a)
In underlying space, extend the triangle inequality by using control functions and quadrilateral inequality, and discuss topological structure along with fixed-point results.
(b)
Extend underlying space via intuitionistic fuzzy sets, picture fuzzy sets, and neutrosophic sets and discuss fixed-point results along with topological properties.

6. Conclusions

Nowadays, graph theory plays an important role in science to understand and solve different problems. Herein, the authors established a novel approach of graphical FMS with illustrative examples. The authors discussed criteria for the existence of a unique solution for contraction mapping via integral equations and nonlinear fractional differential equations. This work can be easily extendable in different fuzzy metric structures.

Author Contributions

Conceptualization, N.S. and U.I.; methodology, N.S.; software, U.I.; validation, N.S., M.-F.B. and L.G.; formal analysis, L.G.; investigation, M.-F.B.; resources, N.S.; data curation, U.I.; writing—original draft preparation, N.S., U.I.; writing—review and editing, N.S., U.I., L.G.; visualization, M.-F.B., L.G.; supervision, N.S.; project administration, N.S., U.I.; funding acquisition, M.-F.B., L.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the Babeș-Bolyai University of Cluj-Napoca for financial support.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Balaban, A.T. Applications of graph theory in chemistry. J. Chem. Inf. Comput. Sci. 1985, 25, 334–343. [Google Scholar] [CrossRef]
  2. Ratkiewicz, A.; Truong, T.N. Application of chemical graph theory for automated mechanism generation. J. Chem. Inf. Comput. Sci. 2003, 43, 36–44. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Majeed, A.; Rauf, I. Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks. Inventions 2020, 5, 10. [Google Scholar]
  4. Vecchio, F.; Miraglia, F.; Rossini, P.M. Connectome: Graph theory application in functional brain network architecture. Clin. Neurophysiol. Pract. 2017, 2, 206–213. [Google Scholar] [CrossRef] [PubMed]
  5. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  6. Shukla, S.; Radenovic, S.; Vetro, C. Graphical metric space: A generalized setting in fixed point theory. Rev. Real Acad. Cienc. Exactas Físicas Naturales. Ser. A Matemáticas 2016, 111, 641–655. [Google Scholar] [CrossRef]
  7. Chen, L.; Yang, N.; Zhao, Y. Fixed point theorems for set-valued G-contractions in a graphical convex metric space with applications. J. Fixed Point Theory Appl. 2020, 22, 88. [Google Scholar] [CrossRef]
  8. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  9. Kramosil, I.; Michalek, J. Fuzzy metric and statistical metric spaces. Kybernetika 1975, 11, 336–344. [Google Scholar]
  10. George, A.; Veeramani, P. On some results in fuzzy metric spaces. Fuzzy Sets Syst. 1994, 64, 395–399. [Google Scholar] [CrossRef] [Green Version]
  11. George, A.; Veeramani, P. On some results of analysis for fuzzy metric spaces. Fuzzy Sets Syst. 1997, 90, 365–368. [Google Scholar] [CrossRef]
  12. Furqan, S.; Işık, H.; Saleem, N. Fuzzy Triple Controlled Metric Spaces and Related Fixed Point Results. J. Funct. Spaces 2021, 2021, 9936992. [Google Scholar] [CrossRef]
  13. Moussaoui, A.; Saleem, N.; Melliani, S.; Zhou, M. Fixed Point Results for New Types of Fuzzy Contractions via Admissible Functions and FZ-Simulation Functions. Axioms 2022, 11, 87. [Google Scholar] [CrossRef]
  14. Mecheraoui, R.; Mitrović, D.Z.; Parvaneh, V.; Aydi, H.; Saleem, N. On Some Fixed Point Results in Fuzzy Metric Spaces. J. Math. 2021, 2021, 9196642. [Google Scholar] [CrossRef]
  15. Mohammadi, B.; Hussain, A.; Parvaneh, V.; Saleem, N.; Shahkoohi, R.J. Fixed Point Results for Generalized Fuzzy Contractive Mappings in Fuzzy Metric Spaces with Application in Integral Equations. J. Math. 2021, 2021, 9931066. [Google Scholar] [CrossRef]
  16. Zhou, M.; Saleem, N.; Liu, X.; Fulga, A.; Roldán López de Hierro, A.F. A New Approach to Proinov-Type Fixed-Point Results in Non-Archimedean Fuzzy Metric Spaces. Mathematics 2021, 9, 3001. [Google Scholar] [CrossRef]
  17. Rakić, D.; Mukheimer, A.; Došenović, T.; Mitrović, Z.D.; Radenović, S. On some new fixed point results in fuzzy b-metric spaces. J. Inequalities Appl. 2020, 1, 99. [Google Scholar] [CrossRef] [Green Version]
  18. Rakić, D.; Došenović, T.; Mitrović, Z.D.; De la Sen, M.; Radenović, S. Some fixed point theorems of Ćirić type in fuzzy metric spaces. Mathematics 2020, 8, 297. [Google Scholar] [CrossRef] [Green Version]
  19. Debnath, P.; Konwar, N.; Radenovic, S. Metric Fixed Point Theory: Applications in Science, Engineering and Behavioural Sciences; Springer: Berlin/Heidelberg, Germany, 2021. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Saleem, N.; Ishtiaq, U.; Guran, L.; Bota, M.-F. On Graphical Fuzzy Metric Spaces with Application to Fractional Differential Equations. Fractal Fract. 2022, 6, 238. https://doi.org/10.3390/fractalfract6050238

AMA Style

Saleem N, Ishtiaq U, Guran L, Bota M-F. On Graphical Fuzzy Metric Spaces with Application to Fractional Differential Equations. Fractal and Fractional. 2022; 6(5):238. https://doi.org/10.3390/fractalfract6050238

Chicago/Turabian Style

Saleem, Naeem, Umar Ishtiaq, Liliana Guran, and Monica-Felicia Bota. 2022. "On Graphical Fuzzy Metric Spaces with Application to Fractional Differential Equations" Fractal and Fractional 6, no. 5: 238. https://doi.org/10.3390/fractalfract6050238

APA Style

Saleem, N., Ishtiaq, U., Guran, L., & Bota, M. -F. (2022). On Graphical Fuzzy Metric Spaces with Application to Fractional Differential Equations. Fractal and Fractional, 6(5), 238. https://doi.org/10.3390/fractalfract6050238

Article Metrics

Back to TopTop