Next Article in Journal
Nonlinear Gronwall–Bellman Type Inequalities and Their Applications
Previous Article in Journal
Emergence of an Aperiodic Dirichlet Space from the Tetrahedral Units of an Icosahedral Internal Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Coincidence Points of a Sequence of Multivalued Mappings in Metric Space with a Graph

by
Muhammad Nouman Aslam Khan
1,2,†,
Akbar Azam
2,† and
Nayyar Mehmood
3,*,†
1
School of Chemical and Materials Engineering, National University of Sciences and Technology, H-12, Islamabad 44000, Pakistan
2
Department of Mathematics, COMSATS Institute of Information Technology, Chak Shahzad, Islamabad 44000, Pakistan
3
Department of Mathematics and Statistics, International Islamic University, H-10, Islamabad 44000, Pakistan
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2017, 5(2), 30; https://doi.org/10.3390/math5020030
Submission received: 24 March 2017 / Revised: 7 May 2017 / Accepted: 22 May 2017 / Published: 26 May 2017

Abstract

:
In this article the coincidence points of a self map and a sequence of multivalued maps are found in the settings of complete metric space endowed with a graph. A novel result of Asrifa and Vetrivel is generalized and as an application we obtain an existence theorem for a special type of fractional integral equation. Moreover, we establish a result on the convergence of successive approximation of a system of Bernstein operators on a Banach space.

1. Introduction and Preliminaries

For the metric space ( X , d ) , using the notions of Nadler [1] and Hu [2], denote C B ( X ) , C X and 2 X by the collection of nonempty closed and bounded, compact and all nonempty subsets of X respectively. Consider A , B C B ( X ) the distance between sets A and B is defined by d ( A , B ) = inf x A , y B d ( x , y ) , which does not allow to enjoy the properties of metric on C B X therefore a well known idea of Hausdorff–Pompeiu distance H on C B ( X ) induced by d is used to define a metric on C B X as follows:
H ( A , B ) = inf { ϵ > 0 : A N ( ϵ , B ) , B N ( ϵ , A ) } ,
where:
N ( ϵ , A ) = { x X : d ( x , a ) < ϵ , for some a A } .
In 1969, Nadler [1] proved fixed point results for multivalued mappings in complete metric spaces, using the Hausdorff distance H, which was the generalization of Banach contraction principle in the settings of set-valued mappings. Covitz and Nadler [3] extended the idea of multivalued mappings in the generalized metric spaces. Reich [4] in 1972 published a fixed point result for the multivalued maps on the compact subsets of a complete metric space and posed the question, “can C X be replaced by C B X ?”. In 1989, Mizoguchi and Takahashi answered this question in Theorem 5 of [5] and they also provide some Caristi type theorems for multivalued operators. Whereas Hu [2] in 1980 extended the multivalued fixed point results from complete metric space to complete ε -chainable metric space. Azam and Arshad [6] have extended the Theorem 6 of [1] by finding the fixed points of a sequence of locally contractive multivalued maps in ε -chainable metric space. Further Feng and Liu [7] used the concept of lower semi-continuity and a generalized contractive condition to extend the result of Nadler [1] and Caristi type theorems as defined in [5]. For more references the readers are referred to the work of Ciric [8], Klim and Wardowski [9,10] , Nicolae [11].
Jachymski [12] in 2007 unified and extended the work of Nieto [13] and Ran and Reuring [14] by defining a new class of contractions (G-contraction ) on metric space X , d endowed with a graph. The connectivity of the graph brings more attractions regarding a necessary and sufficient condition for any G-contractive operator to be a Picard operator.
In the present article, fascinated by [6] the existence of coincidence points of a sequence of multivalued maps with a self map are taken into account with a generalized form of G-contraction. This provides a new way to generalize many existing results in the literature (see [1,6] and the references therein).
Let us recall some definitions from graph theory with the perspective of using them in our ideas and results. For a metric space ( X , d ) let Δ be the diagonal of the Cartesian product X × X . Consider a directed graph G such that X = V ( G ) , where V ( G ) is the set of vertices of G . The set E ( G ) of edges of G contains all the loops. If G has no parallel edge then we can identify G with the pair V ( G ) , E ( G ) . Further, the graph G can be dealt with as a weighted graph if each edge is assigned by the distance between its edges.
Consider a directed graph G , then G 1 denote the graph obtained from G by reversing the direction of edges and if we ignore the direction of edges in graph G we get an undirected graph G ˜ . The pair V , E is said to be a subgraph of G if V V G and E E G and for any edge a , b E for all a , b V .
Recall some fundamental definitions regarding the connectivity of graphs, which can be found in [15].
Definition 1.
A path in G from the vertex p to q of length K, is a sequence p i of K + 1 vertices such that p 0 = p , ..., p K = q and ( p j 1 , p j ) E ( G ) for j = 1 , 2 , . . . , K .
Definition 2.
A graph G is called connected if there is a path between any two vertices. Graph G is weakly connected if G ˜ is connected.
Definition 3.
For a , b and c in V G , a G denote the equivalence class of the relation ∼ defined on V G by the rule:
b c if there is a path in G from b to c .
For v V ( G ) and K N { 0 } by [ v ] G K we denote the set
[ v ] G K : = { u V ( G ) : t h e r e i s a p a t h o f l e n g t h K f r o m v t o u } .
Following is the definition of G-contraction by Jachymski [12].
Definition 4.
[12] Let ( X , d ) be a metric space endowed with a graph G. We say that a mapping T : X X is a G-contraction if T preserves edges of G i.e.,
x , y X ( x , y ) E ( G ) ( T x , T y ) E ( G ) ,
and there exists some α [ 0 , 1 ) such that:
x , y X ( x , y ) E ( G ) d ( T x , T y ) α d ( x , y ) .
Mizoguchi and Takahashi [5] had defined a M T function as follows:
Definition 5.
[16] A function φ: [ 0 , + ) [ 0 , 1 ) is said to be a M T function if it satisfies Mizoguchi and Takahashi’s condition (i.e., lim sup r t + φ ( r ) < 1 for all t [ 0 , + ) ). Clearly, if φ: [ 0 , + ) [ 0 , 1 ) is a nondecreasing function or a nonincreasing function, then it is a M T function.
Now we state some results from the basic theory of multivalued mappings.
Lemma 1.
[17] Let ( X , d ) be a metric space and A , B C B ( X ) , with H ( A , B ) < ϵ , then for each a A , there exists an element b B such that:
d ( a , b ) < ϵ .
Lemma 2.
[18] Let ( X , d ) be a metric space and A , B C B ( X ) , then for each a A :
d ( a , B ) H ( A , B ) .
Lemma 3.
[19] Let { A n } be a sequence in C B ( X ) and there exists A C B ( X ) such that lim n H ( A n , A ) 0 . If x n A n ( n = 1 , 2 , 3 , . . . ) and there exists x X such that lim n d ( x n , x ) 0 then x A .

2. Main Results

Definition 6.
[20] A multivalued mapping F : X C B X is said to be Mizoguchi-Takahashi G-contraction if for all x , y in X , x y with x , y E G :
(i) 
H F x , F y φ d x , y d x , y ;
(ii) 
If u F x and v F y are such that d u , v d x , y , then u , v E G .
Motivated by the Definition 2.1 of [20], in a more general settings, we define the sequence of multivalued G f -contraction as follows:
Definition 7.
Let f : X X be a edge preserving surjection . A sequence of multivalued mappings { T q } q = 1 from X into C B ( X ) is said to be sequence of multivalued G f -contraction if ( f u , f v ) E ( G ) , implies:
H ( T q ( u ) , T r ( v ) ) μ ( d ( f u , f v ) ) d ( f u , f v ) , for all q , r N .
For x T q ( u ) and y T r ( v ) satisfying d ( f x , f y ) d ( f u , f v ) implies f x , f y E ( G ) , where μ: [ 0 , ) [ 0 , 1 ) is a M T -function.
The next theorem provides the way to find the coincidence of a self map and a sequence of multivalued maps.
Theorem 1.
Let ( X , d ) a complete metric space, { T q } q = 1 a sequence of multivalued G f -contraction from X into C B ( X ) and f : X X a surjection. If there exist m N and v 0 X , such that:
(i) 
T 1 ( v 0 ) [ f v 0 ] G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n T n ( v n 1 ) v n 1 G m for all n N , then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then f and sequence of mappings { T q } q = 1 have a coincidence point, i.e., there exists v * X such that f v * q N T q ( v * ) .
Proof. 
Choose any v 1 X such that f v 1 T 1 ( v 0 ) f v 0 G m then there exists a path from f v 0 to f v 1 , i.e., f v 0 = f u 0 1 , . . . f u m 1 = f v 1 T 1 ( v 0 ) , and f u i 1 , f u i + 1 1 E ( G ) for all i = 0 , 1 , 2 , . . . , m 1 .
Without any loss of generality, assume that f u k 1 f u j 1 for each k , j { 0 , 1 , 2 , . . . , m } with k j . Since ( f u 0 1 , f u 1 1 ) E ( G ) , so:
H ( T 1 ( u 0 1 ) , T 2 ( u 1 1 ) ) μ ( d ( f u 0 1 , f u 1 1 ) ) d ( f u 0 1 , f u 1 1 ) < μ ( d ( f u 0 1 , f u 1 1 ) ) d ( f u 0 1 , f u 1 1 ) < d ( f u 0 1 , f u 1 1 )
Rename f v 1 as f u 0 2 . As f u 0 2 T 1 ( u 0 1 ) , and using Lemma 1 one can find some f u 1 2 T 2 ( u 1 1 ) such that:
d ( f u 0 2 , f u 1 2 ) < d ( f u 0 1 , f u 1 1 ) .
Since ( f u 1 1 , f u 2 1 ) E ( G ) , so:
H ( T 2 ( u 1 1 ) , T 2 ( u 2 1 ) ) μ ( d ( f u 1 1 , f u 2 1 ) ) d ( f u 1 1 , f u 2 1 ) < d ( f u 1 1 , f u 2 1 ) .
Similarly since f u 1 2 T 2 ( u 1 1 ) , again using Lemma 1 one can find some f u 2 2 T 2 ( u 2 1 ) such that:
d ( f u 1 2 , f u 2 2 ) < d ( f u 1 1 , f u 2 1 ) .
Thus we obtain { f u 0 2 , f u 1 2 , f u 2 2 , , f u m 2 } of m + 1 vertices of X such that f u 0 2 T 1 ( u 0 1 ) and f u s 2 T 2 ( u s 1 ) for s = 1 , 2 , . , m , with:
d ( f u s 2 , f u s + 1 2 ) < d ( f u s 1 , f u s + 1 1 ) ,
for s = 0 , 1 , 2 , . , m 1 . As ( f u s 1 , f u s + 1 1 ) E ( G ) for all s = 0 , 1 , 2 , . , m 1 , thus ( f u s 2 , f u s + 1 2 ) E ( G ) for all s = 0 , 1 , 2 , . , m 1 .
Let f u m 2 = f v 2 . Thus the set of points f v 1 = f u 0 2 , f u 1 2 , f u 2 2 , , f u m 2 = f v 2 T 2 ( v 1 ) is a path from f v 1 to f v 2 . Rename f v 2 as f u 0 3 . Then by the same procedure we obtain a path:
f v 2 = f u 0 3 , f u 1 3 , f u 2 3 , , f u m 3 = f v 3 T 3 ( v 2 )
from f v 2 to f v 3 . Inductively, obtained:
f v h = f u 0 h + 1 , f u 1 h + 1 , f u 2 h + 1 , , f u m h + 1 = f v h + 1 T h + 1 ( v h )
with:
d ( f u t h + 1 , f u t + 1 h + 1 ) < d ( f u t h , f u t + 1 h ) ,
hence ( f u t h + 1 , f u t + 1 h + 1 ) E ( G ) for t = 0 , 1 , 2 , . , m 1 .
Consequently, construct a sequence { f v h } h = 1 of points of X with:
f v 1 = f u m 1 = f u 0 2 T 1 ( v 0 ) , f v 2 = f u m 2 = f u 0 3 T 2 ( v 1 ) , f v 3 = f u m 3 = f u 0 4 T 3 ( v 2 ) , f v h + 1 = f u m h + 1 = f u 0 h + 2 T h + 1 ( v h ) ,
for all h N .
For each t { 0 , 1 , 2 , . . . , m 1 } , and from 2 , clearly { d ( f u t h , f u t + 1 h ) } h = 1 is a decreasing sequence of non-negative real numbers and so there exists a t 0 such that:
lim h d ( f u t h , f u t + 1 h ) = a t .
By assumption, lim sup t a t + μ ( t ) < 1 , so there exists k t N such that μ ( d ( f u t h , f u t + 1 h ) ) < ω ( a t ) for all h k t where lim sup t a t + μ ( t ) < ω ( a t ) < 1 .
Now put:
Θ t = max max r = 1 , . . . , k t μ ( d ( f u t r , f u t + 1 r ) ) , ω ( a t ) .
Then, for every h > k t , consider:
d ( f u t h + 1 , f u t + 1 h + 1 ) < μ ( d ( f u t h , f u t + 1 h ) ) d ( f u t h , f u t + 1 h ) < ω ( a t ) d ( f u t h , f u t + 1 h ) Θ t d ( f u t h , f u t + 1 h ) ( Θ t ) 2 d ( f u t h 1 , f u t + 1 h 1 ) . . . ( Θ t ) h d ( f u t 1 , f u t + 1 1 ) .
Putting q = max { k t : t = 0 , 1 , 2 , . . . , m 1 } , gives:
d ( f v h , f v h + 1 ) = d ( f u 0 h + 1 , f u m h + 1 ) t = 0 m 1 d ( f u t h + 1 , f u t + 1 h + 1 ) < t = 0 m 1 ( Θ t ) h d ( f u t 1 , f u t + 1 1 ) , for all h > q .
Now for p > h > q , consider:
d ( f v h , f v p ) d ( f v h , f v h + 1 ) + d ( f v h + 1 , f v h + 2 ) + + d ( f v p 1 , f v p ) < t = 0 m 1 Θ t h d ( f u t 1 , f u t + 1 1 ) + + t = 0 m 1 Θ t p 1 d ( f u t 1 , f u t + 1 1 ) .
Since Θ t < 1 for all t { 0 , 1 , 2 , . . . , m 1 } , it follows that { f v h = f u m h } is a Cauchy sequence. Using completeness of X, find v * X such that f v h f v * . Now using the fact that f v n T v n 1 f v n 1 G m for all n N , find a subsequence f v n k of f v h such that f v n k , f v * E ( G ) for all k N . Now for any q N :
d f v * , T q ( v * ) d f v * , f v h + 1 + d f v h + 1 , T q ( v * ) d f v * , f v h + 1 + H T h + 1 ( v h ) , T q ( v * ) d f v * , f v h + 1 + μ d f v h , f v * d f v h , f v * .
Letting h in the above inequality, gives d f v * , T q ( v * ) 0 , which implies f v * T q ( v * ) for all q N . Hence, f v * q N T q ( v * ) as required.
Example 1.
Let X = 0 1 q n : n N 0 for q N . Consider the graph G such that V G = X and for all x and y in X :
E G = x , y : x y .
For q N , let T q : X C B ( X ) be defined by:
T q x = 0 , 1 q + 1 , 1 i f x = 0 , 1 q n + 1 + 1 , 1 i f x = 1 q n , n N , 1 q + 1 i f x = 1 .
If we assume f : X X as an identity map then sequence of multivalued mappings { T q } q = 1 from X into C B ( X ) is a sequence of multivalued G f -contraction.
It satisfies the conditions of Theorem 1 and 1 X is the fixed point of sequence of multivalued maps T q for q N .
The next theorem provides a way to find the coincidence point of a hybrid pair.
Theorem 2.
Let ( X , d ) be a complete metric space, T : X C B ( X ) and f : X X a surjection. If u , v X ( with u v ) such that ( f u , f v ) E ( G ) , implies:
H ( T ( u ) , T ( v ) ) μ ( d ( f u , f v ) ) d ( f u , f v ) ,
where μ : [ 0 , ) [ 0 , 1 ) is a MT-function, if there exist m N and v 0 X , such that:
(i) 
T ( v 0 ) [ f v 0 ] G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n T ( v n 1 ) v n 1 G m for all n N and j = 1 , 2 , . . . , then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then f and T have a coincidence point, i.e., there exists v * X such that f v * T ( v * ) .
Proof. 
Take T q : = T for all q N in Theorem 1 and proof is following the same procedure. ☐
Corollary 1.
Let ( X , d ) be a complete metric space, { T q } q = 1 a sequence of the self mappings on X and f : X X a surjection. If u , v X ( with u v ) such that ( f u , f v ) E ( G ) , implies:
d ( T q ( u ) , T r ( v ) ) μ ( d ( f u , f v ) ) d ( f u , f v ) ,
for all q , r N , where μ : [ 0 , ) [ 0 , 1 ) is a MT function, if there exist m N and v 0 X , such that:
(i) 
T 1 ( v 0 ) [ f v 0 ] G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n = T n ( v n 1 ) v n 1 G m for all n N ,
then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then f and sequence of mappings { T q } q = 1 have a coincidence point, i.e., there exists v * X such that f v * = q N T q ( v * ) .
Corollary 2.
Let ( X , d ) be a complete metric space, T : X C B ( X ) and if u , v X ( with u v ) such that ( u , v ) E ( G ) , implies:
H ( T ( u ) , T ( v ) ) μ ( d ( u , v ) ) d ( u , v ) ,
where μ: [ 0 , ) [ 0 , 1 ) is a MT-function, if there exist m N and v 0 X , such that:
(i) 
T ( v 0 ) v 0 G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n T ( v n 1 ) v n 1 G m for all n N and j = 1 , 2 , . . . , then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then T has a fixed point, i.e., v * = T ( v * ) .
The following are the consequence of the Theorem 1 and Theorem 2 for the case of self mappings.
Corollary 3.
Let ( X , d ) be a complete metric space, T : X X and f : X X a surjection. If u , v X ( with u v ) such that ( f u , f v ) E ( G ) , implies:
d ( T ( u ) , T ( v ) ) μ ( d ( f u , f v ) ) d ( f u , f v ) ,
where μ : [ 0 , ) [ 0 , 1 ) is a MT function, if there exist m N and v 0 X , such that:
(i) 
T ( v 0 ) [ f v 0 ] G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n = T ( v n 1 ) v n 1 G m for all n N and j = 1 , 2 , . . . , then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then f and T have a coincidence point, i.e., there exists v * X such that f v * = T ( v * ) .
Corollary 4.
Let ( X , d ) be a complete metric space, T : X X and if u , v X ( with u v ) such that ( u , v ) E ( G ) , implies:
d ( T ( u ) , T ( v ) ) μ ( d ( u , v ) ) d ( u , v ) ,
where μ : [ 0 , ) [ 0 , 1 ) is a MT-function, if there exist m N and v 0 X , such that:
(i) 
T ( v 0 ) v 0 G m ϕ ;
(ii) 
For any sequence v n in X, if v n v and v n = T ( v n 1 ) v n 1 G m for all n N and j = 1 , 2 , . . . , then there exists a subsequence v n k such that v n k , v E ( G ) for all k N .
Then T has a fixed point, i.e., v * = T ( v * ) .
The next remark highlights the applications of all the above results in settings of complete metric spaces, complete metric spaces endowed with partial order and ε -chainable complete metric spaces.
Remark 1.
Consider the following cases:
R1. 
Let X , d be a complete metric space, consider the graph G 0 with:
E G 0 = X × X .
R2. 
Let X , d be a complete metric space with partial order ⪯ on X , consider the graphs G 1 and G 2 with:
E G 1 = x , y X × X : x y ,
and:
E G 2 = x , y X × X : x y o r y x .
R3. 
Let ε > 0 and X , d be a complete ε-chainable metric space, consider the graph:
G 3 : = x , y X × X : 0 < d x , y < ε , for ε > 0 .
We remark that all above results are valid under the above construction of remarks R 1 , R 2 and R 3 .
Further, in an application of Theorem 1 we generalize the Theorem 6 of [20]. It establishes the convergence of successive approximations of operators on a Banach space, which consequently yields the Kelisky-Rivlin theorem on iterates of Bernstein operators on the space C I , where I is the closed unit interval.
Theorem 3.
Let X be a Banach space and X 0 be a closed subspace of X. Let T , f : X X be maps such that f is surjection and:
T x T y φ f x f y f x f y whenever f x f y X 0 , x y .
If I f X X 0 and f T ( X ) X 0 , then for all x X , T n x converges to C o i n T , f , where C o i n T , f = x X : T x = f x .
Proof. 
Consider the graph G = V G , E G where V G = X and E ( G ) = x , y X × X : x y X 0 . Clearly, E ( G ) , G ˜ = G and G has no parallel edges. Consider x , y E G , then f x f y = y f y x f x + ( x y ) X 0 , since I f X X 0 . Hence and by given contractive condition 9 , we see that x , y E G with x y , 6 holds. Also T x T y = f y T y f x T x + ( f x f y ) X 0 , since f T X X 0 .
The use of f T X X 0 , implies that f x , T x E G for x in X . Therefore condition i of Corollary 4 holds with x = v 0 = x 0 and N = 1 . Thus we are able to generate a sequence such that T x n 1 = f x n for all n N . Assume that T x n v * X but since f is surjection so there exists some v in X such that v * = f v . Here also T x n T x n 1 G 1 for all n N , which implies that T x n , T x n 1 E G for all n N . Now using the outline of the proof of Theorem 4 . 1 of [12], T x n , f v E G for all n N . Now assume:
f v T v f v f x n + 1 + f x n + 1 T v = f v f x n + 1 + T x n T v .
Since T x n , f v E G for all n N , thus from 9 and 10 we have:
f v T v f v f x n + 1 + φ f x n f v f x n f v .
As n , we get f v = T v . Thus v is the coincidence point of f and T , by using Corollary 4. For the uniqueness of the coincidence point we let two coincidence points u, v of f and T , then:
T u T v φ f u f v f u f v 1 φ f u f v T u T v 0 .
This implies that T u = T v .
In the next result, we discussed the generalization of fractional differential equation described in [21]. For the closed interval I = 0 , 1 , assume function g C I , R and f : I × R R is a continuous function. The fractional differential equation is given as follows:
D α x t + f t , g x t = 0 0 t 1 , α > 1
with boundary conditions x 0 = x 1 = 0 . It is to be noted that associated Green’s function with the problem 11 is:
G t , s = t 1 s α 1 t s α 1 0 s t 1 , t 1 s α 1 Γ α 0 t s 1 . ,
where Γ . represents the Gamma function.
Theorem 4.
Consider the surjective function g C I , R and f : I × R R satisfies:
(i) 
f s , g x s f s , g y s g x s g y s for all s I ;
(ii) 
sup t I 0 1 G t , s d s k < 1 .
Then, problem ( 11 ) has a unique solution.
Proof. 
Assume space X = C I , R , and we have d x , y = max t 0 , 1 x t y t for x and y in X . It is well known that x X is a solution of 11 if and only if it is a solution of the integral equation:
x t = 0 1 G t , s f s , g x s d s for all t I .
Define the operator F : X X by:
F x t = 0 1 G t , s f s , g x s d s for all t I ,
and S : X X by:
S x = g x , with S x t = g x t for t I .
Thus, for finding a solution of 11 , it is sufficient to show that F has a coincidence point with g . Now let x , y C I for all s I . Here we have:
F x t F y t = 0 1 G t , s f s , g x s f s , g y s d s 0 1 G t , s f s , g x s f s , g y s d s 0 1 G t , s g x s g y s d s 0 1 G t , s S x s S y s d s 0 1 G t , s d S x , S y d s d S x , S y sup t I 0 1 G t , s d s k d S x , S y .
This implies that for each x , y X , we have:
d F x , F y k d S x , S y .
Now the use of Corollary 3 with graph G = G 0 , we have x * X such that F x * = S x * with S x * t = g x * t for t I . Thus x * is the required coincidence point of F and g .

Author Contributions

All authors contributed equally to the writing of this paper. All authors read and approve the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nadler, B. Multivalued contraction mappings. Pacific J. Math. 1969, 30, 475–488. [Google Scholar] [CrossRef]
  2. Hu, T. Fixed point theorems for multivalued mappings. Can. Math. Bull. 1980, 23, 193–197. [Google Scholar] [CrossRef]
  3. Covitz, H.; Nadler, SB, Jr. Multi-valued contraction mappings in generalized metric spaces. Israel J. Math. 1970, 8, 5–11. [Google Scholar] [CrossRef]
  4. Reich, S. Fixed points of contractive functions. Boll. Unione Mat. Ital. 1972, 5, 26–42. [Google Scholar]
  5. Mizoguchi, N.; Takahashi, W. Fixed point theorems for multivalued mappings on complete metric spaces. J. Math. Anal. Appl. 1989, 141, 177–188. [Google Scholar] [CrossRef]
  6. Azam, A.; Arshad, M. Fixed points of a sequence of locally contractive multivalued maps. Comp. Math. Appl. 2009, 57, 96–100. [Google Scholar] [CrossRef]
  7. Feng, Y.; Liu, S. Fixed point theorems for multi-valued contractive mappings and multi-valued Caristi type mappings. J. Math. Anal. Appl. 2006, 317, 103–112. [Google Scholar] [CrossRef]
  8. Ciric, L.B. Multi-valued nonlinear contraction mappings. Nonlinear Anal. 2009, 71, 2716–2723. [Google Scholar] [CrossRef]
  9. Klim, D.; Wardowski, D. Fixed point theorems for set-valued contractions in complete metric spaces. J. Math. Anal. Appl. 2007, 334, 132–139. [Google Scholar] [CrossRef]
  10. Klim, D.; Wardowski, D. Fixed points of dynamic processes of set-valued F-contractions and application to functional equations. Fixed Point Theory Appl. 2015, 1, 22. [Google Scholar] [CrossRef]
  11. Nicolae, A. Fixed point theorems for multi-valued mappings of Feng-Liu type. Fixed Point Theory 2011, 12, 145–154. [Google Scholar]
  12. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Amer. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  13. Nieto, J.; Rodríguez-López, R. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 3, 223–239. [Google Scholar] [CrossRef]
  14. 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, 1435–1443. [Google Scholar] [CrossRef]
  15. Johnsonbaugh, R. Discrete Mathematics; Prentice-Hall, Inc.: Upper Saddle River, NJ, USA, 1997. [Google Scholar]
  16. Du, WS. On coincidence point and fixed point theorems for nonlinear multivalued maps. Topol. Appl. 2012, 159, 49–56. [Google Scholar] [CrossRef]
  17. Hu, T.; Rosen, H. Locally contractive and expansive mappings. Boll. Unione Mat. Ital. 1990, 7, 227–233. [Google Scholar]
  18. Bailey, B.F. Some theorems on contractive mappings. J. Lond. Math. Soc. 1966, 41, 101–106. [Google Scholar] [CrossRef]
  19. Assad, N.A.; Kirk, W.A. Fixed point theorems for set valued mappings of contractive type. Pacific J. Math. 1972, 43, 533–562. [Google Scholar] [CrossRef]
  20. Asrifa, S.; 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]
  21. Baleanu, D.; Shahram, R.; Hakimeh, M. Some existence results on nonlinear fractional differential equations. Philos. Trans. A Math. Phys. Eng. Sci. 2013, 371, 20120144. [Google Scholar] [CrossRef] [PubMed]

Share and Cite

MDPI and ACS Style

Khan, M.N.A.; Azam, A.; Mehmood, N. Coincidence Points of a Sequence of Multivalued Mappings in Metric Space with a Graph. Mathematics 2017, 5, 30. https://doi.org/10.3390/math5020030

AMA Style

Khan MNA, Azam A, Mehmood N. Coincidence Points of a Sequence of Multivalued Mappings in Metric Space with a Graph. Mathematics. 2017; 5(2):30. https://doi.org/10.3390/math5020030

Chicago/Turabian Style

Khan, Muhammad Nouman Aslam, Akbar Azam, and Nayyar Mehmood. 2017. "Coincidence Points of a Sequence of Multivalued Mappings in Metric Space with a Graph" Mathematics 5, no. 2: 30. https://doi.org/10.3390/math5020030

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