Next Article in Journal
Some Incomplete Hypergeometric Functions and Incomplete Riemann-Liouville Fractional Integral Operators
Next Article in Special Issue
Some General Theorems for Compact Acyclic Multifunctions
Previous Article in Journal
Generalized (σ,ξ)-Contractions and Related Fixed Point Results in a P.M.S
Previous Article in Special Issue
New Inertial Forward-Backward Mid-Point Methods for Sum of Infinitely Many Accretive Mappings, Variational Inequalities, and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

(C , Ψ * , G ) Class of Contractions and Fixed Points in a Metric Space Endowed with a Graph

by
Reny George
1,2,*,
Ekta Tamrakar
3,
Jelena Vujaković
4,
Hemant Kumar Pathak
3 and
Selvavinayagam Velusamy
5
1
Department of Mathematics, College of Science, Prince Sattam bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
2
Department of Mathematics and Computer Science, St. Thomas College, Bhilai, Chhattisgarh 490006, India
3
School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, India
4
Faculty of Sciences and Mathematics, University of Privstina, Kosovska Mitrovica 38220, Serbia
5
Nasser Vocational Training Centre, Jau, Kingdom of Bahrain
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(5), 482; https://doi.org/10.3390/math7050482
Submission received: 18 April 2019 / Revised: 7 May 2019 / Accepted: 17 May 2019 / Published: 27 May 2019
(This article belongs to the Special Issue Fixed Point Theory and Related Nonlinear Problems with Applications)

Abstract

:
In this paper, we introduce the ( 𝒞 , Ψ * , G ) class of contraction mappings using C-class functions and some improved control functions for a pair of set valued mappings as well as a pair of single-valued mappings, and prove common fixed point theorems for such mappings in a metric space endowed with a graph. Our results unify and generalize many important fixed point results existing in literature. As an application of our main result, we have derived fixed point theorems for a pair of α -admissible set valued mappings in a metric space.

1. Introduction and Preliminaries

In [1], Ran and Reurings proved the existence of fixed points for single-valued mappings in partially ordered metric spaces, and their results were extended by Neito and Lopez [2]. However, it became clear that the concept of a graph gives a better vision of fixed points instead of partial ordering, and the first attempt in this direction was done by Jachymsky [3]. He defined the Banach G- contraction for single-valued mapping, which was later extended by Beg et al. [4] for the multivalued mappings. After these, there was a lot of work done in the direction of fixed points in metric spaces endowed with graphs, see [5,6,7,8,9,10,11,12,13,14].
In 1973, Geraghty [15] defined Θ as the class of functions θ : [ 0 , ) [ 0 , 1 ) such that
θ ( t n ) 1 t n 0 ,
and also showed generalizations of the Banach-Neumann contractive mapping principle.
We now recall the following class of functions:
Ψ denotes the class of all continuous and non-decreasing functions ψ : [ 0 , ) [ 0 , ) , such that:
  • ψ ( t ) = 0 if, and only if t = 0 .
    Φ denotes the class of all lower semi-continuous functions ϕ : [ 0 , ) [ 0 , ) , such that:
  • ϕ ( t ) = 0 if, and only if t = 0 .
For more results on contraction principles involving the above said control functions, we refer the reader to [16,17,18].
In [19], the family of 𝒞 -class functions were introduced as follows: F : [ 0 , ) 2 R belongs to the 𝒞 -class functions if:
  • F is continuous,
  • F ( s , t ) s ,
  • F ( s , t ) = s implies that either s = 0 or t = 0 ; for all s , t [ 0 , ) .
In [20], Samet et al. introduced the concept of α -admissible mappings, and proved fixed point theorems for α - ψ contractive-type mappings, which paved a way to prove new results and generalise existing results in the fixed point theory. For some recent results on fixed point theorems of α -admissible mappings, the reader may refer to [21,22,23,24].
In this work, we utilised the C-class functions to give modified versions of contraction principles involving Ψ class functions and Φ class functions in the sense that we have relaxed the condition α ( t ) = 0 if, and only if t = 0 in the Ψ and Φ class functions to α ( t ) = 0 t = 0 . As an application, we have also deduced some common fixed point theorems for a pair of α -admissible mappings.
Throughout this work, ( X G , d G ) will denote the metric space endowed with a directed graph G with V ( G ) = X G and Δ E ( G ) , where V ( G ) denotes the set of vertices, E ( G ) denotes the set of edges of the graph G and Δ = { ( x G , x G ) : x G X } .
Definition 1.
[3] ( X G , d G ) is said to have property A if x n x G and ( x n , x n + 1 ) E ( G ) implies ( x n , x G ) E ( G ) , for all sequences { x n } n N in X G .
Definition 2.
[16] The pair ( f , g ) of self mappings of X G is g-edge preserving in G, if
( g x , g y ) E ( G ) ( f x , f y ) E ( G ) .
Definition 3.
[11] E ( G ) satisfies transitivity property if, and only if for all x , y , z X G , ( x , z ) E ( G ) and ( z , y ) E ( G ) implies ( x , y ) E ( G ) .
Let mappings S , T : X G C L ( X G ) be given. We will make use of the following notations:
  • C O F I X { S , T } = { u X G : u S u T u } is the set of all common fixed points of S and T
  • F I X { T } = { u X G : u T u } is the set of all fixed points of T.

2. Main Results

Let Θ * be the set of all continuous functions θ : [ 0 , ) [ 0 , 1 ) .
Ψ * be the set of all continuous and non decreasing functions ψ : [ 0 , ) [ 0 , ) , such that:
  • ψ ( t ) = 0 t = 0 .
    Let Φ * be the set of all lower semi-continuous functions ϕ : [ 0 , ) [ 0 , ) , such that:
  • ϕ ( t ) = 0 t = 0 .
Definition 4.
Let S , T : X G C B ( X G ) be two given mappings. We say that the pair ( S , T ) belongs to the class of ( 𝒞 , Ψ * , G ) contractions if, and only if for all x G , y G X G with ( x G , y G ) E ( G ) , the following conditions are satisfied:
(4.1) 
For u G S x G , there exists v G T y G such that ( u G , v G ) E ( G )
(4.2) 
For u G T x G , there exists v G S y G such that ( u G , v G ) E ( G )
(4.3) 
there exists F 𝒞 , ψ Ψ * , such that
  • ψ ( H ( S x G , T y G ) ) F ( ψ ( M ( x G , y G ) ) , M ( x G , y G ) ) and
  • ψ ( H ( T x G , S y G ) ) F ( ψ ( M ( x G , y G ) ) , M ( x G , y G ) )
where
M ( x G , y G ) = max d G ( x G , y G ) , d G ( S x G , x G ) , d G ( T y G , y G ) , d G ( y G , S x G ) + d G ( x G , T y G ) 2
Theorem 1.
Let ( X G , d G ) be complete and S , T : X G C B ( X G ) satisfy the following:
(1.1) 
There exists x G 0 , x G 1 X G such that x G 1 T x G 0 S x G 0 and ( x G 0 , x G 1 ) E ( G ) ,
(1.2) 
E ( G ) satisfy transitivity property,
(1.3) 
( S , T ) ( 𝒞 , Ψ * , G ) for some F 𝒞 * and ψ Ψ * .
Then C O F I X { S , T } ϕ .
Proof. 
By condition (1.1), suppose x G 0 X G , and x G 1 S ( x G 0 ) . By condition (4.1), we can find x G 2 T ( x G 1 ) with ( x G 1 , x G 2 ) E ( G ) and
ψ ( d G ( x G 1 , x G 2 ) ) ψ ( H ( S ( x G 0 ) , T ( x G 1 ) ) ) F ( ψ ( M ( x G 0 , x G 1 ) ) , ϕ ( M ( x G 0 , x G 1 ) ) )
Now again by condition (4.2), for x G 2 T ( x G 1 ) , there exists x G 3 S ( x G 2 ) with ( x G 2 , x G 3 ) E ( G ) and
ψ ( d G ( x G 2 , x G 3 ) ) ψ ( H ( T x G 1 , S x G 2 ) ) F ( ψ ( M ( x G 1 , x G 2 ) ) , M ( x G 1 , x G 2 ) ) .
Continuing inductively, we construct the sequence { x G n } recursively as for n 0 , as
x G 2 n + 1 S ( x G 2 n ) , x G 2 n T ( x G 2 n 1 )
as well as ( x G n , x G n + 1 ) E ( G ) . Our first task is to establish that C O F I X { S , T } ϕ . Note that if M ( x G m , x G n ) = 0 for any n, m N then
M ( x G m , x G n ) = max { d G ( x G m , x G n ) , d G ( S x G m , x G m ) , d G ( T x G n , x G n ) , d G ( x G n , S x G m ) + d G ( x G m , T x G n ) 2 } = 0
which shows that x G m = x G n C O F I X { S , T } , and our first task will be complete. So let M ( x G m , x G n ) 0 for any n , m N . Then, by definition of ψ , ψ ( M ( x G n 1 , x G n ) ) 0 .
If n is odd, we have
ψ ( d G ( x G n , x G n + 1 ) ) ψ ( H ( S x G n 1 , T x G n ) ) F ( ψ ( M ( x G n 1 , x G n ) ) , M ( x G n 1 , x G n ) )
Since ψ ( M ( x G n 1 , x G n ) ) 0 , we have
F ( ψ ( M ( x G n 1 , x G n ) ) , M ( x G n 1 , x G n ) ) < ψ ( M ( x G n 1 , x G n ) )
Then, by (4), we get
ψ ( d G ( x G n , x G n + 1 ) ) < ψ ( M ( x G n 1 , x G n ) )
where
M ( x G n 1 , x G n ) = max { d G ( x G n 1 , x G n ) , d G ( S x G n 1 , x G n 1 ) , d G ( T x G n , x G n ) , d G ( x G n , S x G n 1 ) + d G ( x G n 1 , T x G n ) 2 } max { d G ( x G n 1 , x G n ) , d G ( x G n , x G n 1 ) , d G ( x G n + 1 , x G n ) , d G ( x G n , x G n ) + d G ( x G n 1 , x G n + 1 ) 2 } max d G ( x G n 1 , x G n ) , d G ( x G n + 1 , x G n ) , d G ( x G n 1 , x G n + 1 ) 2 max { d G ( x G n 1 , x G n ) , d G ( x G n + 1 , x G n ) , d G ( x G n 1 , x G n ) + d G ( x G n , x G n + 1 ) 2 } max { d G ( x G n 1 , x G n ) , d G ( x G n , x G n + 1 ) }
If d G ( x G n + 1 , x G n ) > d G ( x G n 1 , x G n ) , then M ( x G n 1 , x G n ) d G ( x G n + 1 , x G n ) . Then (5) gives
ψ ( d G ( x G n , x G n + 1 ) ) < ψ ( d G ( x G n , x G n + 1 ) )
a contradiction. So, we have
d G ( x G n , x G n + 1 ) d G ( x G n 1 , x G n )
For an even number n, a similar argument leads to inequality (6). Thus, { d G ( x n + 1 , x G n ) } is a monotonically non-increasing sequence which is bounded below, and thereby,
lim n d G ( x G n , x G n + 1 ) = lim n M ( x G n 1 , x G n ) = r 0 .
Assume that r > 0 , so that ψ ( r ) > 0 . Taking lim inf on both sides of the inequality (5), we obtain
ψ ( r ) < ψ ( r )
a contradiction. Hence r = 0 . Consequently, we have
lim n d G ( x G n , x G n + 1 ) = 0 .
Next, we prove that { x G n } is a Cauchy sequence. By (7), it is enough if we show that the subsequence { x G 2 n } is a Cauchy sequence. Suppose, if possible, { x G 2 n } is not a Cauchy sequence. Then, there exists ϵ > 0 and subsequences { x G 2 m ( k ) } and { x G 2 n ( k ) } , such that n ( k ) is the smallest index for which n ( k ) > m ( k ) > k , d G ( x G 2 m ( k ) , x G 2 n ( k ) ) ϵ . That is,
d G ( x G 2 m ( k ) , x G 2 n ( k ) 2 ) < ϵ
Now, we have
ϵ d G ( x G 2 m ( k ) , x G 2 n ( k ) ) d G ( x G 2 m ( k ) , x G 2 n ( k ) 2 ) + d G ( x G 2 n ( k ) 2 , x G 2 n ( k ) 1 ) + d G ( x G 2 n ( k ) 1 , x G 2 n ( k ) ) < ϵ + d G ( x G 2 n ( k ) 2 , x G 2 n ( k ) 1 ) + d G ( x G 2 n ( k ) 1 , x G 2 n ( k ) )
AS k , we get
lim k d G ( x G 2 m ( k ) , x G 2 n ( k ) ) = ϵ
Also, we have
| d G ( x G 2 m ( k ) , x G 2 n ( k ) + 1 ) d G ( x G 2 m ( k ) , x G 2 n ( k ) ) | d G ( x G 2 n ( k ) , x G 2 n ( k ) + 1 ) and | d G ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) d G ( x G 2 m ( k ) , x G 2 n ( k ) ) | d G ( x G 2 m ( k ) , x 2 m ( k ) 1 ) .
Letting k and using (7) and (9), we get
lim k d G ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) = lim k d G ( x G 2 m ( k ) , x G 2 n ( k ) + 1 ) = ϵ .
From
| d G ( x G 2 m ( k ) 1 , x G 2 n ( k ) + 1 ) d G ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) | d G ( x G 2 n ( k ) , x G 2 n ( k ) + 1 )
and making use of (7) and (10), we get
lim k d G ( x G 2 m ( k ) 1 , x G 2 n ( k ) + 1 ) = ϵ
Also, from the definition of M and from (7) and (9)–(11), we have
lim k M ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) = ϵ
Also by the transitivity property of G, we have ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) E ( G ) . Thus, we have
ψ ( d G ( x G 2 m ( k ) , x G 2 n ( k ) + 1 ) ) = ψ ( H ( T x G 2 m ( k ) 1 , S x G 2 n ( k ) ) ) F ( ψ ( M ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) ) , ( M ( x G 2 m ( k ) 1 , x G 2 n ( k ) ) )
Letting k and making use of (10) and (11), the above inequality yields
ψ ( ϵ ) < ψ ( ϵ )
a contradiction. Thus, { x G n } is a Cauchy sequence. By completeness of X G , we can find u G X G , such that x G n u G as n .
We will now prove that u G C O F I X { S , T } . Note that ( x G 2 n + 1 , u G ) E ( G ) , and so
ψ ( d G ( x G 2 n + 1 , T u G ) ) ψ ( H ( S x G 2 n , T u G ) ) F ( ψ ( M ( x G 2 n , u G ) ) , M ( x G 2 n , u G ) )
where
M ( x G 2 n , u G ) = max { d G ( x G 2 n , u G ) , d G ( S x G 2 n , x G 2 n ) , d G ( T u G , u G ) , d G ( x G 2 n , T u G ) + d G ( u G , S x G 2 n ) 2 }
Note that as n , d G ( S x G 2 n , x G 2 n ) 0 , d G ( u G , S x G 2 n ) 0 , and so M ( u G , x G 2 n ) d G ( T u G , u G ) Now, if d G ( T u G , u G ) 0 , then from (13) as n , we have
ψ ( d G ( T u G , u G ) < ψ ( d G ( T u G , u G ) ) ,
again, a contradiction. Thus, d G ( T u G , u G ) = 0 , which implies that u G T u G ¯ , and since T u G is closed, we have u G T u G .
Now again, we have M ( u G , u G ) = d G ( u G , S u G ) , and if d G ( u G , S u G ) 0 , since ( u G , u G ) Δ E ( G ) , we get
ψ ( d G ( S u G , u G ) ) ψ ( H ( S u G , T u G ) ) F ( ψ ( M ( u G , u G ) ) M ( u G , u G ) ) < ψ ( d G ( u G , S u G ) )
a contradiction, and thereby, d G ( u G , S u G ) = 0 or u G S u G . Hence, C O F I X { S , T } ϕ . ☐
We will deduce the following important results from Theorem 1:
Corollary 1.
Let ( X G , d G ) be complete and S , T : X G C B ( X G ) satisfy conditions (4.1), condition (4.2), condition (1.1), condition (1.2), and the following:
(1.1) For all x G , y G X G with ( x G , y G ) E ( G )
  • ψ ( H ( S x G , T y G ) ) ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) and
  • ψ ( H ( T x G , S y G ) ) ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) )
where ψ Ψ * , ϕ Φ * and M ( x G , y G ) is as in Definition 4. Then, C O F I X { S , T } ϕ .
Proof. 
Take F ( r , t ) = r ϕ ( t ) in Theorem 1. ☐
Corollary 2.
Let ( X G , d G ) be complete and S , T : X G C B ( X G ) satisfy the conditions (4.1), condition (4.2), condition (1.1), condition (1.2), and the following:
(2.1) For all x G , y G X G with ( x G , y G ) E ( G )
  • ψ ( H ( S x G , T y G ) ) θ ( M ( x G , y G ) ) ψ ( M ( x G , y G ) ) and
  • ψ ( H ( T x G , S y G ) ) θ ( M ( x G , y G ) ) ψ ( M ( x G , y G ) )
where ψ Ψ * , θ Θ * and M ( x G , y G ) is as in Definition 4. C O F I X { S , T } ϕ .
Proof. 
Take F ( r , t ) = θ ( t ) . r in Theorem 1. ☐
Corollary 3.
Let ( X G , d G ) be complete and S , T : X G C B ( X G ) satisfy the conditions (4.1), (4.2), (1.1) and (1.2), and the following:
(3.1) For all x G , y G X G with ( x G , y G ) E ( G ) , there exist 0 < λ < 1 , such that
  • H ( S x G , T y G ) λ ( M ( x G , y G ) ) and
  • H ( T x G , S y G ) λ ( M ( x G , y G ) )
where M ( x G , y G ) is as in Definition 4. Then C O F I X { S , T } ϕ .
Proof. 
For some k > 0 , set k * = k ( 1 λ ) . Then,
  • H ( S x G , T y G ) ) λ ( M ( x G , y G ) ) and
  • H ( T x G , S y G ) λ ( M ( x G , y G ) )
implies
  • H ( S x G , T y G ) k k * k ( M ( x G , y G ) ) and
  • H ( T x G , S y G ) k k * k ( M ( x G , y G ) )
or
  • k H ( S x G , T y G ) + 1 k M ( x G , y G ) + 1 k * M ( x G , y G ) and
  • k H ( T x G , S y G ) k M ( x G , y G ) k * M ( x G , y G )
  • Now, let ψ ( t ) = k t + 1 and ϕ ( t ) = k * ( t ) . Then, the above inequality leads to
  • ψ ( H ( S x G , T y G ) ) ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) and
  • ψ ( H ( T x G , S y G ) ) ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) )
Thus, all conditions of Corollary 1 are satisfied, and hence, C O F I X { S , T } ϕ . ☐
Corollary 4.
Let ( X G , d G ) be complete and T : X G C B ( X G ) satisfy the following:
(4.1) 
There exists x G 0 , x G 1 X G , such that x G 1 T x G 0 and ( x G 0 , x G 1 ) E ( G ) ;
(4.2) 
For any u T x G , there exists w T y G , such that ( u , w ) E ( G ) ;
(4.3) 
E ( G ) satisfies the transitivity property;
(4.4) 
ψ ( H ( T x G , T y G ) ) ψ ( d G ( x G , y G ) ) ϕ ( d G ( x G , y G ) )
where ψ Ψ * , ϕ Φ * . Then, F I X { T } ϕ .
Proof. 
Take S = T in Corollary 1. ☐
Corollary 5.
Let ( X G , d G ) be complete and T : X G C B ( X G ) satisfy conditions (4.1)–(4.3), and the following:
(5.1)  ψ ( H ( T x G , T y G ) ) θ ( d G ( x G , y G ) ) ψ ( d G ( x G , y G ) )
where ψ Ψ * , θ Θ * . Then, F I X { T } ϕ .
Proof. 
Take F ( r , t ) = θ ( t ) . r in Corollary 2. ☐
Example 1.
Let X G = { 0 , 1 2 n : n N } , d G ( x G , y G ) = | x G y G | , G = ( V , E ) , with V ( G ) = X G and E ( G ) = { ( 0 , 0 ) , ( 1 2 n , 1 2 n ) , ( 1 2 n , 0 ) } and S , T : X G C B ( X G ) be defined by
S x G = { 0 } , i f x G = 0 { 1 2 n + 1 , 0 } , i f x G = 1 2 n .
and
T x G = { 0 } , i f x G = 0 { 1 2 n + 2 , 0 } , i f x G = 1 2 n .
Define ψ , ϕ : [ 0 , ) [ 0 , ) by ψ ( t ) = 2 t + 1 and ϕ ( t ) = t 4 for all t [ 0 , ) . Clearly, ψ ( t ) Ψ * (note that ψ Ψ ) and ϕ ( t ) Φ * .
  • If x G = 1 2 n and y G = 0 with ( 1 2 n , 0 ) E ( G ) , then S x G = { 1 2 n + 1 , 0 } , S y = { 0 } , T x G = { 1 2 n + 2 , 0 } , T y G = { 0 } , d G ( x G , y G ) = 1 2 n , H ( S x G , T y G ) = 1 2 n + 1 , ψ ( H ( S x G , T y G ) ) = 1 2 n + 1 , M ( x G , y G ) = 1 2 n , ψ ( M ( x G , y G ) ) = 1 2 n 1 + 1 , ϕ ( M ( x G , y G ) ) = 1 2 n + 2 and
    ψ ( H ( S x G , T y G ) ) = 1 2 n + 1 < 1 2 n 1 + 1 1 2 n + 2 = ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) for all n N .
    Also, for 1 2 n + 1 S x G , there exists 0 T y G , such that ( 1 2 n + 1 , 0 ) E ( G ) and for 0 S x G , there exists 0 T y G such that ( 0 , 0 ) E ( G ) .
    For 1 2 n + 2 T x G , there exists 0 S y G such that ( 1 2 n + 2 , 0 ) E ( G ) and for 0 T x G , there exists 0 S y G such that ( 0 , 0 ) E ( G ) .
  • If x G = 0 , y G = 0 with ( 0 , 0 ) E ( G ) , then S x G = { 0 } = S y G = T x G = T y G , 0 = d G ( x G , y G ) = H ( S x G , T y G ) = M ( x G , y G ) , ψ ( H ( S x G , T y G ) ) = ψ ( M ( x G , y G ) ) = 1 , ϕ ( M ( x G , y G ) ) = 0 and
    ψ ( H ( S x G , T y G ) ) = 1 = ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) .
    Also, for 0 S x G , there exists 0 T y G such that ( 0 , 0 ) E ( G ) and for 0 S x G , there exists 0 T y G , such that ( 0 , 0 ) E ( G ) .
    For 0 T x G , there exists 0 S y G , such that ( 0 , 0 ) E ( G ) and for 0 T x G , there exists 0 S y G , such that ( 0 , 0 ) E ( G )
  • Also, if x G = 1 2 n , y G = 1 2 n with ( 1 2 n , 1 2 n ) E ( G ) , then S x G = { 1 2 n + 1 , 0 } = S y G , T x G = { 1 2 n + 2 , 0 } = T y G , d G ( x G , y G ) = 0 , H ( S x G , T y G ) = 1 2 n + 2 , ψ ( H ( S x G , T y G ) ) = 1 2 n + 1 + 1 , M ( x G , y G ) = 1 2 n + 1 , ψ ( M ( x G , y G ) ) = 1 2 n + 1 , ϕ ( M ( x G , y G ) ) = 1 2 n + 3 and
    ψ ( H ( S x G , T y G ) ) = 1 2 n + 1 + 1 < 1 2 n + 1 1 2 n + 3 = ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) for all n N .
    Also, for 1 2 n + 1 S x G , there exists 0 T y G , such that ( 1 2 n + 1 , 0 ) E ( G ) and for 0 S x G , there exists 0 T y G , such that ( 0 , 0 ) E ( G ) .
    For 1 2 n + 2 T x G , there exists 0 S y G , such that ( 1 2 n + 2 , 0 ) E ( G ) and for 0 T x G , there exists 0 S y G , such that ( 0 , 0 ) E ( G ) .
Thus, we see that for all x G , y G X G with ( x G , y G ) E ( G )
ψ ( H ( S x G , T y G ) ) ψ ( M ( x G , y G ) ) ϕ ( M ( x G , y G ) ) for all x G , y G X G .
Also, for u G S x G , there exists v G T y such that ( u G , v G ) E ( G ) and for u G T x G , there exists v G S y , such that ( u G , v G ) E ( G ) . Hence, the pair ( S , T ) ( 𝒞 , Ψ * , G ) with F ( r , t ) = r ϕ ( t ) . Thus, all conditions of Theorem 1 are satisfied, and C O F I X { S , T } = { 0 } .
Remark 1.
Corollary 3 (and hence, Corollary 1 and Theorem 1) are proper extensions and generalisations of Theorem 3.1 of [4] and Theorem 4.2 of [8].
Remark 2.
Note that in Example 1, the graph G is a directed graph and not connected, and so Theorem 3.1 of [4] cannot be applied to neither of the mappings S or T. Also note that ( 1 2 n , 1 2 n ) E ( G ) , H ( S 1 2 n , T 1 2 n ) = 1 2 n + 2 > 0 = d G ( 1 2 n , 1 2 n ) and hence a simple extension of Theorem 3.1 of [4] and Theorem 4.2 of [8] to two mappings cannot be applied. However, we see that the mappings S and T satisfy the conditions of Corollary 3, and so Corollary 3 also ensures the existence of a common fixed point of S and T.
Remark 3.
In Theorem 1, if the directed graph G is replaced with an undirected graph G with E ( G ) = E ( G ) E ( G 1 ) , then Condition (4.3) in Definition 4 can be replaced with only one inequality:
  • ψ ( H ( S x G , T y G ) ) F ( ψ ( M ( x G , y G ) ) , M ( x G , y G ) )
  • Similar arguments follow in Corollaries 1–3 also.
Definition 5.
Let f , g : X G X G . We say that the pair ( f , g ) belongs to the class of Jungck type ( 𝒞 , Ψ * , G ) contractions if
(5.1) 
f i s g e d g e p r e s e r v i n g i n G .
(5.2) 
F o r a l l x G , y G X G w i t h ( g x G , g y G ) E ( G )
ψ ( d G ( f x G , f y G ) ) F ( ψ ( M ( g x G , g y G ) ) , M ( g x G , g y G ) ) , f o r s o m e ψ Ψ * , F 𝒞
M ( g x G , g y G ) = max { d G ( g x G , g y G ) , d G ( g x G , f x G ) , d G ( g y G , f y G ) , d G ( g x G , f y G ) + d G ( g y G , f x G ) 2 } .
Let mappings f , g : X G X G be given. We will make use of the following notations:
  • X G ( f , g ) : { u X G : ( g u , f u ) E ( G ) } ,
  • C ( f , g ) : { u X G : f u = g u } is the set of all coincidence points of mappings f and g,
  • C m ( f , g ) : { u X G : f u = g u = u } is the set of all common fixed points of mappings f and (g).
  • C S ( X , d ) : Collection of all Cauchy sequences in the metric space ( X , d ) .
Lemma 1.
Let f and g satisfy the following:
(1.1) 
x G , y G C ( f , g ) i m p l i e s g x G = g y G
(2.1) 
( f , g ) i s c o m p a t i b l e
Then, C m ( f , g ) ϕ .
Proof. 
Let x G C ( f , g ) and g x G = w . Then, since (f, g) is compatible, g w = g g x G = g f x G = f g x G = f w , or in other words, w C ( f , g ) . By Lemma (1), g w = g x G = w , which, in turn, shows that w C m ( f , g ) . ☐
Theorem 2.
Let d G and d G be any two metrics defined on X G , and ( X G , d G ) is complete. Suppose f , g : X G X G satisfy the following:
(2.1) 
( f , g ) J u n g c k t y p e ( 𝒞 , Ψ * , G ) w i t h r e s p e c t t o d G
(2.2) 
g i s c o n t i n u o u s a n d g ( X G ) i s c l o s e d w i t h r e s p e c t t o d G
(2.3) 
f ( X G ) g ( X G )
(2.4) 
E ( G ) s a t i s f i e s t h e t r a n s i t i v i t y p r o p e r t y
(2.5) 
i f d G d G , t h e n f : ( X G , d G ) ( X G , d G ) i s g C a u c h y
(2.6) 
f i s G c o n t i n u o u s w i t h r e s p e c t t o d G , f a n d g a r e d G c o m p a t i b l e .
Then,
X G ( f , g ) ϕ i f f C ( f , g ) ϕ
Proof. 
Suppose that C ( f , g ) ϕ . Let u C ( f , g ) . Then, ( g u , f u ) = ( g u , g u ) Δ E ( G ) and so u X G ( f , g ) ; that is, X G ( f , g ) ϕ .
Suppose now, X G ( f , g ) ϕ . Let x G 0 , X G , such that ( g x G 0 , f x G 0 ) E ( G ) . Now, since F ( X G ) g ( X G ) , using condition (5.1) we can construct sequence { x G n } in X G , such that
g x G n = f x G n 1 , ( g x G n 1 , g x G n ) E ( G )
for all n N . It is easy to see that if M ( x G m , x G n ) = 0 for any m , n N , , then x G m , x G n C ( f , g ) and the proof is done. So we assume that for all m , n N , M ( x G m , x G n ) 0 . Then,
ψ ( d G ( g x G n + 1 , g x n + 2 ) ) = ψ ( d G ( f x G n , f x G n + 1 ) ) F ( ψ ( M ( g x G n , g x G n + 1 ) ) , M ( g x G n , g x G n + 1 ) ) < ψ ( M ( g x G n , g x G n + 1 ) )
We also have
M ( g x G n , g x G n + 1 ) = max { d G ( g x G n , g x G n + 1 ) , d G ( g x G n , f x G n ) , d G ( g x G n + 1 , f x G n + 1 ) , d G ( g x G n , f x G n + 1 ) + d G ( g x G n + 1 , f x G n ) 2 } = max d G ( g x G n , g x G n + 1 ) , d G ( g x G n + 1 , g x n + 2 ) , d G ( g x G n , g x n + 2 ) 2 max { d G ( g x G n , g x G n + 1 ) , d G ( g x G n , g x n + 2 ) }
If M ( g x G n , g x G n + 1 ) = d G ( g x G n + 1 , g x n + 2 ) , then by (15), we obtain that
ψ ( d G ( g x G n + 1 , g x n + 2 ) ) < ψ ( d G ( g x G n + 1 , g x n + 2 ) )
a contradiction. Hence,
M ( g x G n , g x G n + 1 ) = d G ( g x G n , g x G n + 1 )
Substituting in (15), we get t ψ ( d G ( g x G n + 1 , g x n + 2 ) ) < ψ ( d G ( g x G n , g x G n + 1 ) ) . So by the definition of ψ , we have
d G ( g x G n + 1 , g x n + 2 ) d G ( g x G n , g x G n + 1 ) , n N
Hence, the sequence { d G ( g x G n , g x G n + 1 ) } is non-negative and non-increasing, and thereby we can find r 0 , such that lim n d G ( g x G n , g x G n + 1 ) = r . We claim that r = 0 . Suppose, on the contrary, that r > 0 . Letting n in (15), we obtain
ψ ( r ) F ( ψ ( r ) , r ) < ψ ( r )
a contradiction. Thus,
lim n d G ( g x G n , g x G n + 1 ) = 0 .
We will show that { g x G n } C S ( X G , d G ) . Suppose { g x G n } C S ( X G , d G ) and for ϵ > 0 , k N , let n ( k ) N be the smallest integer with n ( k ) > m ( k ) k and
d G ( g x G n ( k ) , g x G m ( k ) ) ϵ d G ( g x G n ( k ) 1 , g x G m ( k ) ) < ϵ .
Then, we have
ϵ d G ( g x G m ( k ) , g x G n ( k ) ) d G ( g x G m ( k ) , g x G n ( k ) 1 ) + d G ( g x G n ( k ) 1 , g x G n ( k ) ) < ϵ + d G ( g x G n ( k ) 1 , g x G n ( k ) )
Using (16) in the above inequality, we get
lim k d G ( g x G m ( k ) , g x G n ( k ) ) = ϵ > 0 .
By condition (2.4) we get ( g x G m ( k ) , g x G n ( k ) ) E ( G ) . Thus, we have
ψ ( d G ( g x G m ( k ) + 1 , g x G n ( k ) + 1 ) ) = ψ ( d G ( f x G m ( k ) , f x G n ( k ) ) ) F ( ψ ( M ( g x G m ( k ) , g x G n ( k ) ) ) , M ( g x G m ( k ) , g x G n ( k ) ) )
where
M ( g x G m ( k ) , g x G n ( k ) ) = max { d G ( g x G m ( k ) , g x G n ( k ) ) , d G ( g x G m ( k ) , f x G m ( k ) ) , d G ( g x G n ( k ) , f x G n ( k ) ) , d G ( g x G m ( k ) , f x G n ( k ) ) + d G ( g x G n ( k ) , f x G m ( k ) ) 2 } = max { d G ( g x G m ( k ) , g x G n ( k ) ) , d G ( g x G m ( k ) , g x m ( k ) + 1 ) , d G ( g x G n ( k ) , g x n ( k ) + 1 ) , d G ( g x G m ( k ) , g x G n ( k ) + 1 ) + d G ( g x G n ( k ) , g x m ( k ) + 1 ) 2 }
Letting k , we obtain
lim k M ( g x G m ( k ) , g x G n ( k ) ) = ϵ
By inequality (17), we get
ψ ( ϵ ) < ψ ( ϵ )
a contradiction. So { g x G n } C S ( X G , d G ) .
We will show that { g x G n } C S ( X G , d G ) . If d G d G , it is trivial. Thus, suppose d G d G . Let ϵ > 0 . Since { g x G n C S ( X G , d G ) } , by condition (2.5) we see that { f x G n } C S ( X G , d G ) . Then, there exists N 0 N with
d G ( g x G n + 1 , g x m + 1 ) = d G ( f x G n , f x m ) < ϵ
whenever n , m N 0 . So { g x G n } C S ( X G , d G ) .
Since g ( X G ) is d G - closed and ( X G , d G ) is complete, there exists u G = g x G g ( X G ) , such that
lim n g x G n = lim n f x G n = u G .
By d G - compatibility of f and g, we have
lim n d G ( g f x G n , f g x G n ) = 0
Then,
d G ( g u G , f u G ) d G ( g u G , g f x G n ) + d G ( g f x G n , f g x G n ) + d G ( f g x G n , f u G )
Letting n and using (18), the continuity of g, and the G- continuity of f, it follows that d G ( g u G , f u G ) = 0 , which implies that g u G = f u G . So u G C ( f , g ) and the proof is complete. ☐
If d G = d G , we have the following
Theorem 3.
Let ( X G , d G ) be complete and f , g : X G X G satisfy the following:
(3.1) 
( f , g ) J u n g c k t y p e ( 𝒞 , Ψ * , G )
(3.2) 
g is continuous and g ( X G ) is closed
(3.3) 
F ( X G ) g ( X G )
(3.4) 
E ( G ) satisfies the transitivity property
(3.5) 
(a)  f is G-continuous and f and g are d G -compatible or
(b)   ( X G , d G , G ) has property A.
Then,
X G ( f , g ) ϕ iff C ( f , g ) ϕ .
Proof. 
Proceeding as in the proof of Theorem 2, we see that if C ( f , g ) ϕ then X G ( f , g ) ϕ and if X G ( f , g ) ϕ then { g x G n } C S ( X G , d G ) Now since g ( X G ) is closed in X G , there exists u G X G , such that
lim n g x G n = g u G = lim n f x G n .
We will show that u G C ( f , g ) . Suppose u G C ( f , g ) . Then d G ( f u G , g u G ) > 0 . Note that if M ( x G m , u G ) = 0 for any m N , , then x G m , u G C ( f , g ) and the proof is done. So we assume that for all m N , M ( x G m , u G ) 0 . If condition (3.5a) is satisfied, then proof follows from a similar argument as in Theorem 2. If condition (3.5b) is satisfied, then ( g x G n , g u ) E ( G ) for each n N . Thus, we have
d G ( g u G f u G ) d G ( g u G , f x G n ( k ) ) + d G ( f x G n ( k ) , f u G )
which implies that
d G ( g u G , f u G ) d G ( g u G , f x G n ( k ) ) d G ( f x G n ( k ) , f u G )
Since ψ is non-decreasing, we get
ψ ( d G ( g u G , f u G ) d G ( g u G , f x G n ( k ) ) ) ψ ( d G ( f x G n ( k ) , f u G ) ) F ( ψ ( M ( g x G n ( k ) , g u G ) ) , M ( g x G n ( k ) , g u G ) )
where
M ( g x G n ( k ) , g u G ) = max { d G ( g x G n ( k ) , g u G ) , d G ( g x G n ( k ) , f x G n ( k ) ) , d G ( g u G , f u G ) , d G ( g x G n ( k ) , f u G ) + d G ( g u G , f x G n ( k ) ) ) 2 }
Using (19), we obtain
lim k M ( g x G n ( k ) , g u G ) = d G ( g u G , f u G ) > 0 .
Thus, taking k in (22), we get ψ ( d G ( g u G , f u G ) ) < ψ ( d G ( g u G , f u G ) ) , a contradiction. Therefore, f u G = g u G and so C ( f , g ) ϕ . ☐
Theorem 4.
Suppose f and g satisfy condition (2.1)–(2.6), condition (2.6) and the following:
(4.1) If x G , y G C ( f , g ) and g x G g y G , then ( g x G , g y G ) E ( G ) .
  If X G ( f , g ) ϕ , then C m ( f , g ) ϕ .
Proof. 
By Theorem 2 C ( f , g ) ϕ . Let x G , y G C ( f , g ) and suppose g x G g y G so that M ( g x G , g y G ) 0 . By assumption ( K ) , ( g x G , g y G ) E ( G ) , and we have
ψ ( d G ( f x G , f y G ) ) F ( ψ ( M ( g x G , g y G ) ) , M ( g x G , g y G ) ) < ψ ( M ( g x G , g y G ) ) = ψ ( d G ( f x G , f y G ) )
which is a contradiction. Therefore, g x G = g y G . Now by Lemma 1, C m ( f , g ) ϕ . ☐
Corollary 6.
Let d G and d G be any two metrics defined on X G , and ( X G , d G ) is complete. Suppose f , g : X G X G satisfy conditions (5.1) and Theorem (2.1) to Theorem (2.5), and the following: for some ψ Ψ * , ϕ Φ * and all x G , y G X G with ( g x G , g y G ) E ( G )
ψ ( d G ( f x G , f y G ) ) ψ ( M ( g x G , g y G ) ) ϕ ( M ( g x G , g y G ) )
Then,
X G ( f , g ) ϕ i f f C ( f , g ) ϕ
Corollary 7.
Let d G and d G be any two metrics defined on X G and ( X G , d G ) is complete. Suppose f , g : X G X G satisfy condition (5.1) and condition (2.1) to condition (2.5) and the following: for some ψ Ψ * , θ Θ * and all x G , y G X G with ( g x G , g y G ) E ( G )
ψ ( d G ( f x G , f y G ) ) θ ( M ( g x G , g y G ) ) ψ ( M ( g x G , g y G ) )
Then,
X G ( f , g ) ϕ i f f C ( f , g ) ϕ
Let X G = [ 0 , ) and d G , d G : X G × X G [ 0 , ) be defined by
d G ( x G , y G ) = 0 if x G = y G max x G , y G otherwise d G ( x G , y G ) = | x G y G |
Then clearly, d G d G . We define
E ( G ) = { ( x G , y G ) : x G = y G o r x G , y G [ 0 , 1 2 ] w i t h x G y G }
Consider the mappings f : X G X G and g : X G X G , defined by
f x G = 4 x G 4 , if   0 x G 1 2 2 x G 2 , if   x G > 1 2 g x G = 2 x G 2 , if   0 x G 1 2 8 x G 4 , if   x G > 1 2
for all x G X G .
Let ψ : [ 0 , ) [ 0 , ) be defined by
ψ ( t ) = 2 t
and θ : [ 0 , ) [ 0 , 1 ) be defined by
θ ( t ) = t , if   0 t 1 2 1 2 t + 1 , t > 1 2
and F 𝒞 be given by
F ( r , t ) = θ ( t ) . r
We will show that the pair ( f , g ) is a ( F , ψ , G ) contraction.
Let ( g x G , g y G ) E ( G ) . If g x G = g y G (which is possible only if x G = y G = 0 ), then f x G = g y G = 0 and so ( f x G , f y G ) E ( G ) . If ( g x G , g y G ) E ( G ) with g x G , g y G [ 0 , 1 2 ] and g x G g y G , then we obtain x G , y G [ 0 , 1 2 ] , x G y G and then x G 4 , y G 4 [ 0 , 1 2 ] , f x G = 4 x G 4 4 y G 4 = f y G , and thus ( f x G , f y ) E ( G ) . Thus, the pair ( f , g ) is g-edge preserving in G.
Now, let x G , y G X G and ( g x G , g y G ) E ( G ) . From the argument given above, if g x G = g y G , then ψ ( d G ( f x G , f y G ) ) = 0 and ( f , g ) satisfy the condition condition (5.2). If ( g x G , g y G ) E ( G ) with g x G , g y G [ 0 , 1 2 ] and g x G g y G , then
ψ ( d G ( f x G , f y G ) = 8 y G 4 2 y G 2 y G . 2 y G max { x G , y G } . 2 max { x G , y G } = θ ( d G ( x G , y G ) ) ψ ( d G ( x G , y G ) ) θ ( M ( g x G , g y G ) ) ψ ( M ( g x G , g y G ) )
and so ( f , g ) satisfy the condition condition (5.1).
We will show that g and f are d - compatible. Let { x G n } be a sequence in X G , such that
lim n g x G n = lim n f x G n = u
Note that
d ( g f x G n , f g x G n ) = 32 x G N 8 0 a s n .
Clearly, f : ( X G , d ) ( X G , d ) is G-continuous, and consequently, all the conditions of Theorem 2 are satisfied. Also note that 0 , 1 2 C ( f , g ) , g 0 g ( 1 2 ) , and ( g 0 , g ( 1 2 ) E ( G ) , and thus condition Theorem (4.1) of Theorem 4 is satisfied. Consequently, { 0 , 1 2 } X G ( f , g ) C ( f , g ) C m ( f , g ) .

3. Applications

In this section, as an application of our results, we will give some fixed point results for a pair of set valued α -admissible contraction mappings in a metric space.
Throughout this section, ( X , d ) is any metric space, S , T : X C B ( X ) two given mappings, and α : X × X [ 0 , ) .
Definition 6.
We say that the pair ( S , T ) is α-admissible if, and only if for all x , y X with α ( x , y ) 1 , the following conditions hold:
(6.1) 
For u S x , there exists v T y , such that α ( u , v ) 1 .
(6.2) 
For u T x , there exists v S y , such that α ( u , v ) 1 .
Theorem 5.
Suppose the following conditions hold:
(5.1) 
There exists x 0 , x 1 X such that x 1 T x 0 S x 0 and α ( x 0 , x 1 ) 1 ,
(5.2) 
α is a triangular function,
(5.3) 
The pair ( S , T ) is α-admissible,
(5.4) 
there exists F 𝒞 , ψ Ψ * , such that for all x , y X with α ( x , y ) 1
  • ψ ( H ( S x , T y ) ) F ( ψ ( M ( x , y ) ) , M ( x , y ) ) and
  • ψ ( H ( T x , S y ) ) F ( ψ ( M ( x , y ) ) , M ( x , y ) )
where
M ( x , y ) = max d ( x , y ) , d ( S x , x ) , d G ( T y , y ) , d ( y , S x ) + d ( x , T y ) 2
Then C O F I X { S , T } is a singleton set.
Proof. 
Consider the graph G on ( X , d ) , defined by V ( G ) = X and E ( G ) = ( x , y ) X × X : α ( x , y ) 1 ) . It is easy to see that the functions S and T satisfy all conditions of Theorem 1, and hence, C O F I X { S , T } is a singleton set. ☐
Similarly, we have the following results:
Theorem 6.
Suppose conditions Theorem (5.1), Theorem (6.1), Theorem (6.3), and the following hold:
(6.1) for all x , y X with α ( x , y ) 1
    ψ ( H ( S x , T y ) ) ψ ( M ( x , y ) ) ϕ ( M ( x , y ) ) and
    ψ ( H ( T x , S y ) ) ψ ( M ( x , y ) ) ϕ ( M ( x , y ) )
where ψ Ψ * , ϕ Φ * and M ( x , y ) is as in Theorem 5. Then C O F I X { S , T } ϕ .
Theorem 7.
Suppose conditions Theorem (5.1), Theorem (6.1), Theorem (5.3), and the following hold:
(7.1) for all x , y X with α ( x , y ) 1
    ψ ( H ( S x , T y ) ) θ ( M ( x , y ) ) ψ ( M ( x , y ) ) and
    ψ ( H ( T x , S y ) ) θ ( M ( x , y ) ) ψ ( M ( x , y ) )
where ψ Ψ * , ϕ Φ * and M ( x , y ) is as in Theorem 5. Then, C O F I X { S , T } ϕ .
Example 2.
Let X G = [ 0 , ) R , and let the metrics d G , d G : X G × X G [ 0 , ) be defined by
d G ( x G , y G ) = max x G , y G d ( x G , y G ) = L | x G y G |
for all x G , y G X G , respectively, where L is a constant real number, such that L ( 1 , ) . It is easy to see that d < d . Now, E ( G ) is given by
E ( G ) = { ( x G , y G ) : x G = y G   o r   x G , y G [ 0 , 1 ] w i t h x G y G }
Consider the mappings f : X G X G and g : X G X G defined by
f x = ln 1 + x G 2 2 , g x = x G 2
for all x G X G , respectively.
Let ψ , ϕ : [ 0 , ) [ 0 , ) be defined by
ψ ( t ) = t , i f   0 t 1 t 2 , i f   t > 1
ϕ ( t ) = t 2 2 , i f   0 t 2 1 2 , o t h e r w i s e   t > 1
Next, let ( g x , g y ) E ( G ) if x G = y G . Then, ( f x , f y ) E ( G ) , and if ( g x , g y ) E ( G ) with g x g y , then we obtain g x = x G 2 , g y = y G 2 [ 0 , 1 ] and x G 2 = g x g y = y G 2 , and we have f x = ln ( 1 + x G 2 2 ) ln ( 1 + y G 2 2 ) = f y and f x G , f y [ 0 , 1 ] . This implies that ( f x G , f y ) E ( G ) .
Since d < d , we need to prove that the function f : ( X G , d ) ( X G , d ) is a g-Cauchy sequence in X G . Let ϵ > 0 , and let { x G n } be a sequence in X G such that { g x G n } is a Cauchy sequence in ( X G , d ) . Then, there exists k N , such that for all n , m k , d G ( g x G n , g x m ) < ϵ L . Then, we have
d ( f x G n , f x m ) = L | f x G n f x m | = L ln 1 + ( x G n ) 2 2 ln 1 + ( x m ) 2 2 = L ln 1 + ( x m ) 2 2 1 + ( x G n ) 2 2 = L ln 1 + ( x m ) 2 2 ( x G n ) 2 2 ) 1 + ( x G n ) 2 2 L ln 1 + | ( x G n ) 2 2 ( x M ) 2 2 | L 2 ln ( 1 + 1 2 | ( x G n ) 2 ( x m ) 2 | ) | ( x G n ) 2 ( x m ) 2 | | ( x G n ) 2 ( x m ) 2 | < L | ( x G n ) 2 ( x m ) 2 | = L d G ( g x G n , g x m ) < L · ϵ L = ϵ .
This implies that f : ( X G , d ) ( X G , d ) is a g- Cauchy on X G .
It can easily be shown that f : ( X G , d ) ( X G , d ) is G-continuous. As a result, we will only need to prove that g and f are d -compatible. Let { x G n } be a sequence in X G , such that
lim n g x G n = lim n f x G n = u
Then, we have ln ( 1 + u / 2 ) = a and so it follows that u = 0 . Now, we have
d ( g f x G n , f g x G n ) = L ln 1 + ( x G n ) 2 2 2 ln 1 + ( x G n ) 4 2 2 0
as n . It is easy to see that there exists a point u X G , such that ( g u , f u ) E ( G ) , and thus X G ( f , g ) ϕ .
Consequently, all the conditions of Theorem 2 are satisfied.
Example 3.
Let X G = [ 0 , ) R and let the metrics d G , d G : X G × X G [ 0 , ) be defined by
d G ( x G , y G ) = max x G , y G d G ( x G , y G ) = L . max x G , y G
for all x G , y G X G and some L ( 1 , ) . Then clearly, d G < d G . We define
E ( G ) = { ( x G , y G ) : x G = y G o r x G , y G [ 0 , 1 ] w i t h x G y G }
Consider the mappings f : X G X G and g : X G X G defined by
f x G = x G 4 , i f   0 x G 1 x G 2 , i f   x G > 1 g x G = 2 x G 2 , i f   0 x G 1 2 x G 4 , i f   x G > 1
for all x G X G .
Let ψ : [ 0 , ) [ 0 , ) be defined by
ψ ( t ) = 2 t
and, θ : [ 0 , ) [ 0 , 1 ) be defined by
θ ( t ) = t , i f   0 t < 1 1 t + 1 , t 1
Next, if ( g x G , g y G ) E ( G ) and x G = y G then ( f x G , f y G ) E ( G ) and if ( g x G , g y G ) E ( G ) with g x G g y G , then we obtain x G , y G [ 0 , 1 2 , x G y G and then x G 4 , y G 4 [ 0 , 1 4 , f x G = x G 4 y G 4 = f y G , and thus ( f x G , f y ) E ( G ) .
Since d G < d G , we need to prove that the function f : ( X G , d ) ( X G , d ) is a g-Cauchy sequence in X G . Let ϵ > 0 , and let { x G n } be a sequence in X G such that { g x G n } is a Cauchy sequence in ( X G , d ) . Then, there exists k N such that, for all n , m k , d G ( g x G n , g x m ) < ϵ L . Then, we have
d G ( f x G n , f x G m ) = L max f x G n , f x G m
We will consider the following cases:
Case 1: x G n , x G m [ 0 , 1 ] . Then, we have
d G ( f x G n , f x m ) = L max x G n 4 , x G m 4 L max 2 x G n 2 , 2 x G m 2
= L max g x G n , g x G m = L . d G ( g x G n , g x G m ) < L . ϵ L = ϵ
Case 2: x G n , x G m ( 0 , . Then, we have
d G ( f x G n , f x m ) = L max x G n 2 , x G m 2 L max 2 x G n 4 , 2 x G m 4
= L max g x G n , g x G m = L . d G ( g x G n , g x G m ) < L . ϵ L = ϵ
Case 3: x G n [ 0 , 1 ] , x G m ( 1 , ) . Then, we have
d G ( f x G n , f x m ) = L max x G n 4 , x G m 2 L max 2 x G n 2 , 2 x G m 4
= L max g x G n , g x G m = L . d G ( g x G n , g x G m ) < L . ϵ L = ϵ
Case 1: x G n ( 0 , ) , x G n [ 0 , 1 ] . Then, we have
d G ( f x G n , f x m ) = L max x G n 2 , x G m 4 L max 2 x G n 4 , 2 x G m 2
= L max g x G n , g x G m = L . d G ( g x G n , g x G m ) < L . ϵ L = ϵ
Thus, f : ( X G , d ) ( X G , d ) is a g-Cauchy on X G .
It can be easily shown that f : ( X G , d ) ( X G , d ) is G-continuous. We will show that g and f are d compatible. Let { x G n } be a sequence in X G , such that
lim n g x G n = lim n f x G n = u
Then, we have ln ( 1 + u / 2 ) = a , and so it follows that u = 0 . Now, we have
d ( g f x G n , f g x G n ) = L ln 1 + ( x G n ) 2 2 2 ln 1 + ( x G n ) 4 2 2 0
as n . It is easy to see that there exists a point u X G such that ( g u , f u ) E ( G ) , and thus X G ( f , g ) ϕ .
Consequently, all the conditions of Theorem 2 are satisfied.

Author Contributions

The authors contributed equally to the research.

Funding

This research received no external funding.

Acknowledgments

This research is supported by Deanship of Scientific Research at Prince Sattam bin Abdulaziz University, Al kharj, Kingdom of Saudi Arabia. The authors are thankful to the anonymous reviewers for their valuable suggestions which helped in improving this paper to its present form.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ran, A.C.M.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132, 1435–1443. [Google Scholar] [CrossRef]
  2. Nieto, J.J.; Rodríguez, L. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22, 223–239. [Google Scholar] [CrossRef]
  3. 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]
  4. Beg, I.; Butt, A.R.; Radojevic, S. The contraction principle for set valued mappings on a metric space with a graph. Comput. Math. Appl. 2010, 60, 1214–1219. [Google Scholar] [CrossRef] [Green Version]
  5. Alfuraidan, M.R. Remarks on monotone multivalued mappings on a metric spaces with a graph. J. Inequal. Appl. 2015, 2015, 202. [Google Scholar] [CrossRef]
  6. Bojor, F. Fixed point theorems for Reich type contractios on metric spaces with graph. Nonlinear Anal. 2012, 75, 3895–3901. [Google Scholar] [CrossRef]
  7. Hanjing, A.; Suantai, S. Coincidence point and fixed point theorems for a new type of G-contraction multivalued mappings on a metric space endowedwith a graph. Fixed Point Theory Appl. 2015, 2015, 171. [Google Scholar] [CrossRef]
  8. Nicolae, A.; O’Regan, D.; Petrusel, A. Fixed point theorems for single-valued and multi-valued generalized contractions in metric spaces endowed with a graph. Georgian Math. J. 2011, 18, 307–327. [Google Scholar]
  9. Mohanta, S.; Patra, S. Coincidence Points and Common Fixed points for Hybrid Pair of Mappings in b-metric spaces Endowed with a Graph. J. Linear Topol. Algebra 2017, 6, 301–321. [Google Scholar]
  10. Phon-on, A.; Sama-Ae Makaje, N.; Riyapan, P.; Busaman, S. Coincidence point theorems for weak graph preserving multi-valued mapping. Fixed Point Theory Appl. 2014, 2014, 248. [Google Scholar] [CrossRef] [Green Version]
  11. Sauntai, S.; Charoensawan, P.; Lampert, T.A. Common Coupled Fixed Point Theorems for θ-ψ-Contraction mappings Endowed with a Directed Graph. Fixed Point Theory Appl. 2015, 2015, 224. [Google Scholar] [CrossRef]
  12. Sultana, A.; Vetrivel, V. Fixed points of Mizoguchi-Takahashi contraction on a metric space with a graph and applications. J. Math. Anal. Appl. 2014, 417, 336–344. [Google Scholar] [CrossRef]
  13. Dinevari, T.; Frigon, M. Fixed point results for multivalued contractions on a metric space with a graph. J. Math. Anal. Appl. 2013, 405, 507–517. [Google Scholar] [CrossRef]
  14. Tiammee, J.; Suantai, S. Coincidence point theorems for graph-preserving multi-valued mappings. Fixed Point Theory Appl. 2014, 2014, 70. [Google Scholar] [CrossRef] [Green Version]
  15. Geraghty, M.A. On Contractive Mappings. Proc. Am. Math. Soc. 1973, 40, 604–608. [Google Scholar] [CrossRef]
  16. Charoensawan, P.; Atiponrat, W. Common Fixed Point and Coupled Coincidence Point Theorems for Gerathy’s Type Contraction Mapping with Two Metrics Endowed with Directed Graph. Hindawi J. Math. 2017, 2017, 9. [Google Scholar] [CrossRef]
  17. Doric, D. Common Fixed Point for Generalized (ψ-φ) Contractions. Appl. Math. Lett. 2009, 3, 1896–1900. [Google Scholar] [CrossRef]
  18. Khan, M.S.; Swaleh, M.; Sessa, S. Fixed Point Theorems by Altering Distances Between the Points. Bull. Aust. Math. Soc. 1984, 30, 1–9. [Google Scholar] [CrossRef]
  19. Ansari, A.H. Note on φ-ψ -contractive type mappings and related fixed point. In The 2nd Regional Conference on Mathematics and Applications; Payame Noor University: Tehran, Iran, 2014; pp. 377–380. [Google Scholar]
  20. Samet, B.; Vetro, C.; Vetro, P. Fixed point theorems for α-ψcontractive mappings. Nonlinear Anal. 2012, 75, 2154–2165. [Google Scholar] [CrossRef]
  21. Reny, G.; Rajagopalan, R.; Hossam, A.N.; Stojan, R. Dislocated cone metric space over Banach algebra and α-quasi contraction mappings of Perov type. Fixed Point Theory Appl. 2017, 2017, 24. [Google Scholar] [CrossRef]
  22. De La Sen, M.; Roldan, A.F. Some results on best proximity points of cyclic alpha-psi contractions in Menger probabilistic metric spaces. Math. Sci. 2017, 11, 95–111. [Google Scholar] [CrossRef] [Green Version]
  23. Abbas, M.; Iqbal, H.; De La Sen, M. Common fixed points of (α, η)-(θ, F) rational contractions with applications. J. Math. 2019, 7, 392. [Google Scholar] [CrossRef]
  24. Hasanzade Asl, J.; Rezapoue, S.; Shahzad, N. On fixed points of α-ψ contractive multifunctions. Fixed Point Theory Appl. 2012, 2012, 212. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

George, R.; Tamrakar, E.; Vujaković, J.; Pathak, H.K.; Velusamy, S. (C , Ψ * , G ) Class of Contractions and Fixed Points in a Metric Space Endowed with a Graph. Mathematics 2019, 7, 482. https://doi.org/10.3390/math7050482

AMA Style

George R, Tamrakar E, Vujaković J, Pathak HK, Velusamy S. (C , Ψ * , G ) Class of Contractions and Fixed Points in a Metric Space Endowed with a Graph. Mathematics. 2019; 7(5):482. https://doi.org/10.3390/math7050482

Chicago/Turabian Style

George, Reny, Ekta Tamrakar, Jelena Vujaković, Hemant Kumar Pathak, and Selvavinayagam Velusamy. 2019. "(C , Ψ * , G ) Class of Contractions and Fixed Points in a Metric Space Endowed with a Graph" Mathematics 7, no. 5: 482. https://doi.org/10.3390/math7050482

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