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  be a complete metric space and  ( an integer). Assume there are nonnegative constants  with  such thatfor all  Then, there is a unique point  such that  Furthermore, for  with  (, the sequence  converges and   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  be a complete metric space and  ( an integer). Assume that there is  such thatfor all . Then, there is a point ξ in X so that  Moreover, for arbitrary  and for   the sequence  converges and  If in addition, we have on the diagonal   for  with  then ξ is the unique element so that   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 
-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: . Consider a directed graph G where  (resp. ) is the set of vertices (resp. edges) such that ,  and G has no parallel edges, hence X is endowed with  The conversion of the graph G is . In addition,   is denoted as the undirected graph. Consider 
If , then a path in G from  to  of length  is  of  vertices so that  and  for  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  is connected.
Consider:  iff there is a directed path from  to  in   if  is contained in some directed path from  to  in  A sequence  in X is called G-termwise connected if  for each 
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  be a function such that for all ,- 1.
- ; 
- 2.
-  iff ; 
- 3.
- ; 
- 4.
-  implies . 
Here,  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  be a sequence in a graphical metric space . Then,- 1.
-  converges to  if, given  there is  so that  for each . That is,  
- 2.
-  is Cauchy sequence if, for  there is  so that  for all . That is,  
- 3.
-  is complete if every Cauchy sequence in X is convergent in  Let  be another graph with  then  is -complete if each -termwise connected Cauchy sequence in X is convergent in  
 Let 
X be a nonempty set and 
 (
 an integer). An element 
 is a fixed point of 
T if 
 Denote by Fix
 the set of all fixed points of 
T. Let 
. 
 given as 
 is called a Prešić–Picard sequence (in short, a 
-sequence) with initial values 
, (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 
 is the set of all paths 
 of 
k vertices so that 
 that is,
      
We now define -Prešić–Ćirić operators on a metric space endowed with a graph.
Definition 3. Let  be a graphical metric space and  ( an integer). Let  be a subgraph of G such that . Suppose that there is  such that, for every path  in , the following holds: Then, T is a -Prešić–Ćirić operator.
 We suppose that  is a subgraph of G so that 
Definition 4. Let  be a graphical metric space and  ( an integer). Then, the mapping T is called a -edge preserving in  if, for every path  in  such that  we have  Lemma 1. Let  be a graphical metric space, k a positive integer and  be a -Prešić–Ćirić operator. If  and T is -edge preserving in , then the -sequence  with initial values  is a -termwise connected sequence.
 Proof.  Suppose that 
, then by definition of 
, we have
        
        Now, consider the 
-sequence 
 with initial values 
. Then, we know that the value of 
 is given by 
, and so, by Label (
3), we get 
 Therefore, 
 is a path in 
. Since 
T is a 
-Prešić–Ćirić operator, we obtain by (
2) that
        
        As 
T is 
-edge preserving in 
, we obtain
        
        The above inclusion shows that 
 is a path in 
, hence, again by (
2), we obtain
        
        As 
T is 
-edge preserving in 
, we obtain
        
        By repeating the same arguments, the 
-sequence 
 with initial values 
 is a 
-termwise connected sequence. □
 We now prove the following theorem which ensures the convergence of a -sequence generated by -Prešić–Ćirić operator in a graphical metric space.
Theorem 3. Let  be a -complete graphical metric space, k a positive integer and  be a -Prešić–Ćirić operator. Suppose that:
- (I) 
- ; 
- (II) 
- T is -edge preserving in ; 
- (III) 
- if a -termwise connected -sequence  converges in  then there exist  limit of  and  such that  or  for each  
Then, for every path  in  the -sequence with initial values  is -termwise connected and converges to both ρ and  for some .
 Proof.  Since , suppose that , then by Lemma 1 the -sequence  with initial values  is a -termwise connected sequence, i.e.,  for all .
Let 
, 
 and
        
        We claim that
        
        It will be done by mathematical induction. By the definition of 
, our claim holds for 
. We now suppose the induction hypothesis:
        
        The sequence 
 is 
-termwise connected, for each 
, so 
 is a path in 
. By (
2), we obtain
        
        Using (
5), we get
        
        Hence, (
4) is proved.
We claim that 
 is Cauchy. Let 
 with 
. Since 
 is a 
-termwise connected sequence, we find from (GM4) and (
4) that
        
        As 
k is fixed and 
, we obtain from the above inequality that
        
        Hence, 
 is a 
-termwise connected Cauchy sequence. The 
-completeness of 
 yields that 
 converges to some point in 
X. Using condition (III), there is 
 and 
 so that 
 or 
 for each 
 and
        
        Suppose that 
 for all 
 (proof for the case 
 will be same). Since 
, 
 is 
-termwise connected and 
 for all 
, the following sequences
        
        are the paths of length 
 in 
. In addition, 
T is 
-Prešić–Ćirić operator; therefore,
        
        for each 
. As 
T is 
-edge preserving, we have
        
        Similarly,
        
        are the members of 
 for each 
. By (GM4), we obtain
        
        for all 
. Using (
2), we find that
        
        As 
, we find that
        
        Thus, 
 converges to both 
 and 
 □
 Theorem 3 ensures the convergence of a -sequence, but cannot ensure the existence of a fixed point of the –Prešić–Ćirić operator. In the following, we explain this fact.
Example 1. Let  where  and G and  be the graphs given as  and 
Consider  asNote that  is a G-complete graphical metric space, but it not a metric space. Choose  asNotice that T is a –Prešić–Ćirić operator with  If  with , we have  is a path of length 2, and for this path we have . Hence, 
Note that any path  of length 3 in G must be one of the following form:where . In each case, we have  Hence, T is -edge preserving. Finally, any G-termwise connected, -sequence  in X which converges to some μ, is either a constant sequence, or a subsequence of the sequence  therefore, we have at least one value of  so that (III) of Theorem 3 is verified. Note that, for each path  in  the -sequence with initial values  is G-termwise connected and is convergent to  and ; however, T has no fixed point.
 The above example suggests that to prove the existence of fixed point of a 
–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  be a graphical metric space, k a positive integer and  be a mapping. Hence, the quadruple  has property () if:Consider .  Remark 1. The property () is a k-dimensional version of the property (S) used by Shukla et al. [1]. In particular, the property () is equivalent to the property (S).  The following result provides a sufficient condition on the existence of a fixed point of a –Prešić–Ćirić operator in a graphical metric space.
Theorem 4. Suppose that all the conditions of Theorem 3 are satisfied. If, in addition,  has the property (), then T has a fixed point.
 Proof.  It follows from Theorem 3 that there exists a -sequence  with initial values  and  such that  is -termwise connected and is convergent to both  and . As , we have , hence by the property (), we get  Thus,  is a fixed point of T. □
 Example 2. Consider  and G given by  andLet . Take  asThen,  is a G-complete graphical metric space. Put . Take  asThen, T is a –Prešić–Ćirić operator with  All conditions of Theorem 4 are fulfilled, and so, by Theorem 4, T must have a fixed point. Indeed, Fix T is not a G-Prešić operator (in the sense of Shukla and Shahzad [27]) with respect to the usual metric defined on   The fixed point of a –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,  is weakly connected (as a subgraph of ) andthen 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 
. Since 
 Fix(
T), 
 and 
 is weakly connected, we get 
 and 
 hence
        
        This contradiction proves the result. □
 Remark 2. If in Theorem 5, Fix(T) is assumed weakly connected and the followingholds instead as we have assumed, then the conclusion remains the same.  Remark 3. Let  be a metric space and . Let  be a subgraph of G such that . Then, T is called a -Prešić operator if there are  such that  and for each path  in , the following holds:Clearly, each -Prešić operator is a -Prešić-Ćirić operator. In addition, if T is a -edge preserving in , , then, since , we obtain from (GM4) thatfor all  We conclude the same when   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  be a -complete graphical metric space and  be a -Prešić operator. Assume that
- (I) 
- ; 
- (II) 
- T is -edge-preserving in ; 
- (III) 
- if a -termwise connected -sequence  is convergent in  then there is  of  and  so that  or  for each  
Then, for every path  in  the -sequence with initial values  is -termwise connected and is convergent to both ρ and , for some . If in addition,  has the property (), then T has a fixed point. Furthermore, if Fix(T) is weakly connected (a subgraph of ), then such fixed point is unique.
 Corollary 2 (Ćirić and Prešić [
8])
. Let  be a complete metric space and  be a mapping so that there is  so thatfor all . Then, there is ξ in X such that  Moreover, for arbitrary  and for    converges and . If, in addition, on the diagonal   for  with  then ξ is the unique point satisfying  Proof.  Take the graphs G and  as  where  and . 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 . Take  nonempty subsets subsets of  Then  is a cyclic representation of X with respect to T if
- 1.
-  are nonempty sets; 
- 2.
-  where  for all  
If , then  is said to be a cyclic-Prešić-Ćirić operator in the case that
- (CPC1) 
-  is a cyclic representation of Y with respect to  
- (CPC2) 
- there is  so thatfor all  (  for ). 
 The following is a generalized form of the main result of Shukla and Abbas [
23] (in view of (
7)).
Corollary 3. Let  be closed nonempty subsets of a complete metric space  and  Let  be a cyclic–Prešić–Ćirić operator, then T has a fixed point  If, in addition,and Fix then ρ is unique.  Proof.  Take the graphs 
G and 
 by 
, 
 and 
,
        
        where 
 for all 
 Since each 
 is closed, 
Y is 
-complete. The condition (CPC2) shows that 
T is a 
–Prešić–Ćirić operator, while (CPC1) ensures that 
T is 
-edge preserving in 
. Since each 
 is nonempty, 
 Furthermore, since 
, 
 has the property (
). Proposition 2.1 of [
23] shows that the condition (III) of Theorem 3 is satisfied. Hence, by Theorem 4, 
T has a fixed point 
 as the limit of a 
-termwise connected sequence, and so, by Proposition 2.1 of [
23], we have 
. Finally, if  Fix
, then Fix(
T) is weakly connected (a subgraph of 
), 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  in X is nondecreasing with respect to  if  A subset  is called well-ordered if  or  for all  The map  is said nondecreasing with respect to  if, for any finite nondecreasing sequence , we have  Such T is called an ordered Prešić–Ćirić type operator if:
- (OPC1) 
- T is nondecreasing with respect to ; 
- (OPC2) 
- there is  so thatfor all  with  
 Corollary 4. Let  be an ordered complete metric space and . Suppose that
- (A) 
- T is an ordered Prešić-Ćirić type contraction; 
- (B) 
- there are  so that ; 
- (C) 
- if a nondecreasing sequence  is convergent to  then  or . 
Then, T has a fixed point  If, in addition,then Fix is well-ordered iff ρ is unique.  Proof.  Consider graphs 
G and 
 such that 
, 
 and 
,
        
        Then, 
X is 
 complete. (OPC1) implies that 
T is a 
–Prešić–Ćirić operator and (OPC2) shows that 
T is 
-edge preserving in 
. Condition (B) ensures that 
 Since 
, 
 has the property (
). Condition (C) shows that condition (III) of Theorem 3 holds. Hence, by Theorem 4, 
T has a fixed point 
. Finally, if Fix
 is well-ordered, then Fix
 is weakly connected (a subgraph of 
,) so, from Theorem 5, the fixed point 
 is unique. If Fix(
T) is a singleton, then it is well-ordered. □