Next Article in Journal
A Single-Stage Manufacturing Model with Imperfect Items, Inspections, Rework, and Planned Backorders
Next Article in Special Issue
On Bilateral Contractions
Previous Article in Journal
Large Contractions on Quasi-Metric Spaces with an Application to Nonlinear Fractional Differential Equations
Previous Article in Special Issue
Best Proximity Point Theorems for Two Weak Cyclic Contractions on Metric-Like Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On (G, G′)-Prešić–Ćirić Operators in Graphical Metric Spaces

1
Department of Applied Mathematics, Shri Vaishnav Institute of Technology & Science, Gram Baroli, Sanwer Road, Indore (M.P.) 453331, India
2
Department of Mathematics and General Sciences, Prince Sultan University, Riyadh 11586, Saudi Arabia
3
Institut Supérieur d’Informatique et des Techniques de Communication, Université de Sousse, Hammam Sousse 4000, Tunisia
4
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
*
Authors to whom correspondence should be addressed.
Mathematics 2019, 7(5), 445; https://doi.org/10.3390/math7050445
Submission received: 15 April 2019 / Revised: 13 May 2019 / Accepted: 13 May 2019 / Published: 18 May 2019

Abstract

:
The purpose of this paper is to introduce a new type of operators in graphical metric spaces and to prove some fixed point results for these operators. Several known results are generalized and extended in this new setting of graphical metric spaces. The results are illustrated and justified with examples.

1. Introduction

Recently, Shukla et al. [1] generalized the notion of metric spaces for sets equipped with a graphical structure and presented the notion of graphical metric spaces, which are equipped with a weaker type of triangular inequality satisfied by a graphical metric for only those points which are situated on a path in a graph associated with the space. By introducing a new type of mappings associated with the graphical metric space, Shukla et al. [1] generalized the famous Banach contraction principle (BCP) and extended several known results of Ran and Reurings [2], Kirk et al. [3], Edelstein [4] and Jachymski [5].
On the other hand, Prešić [6,7] generalized the BCP in product spaces.
Theorem 1.
Let ( X , d ) be a complete metric space and T : X k X ( k > 0 an integer). Assume there are nonnegative constants q 1 , q 2 , , q k with q 1 + q 2 + + q k < 1 such that
d ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) i = 1 k q i d ( ξ i , ξ i + 1 )
for all ξ 1 , ξ 2 , , ξ k + 1 X . Then, there is a unique point x X such that T ( x , x , , x ) = x . Furthermore, for ξ 1 , ξ 2 , , ξ k X with ξ n + k = T ( ξ n , ξ n + 1 , , ξ n + k 1 ) ( n N ) , the sequence { ξ n } converges and lim n ξ n = T lim n ξ n , lim n ξ n , , lim n ξ n .
The map satisfying Label (1) is said to be a Prešić operator.
Ćirić and Prešić [8] considered a weaker contractive condition than the condition (1).
Theorem 2.
Let ( X , d ) be a complete metric space and T : X k X ( k > 0 an integer). Assume that there is λ [ 0 , 1 ) such that
d ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) λ max { d ( ξ i , ξ i + 1 ) : 1 i k } ,
for all ξ 1 , ξ 2 , , ξ k + 1 X . Then, there is a point ξ in X so that T ( ξ , ξ , , ξ ) = ξ . Moreover, for arbitrary ξ 1 , ξ 2 , , ξ k X and for n N , ξ n + k = T ( ξ n , ξ n + 1 , , ξ n + k 1 ) , the sequence { ξ n } converges and lim n ξ n = T lim n ξ n , lim n ξ n , , lim n ξ n . If in addition, we have on the diagonal X k , d ( T ( ρ , ρ , , ρ ) , T ( v , v , , v ) ) < d ( ρ , v ) for ρ , v X , with ρ v , then ξ is the unique element so that ξ = T ( ξ , ξ , , ξ ) .
Prešić type operators have several applications to solve problems in applied mathematics—see, for example, [6,7,9,10,11,12,13,14]. Recently, many authors worked on the result of Prešić in various directions—see [8,15,16,17,18,19,20,21,22,23]. Ran and Reurings [2] and Nieto and Lopez [24,25] gave fixed point results in metric spaces via a partial order. These results were generalized by Malhotra et al. [17] (see also [15,26]) and Shukla et al. [22] in product spaces. The cyclic operator was considered by Kirk et al. [3]. Shukla and Abbas [23] extended the result of Kirk et al. [3] by defining the class of cyclic-Prešić operators. An interesting generalization of Banach’s result in the spaces endowed with graphs was given by Jachymski [5] which unifies the results of Ran and Reurings [2], Nieto and Lopez [24,25] and Edelstein [4]. Recently, Shukla and Shahzad [27] and Shahzad and Shukla [10] extended these results for single-valued and set-valued mappings in product spaces endowed with a graph—see also [28,29,30,31,32].
Here, we initiate the notion of ( G , G ) -Prešić–Ćirić operators in graphical metric spaces and prove some related fixed point theorems. The results of this paper generalize and unify the theorems of Prešić [8], Prešić and Ćirić [6,7], Luong and Thuan [15], Ran and Reurings [2], Nieto and Lopez [24,25], Kirk et al. [3], Shukla and Abbas [23], Shukla and Shahzad [27] and Shukla et al. [1] in graphical metric spaces. We also give examples illustrating and justifying the presented results.

2. Preliminaries

Given a nonempty set X, we define: = { ( η , η ) : η X } . Consider a directed graph G where V ( G ) (resp. E ( G ) ) is the set of vertices (resp. edges) such that V ( G ) = X , E ( G ) and G has no parallel edges, hence X is endowed with G = ( V ( G ) , E ( G ) ) . The conversion of the graph G is G 1 . In addition, V ( G 1 ) = V ( G ) and E ( G 1 ) = { ( x , y ) X × X : ( y , x ) E ( G ) } . G ˜ is denoted as the undirected graph. Consider V ( G ˜ ) = V ( G ) and E ( G ˜ ) = E ( G ) E ( G 1 ) .
If ξ , η V ( G ) , then a path in G from ξ to η of length l N is { ξ i } i = 0 l of l + 1 vertices so that ξ 0 = ξ , ξ l = η and ( ξ i 1 , ξ i ) E ( G ) for i = 1 , 2 , , l . A graph G is called connected if, there is a path between any two vertices. The graph G is weakly connected if, considering all of its edges as undirected, there is a path from each vertex to each other vertex. G is weakly connected if G ˜ is connected.
Consider: ( ξ P η ) G iff there is a directed path from ξ to η in G . μ ( ξ P η ) G if μ is contained in some directed path from ξ to η in G . A sequence { ξ n } in X is called G-termwise connected if ( ξ n P ξ n + 1 ) G for each n N .
From now, we suppose that the graphs are directed where the sets of vertices and edges are nonempty.
Definition 1
(Shukla et al. [1]). Let X be a nonempty set endowed with a graph G and d G : X × X R be a function such that for all ξ , η , μ X ,
1.
d G ( ξ , η ) 0 ;
2.
d G ( ξ , η ) = 0 iff ξ = η ;
3.
d G ( ξ , η ) = d G ( η , ξ ) ;
4.
( ξ P η ) G , μ ( ξ P η ) G implies d G ( ξ , η ) d G ( ξ , μ ) + d G ( μ , η ) .
Here, d G is called a graphical metric on X.
There are several interesting examples and properties of graphical metric spaces—see [1].
Definition 2
(Shukla et al. [1]). Let { ξ n } be a sequence in a graphical metric space ( X , d G ) . Then,
1.
{ ξ n } converges to x X if, given ε > 0 , there is n 0 N so that d G ( ξ n , x ) < ε for each n > n 0 . That is, lim n d G ( ξ n , x ) = 0 .
2.
{ ξ n } is Cauchy sequence if, for ε > 0 , there is n 0 N so that d G ( ξ n , ξ m ) < ε for all n , m > n 0 . That is, lim n , m d G ( ξ n , ξ m ) = 0 .
3.
( X , d G ) is complete if every Cauchy sequence in X is convergent in X . Let G be another graph with V ( G ) = X , then ( X , d G ) is G -complete if each G -termwise connected Cauchy sequence in X is convergent in X .
Let X be a nonempty set and T : X k X ( k > 0 an integer). An element ξ X is a fixed point of T if T ( ξ , ξ , , ξ ) = ξ . Denote by Fix ( T ) the set of all fixed points of T. Let ξ 1 , ξ 2 , , ξ k X . { ξ n } given as ξ n + k = T ( ξ n , ξ n + 1 , , ξ n + k 1 ) is called a Prešić–Picard sequence (in short, a P P -sequence) with initial values ξ 1 , ξ 2 , , ξ k , (see [27]).

3. Main Results

We first introduce a new class of operators in graphical metric spaces.
Suppose X is endowed with the graph G and P T k ( G ) is the set of all paths { ξ i } i = 1 k of k vertices so that ( ξ k , T ( ξ 1 , ξ 2 , , ξ k ) ) E ( G ) , that is,
P T k ( G ) = { ξ i } i = 1 k : ( ξ i , ξ i + 1 ) , ( ξ k , T ( ξ 1 , ξ 2 , , ξ k ) ) E ( G ) , i = 1 , 2 , , k 1 .
We now define ( G , G ) -Prešić–Ćirić operators on a metric space endowed with a graph.
Definition 3.
Let ( X , d G ) be a graphical metric space and T : X k X ( k > 0 an integer). Let G be a subgraph of G such that E ( G ) . Suppose that there is λ [ 0 , 1 ) such that, for every path { ξ i } i = 1 k + 1 in G , the following holds:
d G ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) λ max 1 i 1 { d G ( ξ i , ξ i + 1 ) } .
Then, T is a ( G , G ) -Prešić–Ćirić operator.
We suppose that G is a subgraph of G so that E ( G ) .
Definition 4.
Let ( X , d G ) be a graphical metric space and T : X k X ( k > 0 an integer). Then, the mapping T is called a d G -edge preserving in G if, for every path { ξ i } i = 1 k + 1 in G such that d G ( T ( ξ 1 , , ξ k ) , T ( ξ 2 , , ξ k + 1 ) ) < max 1 i k { d G ( ξ i , ξ i + 1 ) } , we have
( T ( ξ 1 , , ξ k ) , T ( ξ 2 , , ξ k + 1 ) ) E ( G ) .
Lemma 1.
Let ( X , d G ) be a graphical metric space, k a positive integer and T : X k X be a ( G , G ) -Prešić–Ćirić operator. If { ξ i } i = 1 k P T k ( G ) and T is d G -edge preserving in G , then the P P -sequence { ξ n } with initial values ξ 1 , ξ 2 , , ξ k is a G -termwise connected sequence.
Proof. 
Suppose that { ξ i } i = 1 k P T k ( G ) , then by definition of P T k ( G ) , we have
( ξ i , ξ i + 1 ) , ( ξ k , T ( ξ 1 , ξ 2 , , ξ k ) ) E ( G ) for i = 1 , 2 , , k 1 .
Now, consider the P P -sequence { ξ n } with initial values ξ 1 , ξ 2 , , ξ k . Then, we know that the value of ξ k + 1 is given by ξ k + 1 = T ( ξ 1 , ξ 2 , , ξ k ) , and so, by Label (3), we get ( ξ k , ξ k + 1 ) E ( G ) . Therefore, { ξ i } i = 1 k + 1 is a path in G . Since T is a ( G , G ) -Prešić–Ćirić operator, we obtain by (2) that
d G ( T ( ξ 1 , , ξ k ) , T ( ξ 2 , , ξ k + 1 ) ) λ max 1 i k { d G ( ξ i , ξ i + 1 ) } < max 1 i k { d G ( ξ i , ξ i + 1 ) } .
As T is d G -edge preserving in G , we obtain
( ξ k + 1 , ξ k + 2 ) = ( T ( ξ 1 , , ξ k ) , T ( ξ 2 , , ξ k + 1 ) ) E ( G ) .
The above inclusion shows that { ξ i } i = 2 k + 2 is a path in G , hence, again by (2), we obtain
d G ( T ( ξ 2 , , ξ k + 1 ) , T ( ξ 3 , , ξ k + 2 ) ) λ max 2 i k + 1 { d G ( ξ i , ξ i + 1 ) } < max 2 i k + 1 { d G ( ξ i , ξ i + 1 ) } .
As T is d G -edge preserving in G , we obtain
( ξ k + 2 , ξ k + 3 ) = ( T ( ξ 2 , , ξ k + 1 ) , T ( ξ 3 , , ξ k + 2 ) ) E ( G ) .
By repeating the same arguments, the P P -sequence { ξ n } with initial values ξ 1 , ξ 2 , , ξ k is a G -termwise connected sequence. □
We now prove the following theorem which ensures the convergence of a P P -sequence generated by ( G , G ) -Prešić–Ćirić operator in a graphical metric space.
Theorem 3.
Let ( X , d G ) be a G -complete graphical metric space, k a positive integer and T : X k X be a ( G , G ) -Prešić–Ćirić operator. Suppose that:
(I) 
P T k ( G ) ;
(II) 
T is d G -edge preserving in G ;
(III) 
if a G -termwise connected P P -sequence { ξ n } converges in X , then there exist μ X limit of { ξ n } and n 0 N such that ( ξ n , μ ) E ( G ) or ( μ , ξ n ) E ( G ) for each n > n 0 .
Then, for every path { ξ i } i = 1 k in P T k ( G ) , the P P -sequence with initial values ξ 1 , ξ 2 , , ξ k is G -termwise connected and converges to both ρ and T ( ρ , , ρ ) for some ρ X .
Proof. 
Since P T k ( G ) , suppose that { ξ i } i = 1 k P T k ( G ) , then by Lemma 1 the P P -sequence { ξ n } with initial values ξ 1 , ξ 2 , , ξ k is a G -termwise connected sequence, i.e., ( ξ i , ξ i + 1 ) E ( G ) for all i N .
Let δ n = d G ( ξ n , ξ n + 1 ) , n N and
ρ = max δ 1 λ 1 / k , δ 2 λ 2 / k , , δ k λ .
We claim that
δ n ρ λ n / k for   all n N .
It will be done by mathematical induction. By the definition of ρ , our claim holds for n = 1 , 2 , , k . We now suppose the induction hypothesis:
δ n + i ρ λ ( n + i ) / k , i = 0 , 1 , , k 1 .
The sequence { ξ n } is G -termwise connected, for each n N , so { ξ n + i } i = 0 k is a path in G . By (2), we obtain
δ n + k = d G ( ξ n + k , ξ n + k + 1 ) = d G ( T ( ξ n , ξ n + 1 , , ξ n + k 1 ) , T ( ξ n + 1 , ξ n + 2 , , ξ n + k ) ) λ max 0 i k 1 { d G ( ξ n + i , ξ n + i + 1 ) } = λ max 0 i k 1 { δ n + i } .
Using (5), we get
δ n + k λ max 0 i k 1 { ρ λ ( n + i ) / k } = ρ λ max 0 i k 1 { λ ( n + i ) / k } ρ λ max 0 i k 1 { λ n / k } = ρ λ ( n + k ) / k .
Hence, (4) is proved.
We claim that { ξ n } is Cauchy. Let n , m N with m > n . Since { ξ n } is a G -termwise connected sequence, we find from (GM4) and (4) that
d G ( ξ n , ξ m ) d G ( ξ n , ξ n + 1 ) + d G ( ξ n + 1 , ξ n + 2 ) + + d G ( ξ m 1 , ξ m ) = i = 0 m n 1 d G ( ξ n + i , ξ n + i + 1 ) = i = 0 m n 1 δ n + i i = 0 m n 1 ρ λ ( n + i ) / k ρ λ n / k i = 0 λ i / k = ρ λ n / k 1 λ 1 / k .
As k is fixed and λ [ 0 , 1 ) , we obtain from the above inequality that
lim n , m d G ( ξ n , ξ m ) = 0 .
Hence, { ξ n } is a G -termwise connected Cauchy sequence. The G -completeness of ( X , d G ) yields that { ξ n } converges to some point in X. Using condition (III), there is ρ X and n 0 N so that ( ξ n , ρ ) E ( G ) or ( ρ , ξ n ) E ( G ) for each n > n 0 and
lim n d G ( ξ n , ρ ) = 0 .
Suppose that ( ξ n , u ) E ( G ) for all n > n 0 (proof for the case ( u , ξ n ) E ( G ) will be same). Since E ( G ) , { ξ n } is G -termwise connected and ( ξ n , ρ ) E ( G ) for all n > n 0 , the following sequences
{ ξ n , , ξ n + k 1 , ρ } , { ξ n + 1 , , ξ n + k 1 , ρ , ρ } , , { ξ n + k 1 , ρ , , ρ } , { ρ , , ρ , ρ }
are the paths of length k + 1 in G . In addition, T is ( G , G ) -Prešić–Ćirić operator; therefore,
d G ( T ( ξ n , , ξ n + k 1 ) , T ( ξ n + 1 , , ξ n + k 1 , ρ ) ) λ max n i n + k 2 d G ( ξ i , ξ i + 1 ) , d G ( ξ n + k 1 , ρ ) < max n i n + k 2 d G ( ξ i , ξ i + 1 ) , d G ( ξ n + k 1 , ρ )
for each n > n 0 . As T is d G -edge preserving, we have
T ( ξ n , , ξ n + k 1 ) , T ( ξ n + 1 , , ξ n + k 1 , ρ ) E ( G ) for each   n > n 0 .
Similarly,
T ( ξ n + 1 , , ξ n + k 1 , ρ ) , T ( ξ n + 2 , , ξ n + k 1 , ρ , ρ ) , T ( ξ n + 2 , , ξ n + k 1 , ρ , ρ ) , T ( ξ n + 3 , , ξ n + k 1 , ρ , ρ , ρ ) , , T ( ξ n + k 1 , ρ , , ρ ) , T ( ρ , , ρ )
are the members of E ( G ) for each n > n 0 . By (GM4), we obtain
d G ξ n + k , T ( ρ , , ρ ) = d G T ξ n , ξ n + 1 , , ξ n + k 1 , T ( ρ , , ρ ) d G T ξ n , ξ n + 1 , , ξ n + k 1 , T ξ n + 1 , , ξ n + k 1 , ρ + d G T ξ n + 1 , , ξ n + k 1 , ρ , T ( ξ n + 2 , , ξ n + k 1 , ρ , ρ ) + + d G T ξ n + k 1 , ρ , , ρ , T ( ρ , , ρ )
for all n > n 0 . Using (2), we find that
d G ξ n + k , T ( ρ , , ρ ) λ max d G ( ξ n , ξ n + 1 ) , , d G ( ξ n + k 1 , ρ ) + λ max d G ( ξ n + 1 , ξ n + 2 ) , , d G ( ξ n + k 1 , ρ ) + + λ d G ( ξ n + k 1 , ρ ) .
As lim n , m d G ( ξ n , ξ m ) = lim n d G ( ξ n , u ) = 0 , we find that
lim n d G ξ n + k , T ( ρ , , ρ ) = 0 .
Thus, { ξ n } converges to both ρ and T ( ρ , , ρ ) .  □
Theorem 3 ensures the convergence of a P P -sequence, but cannot ensure the existence of a fixed point of the ( G , G ) –Prešić–Ćirić operator. In the following, we explain this fact.
Example 1.
Let X = 2 N { 0 } , where 2 N = 1 2 n : n N and G and G be the graphs given as G = G , V ( G ) = X and E ( G ) = ( ξ , η ) 2 N × 2 N : η ξ .
Consider d G : X × X R as
d G ( ξ , η ) = 0 , i f ξ = η , ξ η , i f ξ , η 2 N , ξ η , 1 2 , o t h e r w i s e .
Note that ( X , d G ) is a G-complete graphical metric space, but it not a metric space. Choose T : X 2 X as
T ( ξ , η ) = ξ η , i f ξ , η 2 N , 1 2 , o t h e r w i s e .
Notice that T is a ( G , G ) –Prešić–Ćirić operator with λ = 1 / 4 .
If p , q N with p q , we have 1 2 p , 1 2 q is a path of length 2, and for this path we have 1 2 q , T 1 2 p , 1 2 q E ( G ) . Hence, P T 2 ( G ) .
Note that any path ξ 1 , ξ 2 , ξ 3 of length 3 in G must be one of the following form:
1 2 p , 1 2 p , 1 2 p , 1 2 p , 1 2 p , 1 2 q , 1 2 p , 1 2 q , 1 2 s ,
where p q s . In each case, we have T ξ 1 , ξ 2 , T ξ 2 , ξ 3 E ( G ) . Hence, T is d G -edge preserving.
Finally, any G-termwise connected, P P -sequence { ξ n } in X which converges to some μ, is either a constant sequence, or a subsequence of the sequence 1 2 p ; therefore, we have at least one value of z = 1 2 X so that (III) of Theorem 3 is verified. Note that, for each path { ξ j } j = 1 2 in P T 2 ( G ) , the P P -sequence with initial values ξ 1 , ξ 2 is G-termwise connected and is convergent to 1 2 and T 1 2 , 1 2 ; however, T has no fixed point.
The above example suggests that to prove the existence of fixed point of a ( G , G ) –Prešić–Ćirić operator in a graphical metric space, we must apply some additional condition to Theorem 3. Hence, inspired from Shukla et al. [1], we introduce the following property:
Definition 5.
Let ( X , d G ) be a graphical metric space, k a positive integer and T : X k X be a mapping. Hence, the quadruple X , d G , G , T has property ( S k ) if:
w h e n e v e r   a   G -t e r m w i s e   c o n n e c t e d   P P -s e q u e n c e   { ξ n }   h a s   t w o   l i m i t s   ρ a n d   v , w h e r e   ρ X , v T ( X k ) ,   t h e n   ρ = v . ( S k )
Consider ξ T = ξ X : ( ξ , T ( ξ , , ξ ) ) E ( G ) .
Remark 1.
The property ( S k ) is a k-dimensional version of the property (S) used by Shukla et al. [1]. In particular, the property ( S 1 ) is equivalent to the property (S).
The following result provides a sufficient condition on the existence of a fixed point of a ( G , G ) –Prešić–Ćirić operator in a graphical metric space.
Theorem 4.
Suppose that all the conditions of Theorem 3 are satisfied. If, in addition, ( X , d G , G , T ) has the property ( S k ), then T has a fixed point.
Proof. 
It follows from Theorem 3 that there exists a P P -sequence { ξ n } with initial values ξ 1 , ξ 2 , , ξ k and ρ X such that { ξ n } is G -termwise connected and is convergent to both ρ and T ( ρ , , ρ ) . As ρ X , we have T ( ρ , , ρ ) T ( X k ) , hence by the property ( S k ), we get T ( ρ , , ρ ) = ρ . Thus, ρ is a fixed point of T. □
Example 2.
Consider X = [ 0 , 1 ] and G given by V ( G ) = X and
E ( G ) = ( ξ , η ) X × X : ξ , η ( 0 , 1 ] , ξ η .
Let G = G . Take d G : X × X R as
d G ( ξ , η ) = 0 , i f ξ = η , ln 1 ξ η , i f ξ , η ( 0 , 1 ] , ξ η , 1 , o t h e r w i s e .
Then, ( X , d G ) is a G-complete graphical metric space. Put k = 2 . Take T : X 2 X as
T ( ξ , η ) = max ξ , η .
Then, T is a ( G , G ) –Prešić–Ćirić operator with λ = 1 / 2 . All conditions of Theorem 4 are fulfilled, and so, by Theorem 4, T must have a fixed point. Indeed, Fix ( T ) = { 0 , 1 } .
T is not a G-Prešić operator (in the sense of Shukla and Shahzad [27]) with respect to the usual metric defined on X .
The fixed point of a ( G , G ) –Prešić–Ćirić operator satisfying conditions of Theorem 4 may not be unique. The above example verifies this fact.
Theorem 5.
Assume that all conditions of Theorem 4 hold. If, in addition, ξ T is weakly connected (as a subgraph of G ) and
d ( T ( ξ , , ξ ) , T ( η , , η ) ) < d ( ξ , η ) f o r   a l l ( ξ , η ) ( ξ T × ξ T ) E ( G ˜ ) ,
then T has a unique fixed point.
Proof. 
The existence of a fixed point ρ follows from Theorem 4. Suppose that v is a fixed point of T and ρ v . Since ρ , v Fix(T), E ( G ) and ξ T is weakly connected, we get ρ , v ξ T and ( ρ , v ) E ( G ˜ ) , hence
d ( ρ , v ) = d ( T ( ρ , , ρ ) , T ( v , , v ) ) < d ( ρ , v ) .
This contradiction proves the result. □
Remark 2.
If in Theorem 5, Fix(T) is assumed weakly connected and the following
d ( T ( ξ , , ξ ) , T ( η , , η ) ) < d ( ξ , η ) f o r   a l l ( ξ , η ) ( F i x ( T ) × F i x ( T ) ) E ( G ˜ )
holds instead as we have assumed, then the conclusion remains the same.
Remark 3.
Let ( X , d G ) be a metric space and T : X k X . Let G be a subgraph of G such that E ( G ) . Then, T is called a ( G , G ) -Prešić operator if there are q i 0 such that i = 1 k q i < 1 and for each path { ξ i } i = 1 k + 1 in G , the following holds:
d G ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) i = 1 k q i d G ( ξ i , ξ i + 1 ) .
Clearly, each ( G , G ) -Prešić operator is a ( G , G ) -Prešić-Ćirić operator. In addition, if T is a d G -edge preserving in G , ( ρ , v ) E ( G ) , then, since E ( G ) , we obtain from (GM4) that
d G ( T ( ρ , , ρ ) , T ( v , , v ) ) d G ( T ( ρ , , ρ ) , T ( ρ , , ρ , v ) ) + d G ( T ( ρ , , ρ , v ) , T ( v , , ρ , v , v ) ) + + d G ( T ( ρ , v , , v ) , T ( v , , v ) ) q k d G ( ρ , v ) + q k 1 d G ( ρ , v ) + + q 1 d G ( ρ , v ) = i = 1 k q i d G ( ρ , v ) < d G ( ρ , v )
for all ρ , v ξ T . We conclude the same when ( v , ρ ) E ( G ) .
We next derive generalizations and extensions of many known results.
The following is a graphical metric version of results of Shukla and Shahzad [27] and its proof follows directly using Remarks 2 and 3.
Corollary 1.
Let ( X , d G ) be a G -complete graphical metric space and T : X k X be a ( G , G ) -Prešić operator. Assume that
(I) 
P T k ( G ) ;
(II) 
T is d G -edge-preserving in G ;
(III) 
if a G -termwise connected P P -sequence { ξ n } is convergent in X , then there is μ X of { ξ n } and n 0 N so that ( ξ n , μ ) E ( G ) or ( μ , ξ n ) E ( G ) for each n > n 0 .
Then, for every path { ξ i } i = 1 k in P T k ( G ) , the P P -sequence with initial values ξ 1 , ξ 2 , , ξ k is G -termwise connected and is convergent to both ρ and T ( ρ , , ρ ) , for some ρ X . If in addition, ( X , d G , G , T ) has the property ( S k ), then T has a fixed point. Furthermore, if Fix(T) is weakly connected (a subgraph of G ), then such fixed point is unique.
Corollary 2
(Ćirić and Prešić [8]). Let ( X , d ) be a complete metric space and T : X k X be a mapping so that there is λ [ 0 , 1 ) so that
d ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) λ max { d ( ξ i , ξ i + 1 ) : 1 i k } ,
for all ξ 1 , ξ 2 , , ξ k + 1 X . Then, there is ξ in X such that T ( ξ , ξ , , ξ ) = ξ . Moreover, for arbitrary ξ 1 , ξ 2 , , ξ k X and for n N , ξ n + k = T ( ξ n , ξ n + 1 , , ξ n + k 1 ) , { ξ n } converges and lim n ξ n = T lim n ξ n , lim n ξ n , , lim n ξ n . If, in addition, on the diagonal X k , d ( T ( ρ , ρ , , ρ ) , T ( v , v , , v ) ) < d ( ρ , v ) for ρ , v X , with ρ v , then ξ is the unique point satisfying ξ = T ( ξ , ξ , , ξ ) .
Proof. 
Take the graphs G and G as G = G where V ( G ) = X and E ( G ) = X × X . All the conditions of Theorem 5 hold, and the proof follows directly. □
Next, we give a result for cyclic contractions in product spaces (see [23]). The following definition generalizes the definition of cyclic-Prešić operator given by Shukla and Abbas [23].
Definition 6.
Let X be any nonempty set and T : X k X . Take E 1 , E 2 , , E p nonempty subsets subsets of X . Then X = j = 1 p E j is a cyclic representation of X with respect to T if
1.
E j , j = 1 , 2 , , p are nonempty sets;
2.
T ( E 1 × E 2 × × E k ) E k + 1 , T ( E 2 × E 3 × × E k + 1 ) E k + 2 , , T ( E i × E i + 1 × × E i + k 1 ) E i + k , , where E p + j = E j for all j N .
If Y X , then T : Y k Y is said to be a cyclic-Prešić-Ćirić operator in the case that
(CPC1) 
Y = j = 1 p E j is a cyclic representation of Y with respect to T ;
(CPC2) 
there is λ [ 0 , 1 ) so that
d ( T ( ξ 1 , ξ 2 , , ξ k ) , T ( ξ 2 , ξ 3 , , ξ k + 1 ) ) λ max 1 i k { d ( ξ i , ξ i + 1 ) }
for all ξ 1 E j , ξ 2 E j + 1 , , ξ k + 1 E j + k , ( j = 1 , 2 , , p E p + j = E j for j N ).
The following is a generalized form of the main result of Shukla and Abbas [23] (in view of (7)).
Corollary 3.
Let E 1 , E 2 , , E m be closed nonempty subsets of a complete metric space ( X , d ) and Y = j = 1 p E j . Let T : Y k Y be a cyclic–Prešić–Ćirić operator, then T has a fixed point ρ j = 1 p E j . If, in addition,
d ( T ( ξ , , ξ ) , T ( η , , η ) ) < d ( ξ , η ) f o r   a l l ξ , η F i x ( T )   w i t h ξ η
and Fix ( T ) j = 1 p E j , then ρ is unique.
Proof. 
Take the graphs G and G by V ( G ) = X , E ( G ) = X 2 and V ( G ) = X ,
E ( G ) = { ( ξ , η ) X 2 : ξ E i , η E i + 1 , 1 i k } ,
where E p + j = E j for all j N . Since each E i is closed, Y is G -complete. The condition (CPC2) shows that T is a ( G , G ) –Prešić–Ćirić operator, while (CPC1) ensures that T is d G -edge preserving in G . Since each E i is nonempty, P T k ( G ) . Furthermore, since E ( G ) = X 2 , ( X , d G , G , T ) has the property ( S k ). Proposition 2.1 of [23] shows that the condition (III) of Theorem 3 is satisfied. Hence, by Theorem 4, T has a fixed point ρ Y as the limit of a G -termwise connected sequence, and so, by Proposition 2.1 of [23], we have ρ j = 1 p E j . Finally, if Fix ( T ) j = 1 p E j , then Fix(T) is weakly connected (a subgraph of G ), therefore the proof follows from Theorem 5. □
In the next definition and corollary, we generalize the results of Ran and Reurings [2] and Nieto and Lopez [24,25] in product spaces.
Definition 7.
Let X be a nonempty set equipped with a partial order and a metric d. A sequence { ξ n } in X is nondecreasing with respect to if ξ 1 ξ 2 ξ n . A subset A X is called well-ordered if ξ η or η ξ for all ξ , η A . The map T : X k X is said nondecreasing with respect to if, for any finite nondecreasing sequence { ξ i } i = 1 k + 1 , we have T ( ξ 1 , ξ 2 , , ξ k ) T ( ξ 2 , ξ 3 , , ξ k + 1 ) . Such T is called an ordered Prešić–Ćirić type operator if:
(OPC1) 
T is nondecreasing with respect to ;
(OPC2) 
there is λ [ 0 , 1 ) so that
d ( f ( ξ 1 , ξ 2 , , ξ k ) , f ( ξ 2 , ξ 3 , , ξ k + 1 ) ) λ max 1 i k { d ( ξ i , ξ i + 1 ) }
for all ξ 1 , ξ 2 , , ξ k + 1 X with ξ 1 ξ 2 ξ k + 1 .
Corollary 4.
Let ( X , , d ) be an ordered complete metric space and T : X k X . Suppose that
(A) 
T is an ordered Prešić-Ćirić type contraction;
(B) 
there are ξ 1 , ξ 2 , , ξ k X so that ξ 1 ξ 2 ξ k T ( ξ 1 , ξ 2 , , ξ k ) ;
(C) 
if a nondecreasing sequence { ξ n } is convergent to ξ X , then ξ n ξ or ξ ξ n .
Then, T has a fixed point ρ X . If, in addition,
d ( T ( ξ , , ξ ) , T ( η , , η ) ) < d ( ξ , η ) f o r   a l l ξ , η F i x ( T ) w i t h ξ η ,
then Fix ( T ) is well-ordered iff ρ is unique.
Proof. 
Consider graphs G and G such that V ( G ) = X , E ( G ) = X × X and V ( G ) = X ,
E ( G ) = { ( x , y ) X × X : x y } .
Then, X is G complete. (OPC1) implies that T is a ( G , G ) –Prešić–Ćirić operator and (OPC2) shows that T is d G -edge preserving in G . Condition (B) ensures that T T k ( G ) . Since E ( G ) = X × X , ( X , d G , G , T ) has the property ( S k ). Condition (C) shows that condition (III) of Theorem 3 holds. Hence, by Theorem 4, T has a fixed point ρ X . Finally, if Fix ( T ) is well-ordered, then Fix ( T ) is weakly connected (a subgraph of G ,) so, from Theorem 5, the fixed point ρ is unique. If Fix(T) is a singleton, then it is well-ordered. □

Author Contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors are thankful to the Editor and Reviewers for their useful and critical remarks on this paper. The first author is also thankful to Mahesh Kumar Dube and Stojan Radenović for their encouragement and motivation for research. The second author would like to thank Prince Sultan University for funding this work through the research group Nonlinear Analysis Methods in Applied Mathematics (NAMAM) group number RG-DES-2017-01-17.

Conflicts of Interest

The authors declare that they have no competing interests regarding the publication of this paper.

References

  1. Shukla, S.; Radenović, S.; Vetro, C. Graphical metric space: A generalized setting in fixed point theory. Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Ser. A Matemáticas 2017, 111, 641–655. [Google Scholar] [CrossRef]
  2. Ran, A.C.M.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some application to matrix equations. Proc. Am. Math. Soc. 2004, 132, 1435–1443. [Google Scholar] [CrossRef]
  3. Kirk, W.A.; Srinivasan, P.S.; Veeramani, P. Fixed points for mappings satisfying cyclical contractive conditions. Fixed Point Theory 2003, 4, 79–89. [Google Scholar]
  4. Edelstein, M. An extension of Banach’s contraction principle. Proc. Am. Math. Soc. 1961, 12, 7–10. [Google Scholar]
  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. Prešić, S.B. Sur la convergence des suites. Comptes Rendus de l’Acad. de Paris 1965, 260, 3828–3830. [Google Scholar]
  7. Prešić, S.B. Sur une classe d’inéquations aux differences finies et sur la convergence de certaines suites. Publ. de l’Inst. Math. Belgrade 1965, 5, 75–78. [Google Scholar]
  8. Ćirić, L.B.; Prešić, S.B. On Prešić type generalisation of Banach contraction principle. Acta Math. Univ. Com. 2007, LXXVI, 143–147. [Google Scholar]
  9. Khan, M.S.; Berzig, M.; Samet, B. Some convergence results for iterative sequences of Prešić type and applications. Adv. Differ. Equ. 2012. [Google Scholar] [CrossRef]
  10. Shahzad, N.; Shukla, S. Set-valued G-Prešić operators on metric spaces endowed with a graph and fixed point theorems. Fixed Point Theory Appl. 2015, 2015, 24. [Google Scholar] [CrossRef]
  11. Shukla, S.; Gopal, D.; R-López, R. Fuzzy-Prešić–Ćirić operators and applications to certain nonlinear differential equations. Math. Model. Anal. 2016, 21, 811–835. [Google Scholar] [CrossRef]
  12. Shukla, S.; Radenović, S. Some generalizations of Prešić type mappings and applications. An. Ştiinţ. Univ. Al. I. Cuza Iaşi. Mat. (N.S.) 2017. [Google Scholar] [CrossRef]
  13. Berinde, V.; Păcurar, M. Two elementary applications of some Prešić type fixed point theorems. Creat. Math. Inform. 2011, 20, 32–42. [Google Scholar]
  14. Chen, Y.Z. A Prešić type contractive condition and its applications. Nonlinear Anal. 2009, 71, 2012–2017. [Google Scholar] [CrossRef]
  15. Luong, N.V.; Thuan, N.X. Some fixed point theorems of Prešić–Ćirić type. Acta Universitatis Apulensis 2012, 30, 237–249. [Google Scholar]
  16. George, R.; Reshma, K.P.; Rajagopalan, R. A generalised fixed point theorem of Prešić type in cone metric spaces and application to Morkov process. Fixed Point Theory Appl. 2011, 2011, 85. [Google Scholar] [CrossRef]
  17. Malhotra, S.K.; Shukla, S.; Sen, R. A generalization of Banach contraction principle in ordered cone metric spaces. J. Adv. Math. Stud. 2012, 5, 59–67. [Google Scholar]
  18. Shukla, S. Prešić type results in 2-Banach spaces. Afrika Matematika 2014, 25, 1043–1051. [Google Scholar] [CrossRef]
  19. Shukla, S. Set-valued Prešić–Ćirić type contraction in 0-complete partial metric spaces. Matematićki Vesnik 2014, 66, 178–189. [Google Scholar]
  20. Shukla, S.; Sen, R. Set-valued Prešić-Reich type mappings in metric spaces. Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas 2014, 108, 431–440. [Google Scholar] [CrossRef]
  21. Shukla, S.; Sen, R.; Radenović, S. Set-valued Prešić type contraction in metric spaces. An. Ştiinţ. Univ. Al. I. Cuza Iaşi. Mat. (N.S.) 2015, LXI, f.2. [Google Scholar] [CrossRef]
  22. Shukla, S.; Radojević, S.; Veljković, Z.A.; Radenović, S. Some coincidence and common fixed point theorems for ordered Prešić-Reich type contractions. J. Inequ. Appl. 2013, 2013, 520. [Google Scholar] [CrossRef]
  23. Shukla, S.; Abbas, M. Fixed point results of cyclic contractions in product spaces. Carpathian J. Math. 2014, 31, 119–126. [Google Scholar]
  24. Nieto, J.J.; Lopez, R.R. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22, 223–239. [Google Scholar] [CrossRef]
  25. Nieto, J.J.; Lopez, R.R. Existence and uniqueness of fixed point in partially ordered sets and applications to ordinary differential equations. Acta Math. Sin. Engl. Ser. 2007, 23, 2205–2212. [Google Scholar] [CrossRef]
  26. Shukla, S.; Radenović, S. A generalization of Prešić type mappings in 0-Complete ordered partial metric spaces. Chin. J. Math. 2013, 2013, 859531. [Google Scholar] [CrossRef]
  27. Shukla, S.; Shahzad, N. G-Prešić operators on metric spaces endowed with a graph and fixed point theorems. Fixed Point Theory Appl. 2014, 2014, 127. [Google Scholar] [CrossRef]
  28. Felhi, A.; Aydi, H.; Zhang, D. Fixed points for α-admissible contractive mappings via simulation functions. J. Nonlinear Sci. Appl. 2016, 9, 5544–5560. [Google Scholar] [CrossRef]
  29. Afshari, H.; Atapour, M.; Aydi, H. Generalized αψ-Geraghty multivalued mappings on b-metric spaces endowed with a graph. TWMS J. Appl. Eng. Math. 2017, 7, 248–260. [Google Scholar]
  30. Ameer, E.; Aydi, H.; Arshad, M.; Alsamir, H.; Noorani, M.S. Hybrid multivalued type contraction mappings in αK-complete partial b-metric spaces and applications. Symmetry 2019, 11, 86. [Google Scholar] [CrossRef]
  31. Aydi, H.; Felhi, A. Fixed points in modular spaces via α-admissible mappings and simulation functions. J. Nonlinear Sci. Appl. 2016, 9, 3686–3701. [Google Scholar] [CrossRef]
  32. Souyah, N.; Aydi, H.; Abdeljawad, T.; Mlaiki, N. Best proximity point theorems on rectangular metric spaces endowed with a graph. Axioms 2019, 8, 17. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Shukla, S.; Mlaiki, N.; Aydi, H. On (G, G′)-Prešić–Ćirić Operators in Graphical Metric Spaces. Mathematics 2019, 7, 445. https://doi.org/10.3390/math7050445

AMA Style

Shukla S, Mlaiki N, Aydi H. On (G, G′)-Prešić–Ćirić Operators in Graphical Metric Spaces. Mathematics. 2019; 7(5):445. https://doi.org/10.3390/math7050445

Chicago/Turabian Style

Shukla, Satish, Nabil Mlaiki, and Hassen Aydi. 2019. "On (G, G′)-Prešić–Ćirić Operators in Graphical Metric Spaces" Mathematics 7, no. 5: 445. https://doi.org/10.3390/math7050445

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