1 Introduction

Branciari [1] generalized the Banach contraction principle by proving the existence of a unique fixed point of a mapping on a complete metric space satisfying a general contractive condition of integral type. Afterwards, many authors undertook further investigations in this direction (see, e.g., [26]). Ran and Reurings [7] initiated the study of fixed points of mappings on partially ordered metric spaces. A number of interesting fixed point theorems have been obtained by different authors for this setting; see, for example, [711]. Jachymski [12] used the platform of graph theory instead of partial ordering and unified the results given by authors [7, 8, 11]. He showed that a mapping on a complete metric space still has a fixed point provided the mapping satisfies the contraction condition for pairs of points which form edges in the graph. Subsequently, Beg et al. [13] established a multivalued version of the main result of Jachymski [12]. Aydi et al. [14] studied fixed point theorems for weakly G-contraction mappings in G-metric spaces. Later on, Bojor [15] obtained some results in such settings by weakening the condition of Banach G-contractivity and introducing some new type of connectivity of a graph.

In this paper, motivated by the work of Jachymski [12] and Branciari [1], we introduce two new contraction conditions for mappings on complete metric spaces and, using these contractive conditions, obtain some fixed point theorems. Our results generalize and unify some results by the above mentioned authors.

2 Preliminaries

Let (X,) be a partially ordered set. A mapping f:XX is said to be nonincreasing if x,yX, xyf(x)f(y). A mapping f is said to be nondecreasing if x,yX, xyf(x)f(y). A mapping f from a metric space (X,d) into (X,d) is called a Picard operator (PO) [11] if f has a unique fixed point tX and lim n f n x=t for all xX. Two sequences { x n } and { y n } in a metric space (X,d) are said to be equivalent if d( x n , y n )0. Moreover, if each of them is Cauchy, then these are called Cauchy equivalent. A mapping from a metric space (X,d) into (X,d) is called orbitally continuous if for all x,yX and any sequence { k n } of positive integers, f k n xy implies f( f k n x)fy as n.

Let G=(V(G),E(G)) be a directed graph. By G 1 we denote the graph obtained from G by reversing the direction of edges, and by letter G ˜ we denote the undirected graph obtained from G by ignoring the direction of edges. It will be more convenient to treat G ˜ as a directed graph for which the set of its edges is symmetric, i.e., E( G ˜ )=E(G)E( G 1 ). If x and y are vertices in a graph G, then a path in G from x to y of length l is a sequence ( x i ) i = 0 l of l+1 vertices such that x 0 =x, x l =y and ( x i 1 , x i )E(G) for i=1,,l. A graph G is called connected if there is a path between any two vertices. G is weakly connected if G ˜ is connected. For a graph G such that E(G) is symmetric and x is a vertex in G, the subgraph G x consisting of all edges and vertices which are contained in some path beginning at x is called component of G containing x. In this case V( G x )= [ x ] G ˜ , where [ x ] G ˜ is the equivalence class of a relation R defined on V(G) by the rule: yRz if there is a path in G from y to z. Clearly, G x is connected. A graph G is known as a (C)-graph in X [16] if for any sequence { x n } in X with x n x and ( x n , x n + 1 )E(G) for nN, there exists a subsequence { x n k } of { x n } such that ( x n k ,x)E(G) for kN.

Subsequently, in this paper, X is a complete metric space with metric d, and Δ is the diagonal of the Cartesian product X×X. G is a directed graph such that the set V(G) of its vertices coincides with X, and the set E(G) of its edges contains all loops, i.e., E(G)Δ. Assume that G has no parallel edges. We may treat G as a weighted graph by assigning to each edge the distance between its vertices. A mapping f:XX is called orbitally G-continuous [12] if for all x,yX and any sequence ( k n ) n N of positive integers, f k n xy and ( f k n x, f k n + 1 x)E(G), nN imply f( f k n x)fy.

We state, for convenience, the following definition and result.

Definition 2.1 [[12], Definition 2.1]

A mapping f:XX is called a Banach G-contraction or simply a G-contraction if f preserves edges of G, i.e.,

x,yX ( ( x , y ) E ( G ) ( f x , f y ) E ( G ) ) ,
(2.1)

and f decreases weights of edges of G in the following way:

c(0,1),x,yX ( ( x , y ) E ( G ) d ( f x , f y ) c d ( x , y ) ) .
(2.2)

Let Φ denote the class of all mappings ϕ:[0,+)[0,+) which are Lebesgue integrable, summable on each compact subset of [0,+), nonnegative and for each ϵ>0, 0 ϵ ϕ(s)ds>0.

Theorem 2.2 [[1], Theorem 2.1]

Let (X,d) be a complete metric space, c(0,1), and let f:XX be a mapping such that for each x,yX,

0 d ( f x , f y ) ϕ(s)dsc 0 d ( x , y ) ϕ(s)ds,
(2.3)

where ϕΦ. Then f has a unique fixed point tX such that for each xX, lim n f n x=t.

3 Main results

We begin this section, motivated by Jachymski [12] and Branciari [1], by introducing the following definition.

Definition 3.1 A mapping f:XX is called an integral G-contraction if f preserves edges (see (2.1)) and

x,yX,(x,y)E(G)implies 0 d ( f x , f y ) ϕ(s)dsc 0 d ( x , y ) ϕ(s)ds
(3.1)

for some c(0,1) and ϕΦ.

Remark 3.2 Note that if f:XX satisfies (2.3), then f is an integral G 1 -contraction where G 1 =(X,X×X). Moreover, every Banach G-contraction is an integral G-contraction (take ϕ(x)=1), but the converse may not hold.

Proposition 3.3 Let f:XX be an integral G-contraction with contraction constant c(0,1) and ϕΦ, then:

  1. (i)

    f is both an integral G 1 -contraction and an integral G ˜ -contraction with the same contraction constant c(0,1) and ϕ.

  2. (ii)

    [ x 0 ] G ˜ is f-invariant and f | [ x 0 ] G ˜ is an integral G ˜ x 0 -contraction provided that there exists some x 0 X such that f x 0 [ x 0 ] G ˜ .

Proof (i) is a consequence of symmetry of d.

(ii) Let x [ x 0 ] G ˜ . Then there is a path x= z 0 , z 1 ,, z m = x 0 between x and x 0 in G ˜ . Since f is an integral G-contraction, then (f z i 1 ,f z i )E( G ˜ ), i=1,2,,l. Thus fx [ f x 0 ] G ˜ = [ x 0 ] G ˜ .

Suppose that (x,y)E( G ˜ x 0 ), then (fx,fy)E(G) as f is an integral G-contraction. But [ x 0 ] G ˜ is f invariant, so we conclude that (fx,fy)E( G ˜ x 0 ). Furthermore, (3.1) is satisfied automatically because G ˜ x 0 is a subgraph of G. □

Lemma 3.4 Let f:XX be an integral G-contraction and y [ x ] G ˜ , then

lim n d ( f n x , f n y ) =0.
(3.2)

Proof Let xX and y [ x ] G ˜ , then there exists NN such that x 0 =x, x N =y and ( x i 1 , x i )E( G ˜ ) for all i=1,2,,N. By Proposition 3.3 it follows that ( f n x i 1 , f n x i )E( G ˜ ) and

0 d ( f n x i 1 , f n x i ) ϕ(s)dsc 0 d ( f n 1 x i 1 , f n 1 x i ) ϕ(s)ds
(3.3)

holds for all nN and i=0,1,2,,N. Denote d n =d( f n x i 1 , f n x i ) for all nN. If d m =0 for some mN, then it follows from (3.3) that d n =0 for all nN with n>m. Therefore, in this case, lim n d n =0. Now, assume that d n >0. We claim that { d n } is a non-increasing sequence. Otherwise, there exists n N such that d n > d n 1 . Now, using the properties of ϕ, it follows from (3.3) that

0< 0 d n 1 ϕ(s)ds 0 d n ϕ(s)dsc 0 d n 1 ϕ(s)ds.

Since, 0<c<1, this yields a contradiction. Therefore, lim n d n =r0. Let r>0, then it follows from (3.3) that

0 r ϕ ( s ) d s = lim n 0 d n ϕ ( s ) d s c lim n 0 d n 1 ϕ ( s ) d s = c 0 r ϕ ( s ) d s ,
(3.4)

which implies (1c) 0 r ϕ(s)ds0 and it further implies that 0 r ϕ(s)ds=0, a contradiction. Thus, lim n d n = lim n d( f n x i 1 , f n x i )=0, i=1,2,,N, in both cases. From the triangular inequality, we have d( f n x, f n y) i = 1 N d( f n x i 1 , f n x i ), and letting n gives lim n d( f n x, f n y)=0. □

Now we define a subclass of integral G-contractions. We call this a class of sub-integral G-contractions. Let us denote by Ω the class of all mappings ϕΦ satisfying following:

0 α + β ϕ(s)ds 0 α ϕ(s)ds+ 0 β ϕ(s)ds
(3.5)

for every α,β0. Note that every constant function ϕ(x)=k>0 belongs to the class Ω.

Example 3.5 Define ϕ 1 , ϕ 2 :[0,)[0,) by

ϕ 1 (x)= 1 x + 1 , ϕ 2 (x)= { 1 2 x , x 0 , 0 , otherwise.

It is easy to see that ϕ 1 , ϕ 2 satisfy (3.5) and thus belong to the class Ω.

Definition 3.6 We say that an integral G-contraction is a sub-integral G-contraction if ϕΩ.

Lemma 3.7 Let f:XX be a sub-integral G-contraction and y [ x ] G ˜ . Then there exists p(x,y)0 such that

0 d ( f n x , f n y ) ϕ(s)ds c n p(x,y),nN.
(3.6)

Proof Let xX and y [ x ] G ˜ , then there exists NN such that x 0 =x, x N =y and ( x i 1 , x i )E( G ˜ ) for all i=1,2,,N. Since ϕΩ, using the triangular inequality, it follows that

0 d ( f n x , f n y ) ϕ(s)ds i = 1 N 0 d ( f n x i 1 , f n x i ) ϕ(s)ds.
(3.7)

Moreover,

0 d ( f n x i 1 , f n x i ) ϕ(s)ds c n 0 d ( x i 1 , x i ) ϕ(s)ds,
(3.8)

since ( f n x i 1 , f n x i )E(G) for all i=1,2,3,,N and nN. From (3.7) and (3.8) we get

0 d ( f n x , f n y ) ϕ ( s ) d s c n i = 0 N 0 d ( x i 1 , x i ) ϕ ( s ) d s = c n p ( x , y ) ,
(3.9)

where p(x,y)= i = 0 N 0 d ( x i 1 , x i ) ϕ(s)ds. □

Definition 3.8 Let f:XX, yX and the sequence { f n y} in X be such that f n y x X with ( f n y, f n + 1 y)E(G) for nN. We say that the graph G is a ( C f )-graph if there exists a subsequence { f n k y} such that ( f n k y, x )E(G) for kN.

Obviously, every (C)-graph is a ( C f )-graph for any self-mapping f on X, but the converse may not hold as shown in the following.

Example 3.9 Let X:=[0,1] with respect to the usual metric d(x,y)=|xy|. Consider the graph G consisting of V(G):=X and E(G):={( n n + 1 , n + 1 n + 2 ):nN}{( x 2 n , x 2 n + 1 ):nN,x[0,1]}{( x 2 2 n ,0):nN,x[0,1]}. Note that G is not a (C)-graph as n n + 1 1. Define f:XX as fx= x 2 . Then G is a ( C f )-graph since f n x= x 2 n 0 for each x[0,1].

Theorem 3.10 Let f:XX be a sub-integral G-contraction. Assume that

  1. (i)

    X f :={xX:(x,fx)E(G)},

  2. (ii)

    G is a ( C f )-graph.

Then, for any z 0 X f , f | [ z 0 ] G ˜ is a Picard operator. Further, if G is weakly connected, then f is a Picard operator.

Proof Let z 0 X f , then f z 0 [ z 0 ] G ˜ . Let m>n1, using Lemma 3.7, we have

0 d ( f m z 0 , f n z 0 ) ϕ ( s ) d s 0 d ( f n z 0 , f n + 1 z 0 ) ϕ ( s ) d s + + 0 d ( f m 1 z 0 , f m z 0 ) ϕ ( s ) d s ( c n + c n + 1 + c n + 2 + + c m 1 ) p ( z 0 , f z 0 ) [ c n 1 c ] p ( z 0 , f z 0 ) 0 as  n .

It follows that { f n z 0 } is a Cauchy sequence in X. Therefore, f n z 0 tX. Let y be another element in [ z 0 ] G ˜ , then it follows from Lemma 3.4 that f n yt, too. Next, we show that t is a fixed point of f. Since f n z 0 tX and ( f n z 0 , f n + 1 z 0 )E(G) for all nN and G is a ( C f )-graph, then there exists a subsequence { f n k z 0 } of { f n z 0 } such that ( f n k z 0 ,t)E(G) for all kN. Therefore, ( z 0 ,f z 0 , f 2 z 0 ,, f n 1 z 0 ,t) is a path in G and so in G ˜ from z 0 to t, thus t [ z 0 ] G ˜ . From (3.1), we get

0 d ( f n k + 1 z 0 , f t ) ϕ(s)dsc 0 d ( f n k z 0 , t ) ϕ(s)ds,kN,

letting k, we have 0 d ( t , f t ) ϕ(s)ds=0, which implies that d(t,ft)=0. This shows that f | [ z 0 ] G ˜ is a Picard operator. Moreover, if G is weakly connected, then f is a Picard operator since [ z 0 ] G ˜ =X. □

Corollary 3.11 Let (X,d) be a complete metric space endowed with a graph G such that G is ( C f )-graph. Then the following statements are equivalent:

  1. (1)

    G is weakly connected.

  2. (2)

    Every sub-integral G-contraction f on X is a Picard operator provided that X f .

Proof (1)(2): It is immediate from Theorem 3.10.

(2)(1): On the contrary, suppose that G is not weakly connected, then G ˜ is disconnected, i.e., there exists x X such that [ x ] G ˜ and X [ x ] G ˜ . Let y X [ x ] G ˜ , we construct a self-mapping f by (as in [[12], Theorem 3.1]):

fx={ x if  x [ x ] G ˜ , y if  x X [ x ] G ˜ .

Let (x,y)E(G), then [ x ] G ˜ := [ y ] G ˜ , which implies fx=fy hence (fx,fy)E(G), since G contains all loops and further (3.1) is trivially satisfied (take ϕ(s)=1). But x and y are two fixed points of f contradicting the fact that f has a unique fixed point. □

Theorem 3.12 Let f:XX be a sub-integral G-contraction. Assume that f is orbitally G-continuous and X f :={xX:(x,fx)E(G)}. Then, for any z 0 X f and y [ z 0 ] G ˜ , lim n f n y=tX where t is a fixed point of f. Further, if G is weakly connected, then f is a Picard operator.

Proof Let z 0 X f , then the arguments used in the proof of Theorem 3.10 imply that { f n z 0 } is a Cauchy sequence. Therefore, f n z 0 tX. Since ( f n z 0 , f n + 1 z 0 )E(G) for all nN and f is orbitally G-continuous, therefore t= lim n f f n z 0 =ft. Note that if y is another element from [ z 0 ] G ˜ , then it follows from Lemma 3.4 that lim n f n y=t. Finally, if G is weakly connected, then [ z 0 ] G ˜ :=X, which yields that f is a Picard operator. □

Remark 3.13 Theorem 3.12 generalizes claims 20 & 30 of [[12], Theorem 3.3].

Theorem 3.14 Let f:XX be a sub-integral G-contraction. Assume that f is orbitally continuous and if there exists some z 0 X such that f z 0 [ z 0 ] G ˜ , then, for y [ z 0 ] G ˜ , lim n f n y=tX, where t is a fixed point of f. Further, if G is weakly connected, then f is a Picard operator.

Proof Let z 0 X be such that f z 0 [ z 0 ] G ˜ , then using the same arguments as in the proof of Theorem 3.10, { f n z 0 } is Cauchy and thus lim n f n z 0 =tX. Moreover, t= lim n f f n z 0 =ft, since f is orbitally continuous. Note that if y is another element from [ z 0 ] G ˜ , then it follows from Lemma 3.4 that lim n f n y=t. If G is weakly connected, then [ z 0 ] G ˜ :=X. This yields that f is a Picard operator. □

Remark 3.15 Theorem 3.14 generalizes claims 20 & 30 of [[12], Theorem 3.4] and thus generalizes and extends the results of Nieto and Rodrýguez-López [[8], Theorems 2.1 and 2.3], Petrusel and Rus [[11], Theorem 4.3] and Ran and Reurings [[7], Theorem 2.1].

Corollary 3.16 Let (X,d) be a complete metric space endowed with a graph G. Then the following statements are equivalent:

  1. (1)

    G is weakly connected.

  2. (2)

    Every sub-integral G-contraction f on X is a Picard operator provided that f is orbitally continuous.

Proof (1) ⇒(2) is obvious from Theorem 3.14. Note that the example constructed in Corollary 3.11 is orbitally continuous. Hence, (2) ⇒ (1). □

Remark 3.17 Corollary 3.16 generalizes claims 20 & 30 of [[12], Corollary 3.3].

Kirk et al. [17] introduced cyclic representations and cyclic contractions and they have been further investigated by many authors (see, e.g., [1820]). Let X be a nonempty set, m be a positive integer and { A i } i = 1 m be nonempty closed subsets of X and f: i = 1 m A i i = 1 m A i be an operator. Then X:= i = 1 m A i is known as a cyclic representation of X w.r.t. f if

f( A 1 ) A 2 ,,f( A m 1 ) A m ,f( A m ) A 1
(3.10)

and the operator f is known as a cyclic operator.

Theorem 3.18 Let (X,d) be a complete metric space. Let m be a positive integer, { A i } i = 1 m be nonempty closed subsets of X,Y:= i = 1 m A i and f:YY. Assume that

  1. (i)

    i = 1 m A i is a cyclic representation of Y w.r.t. f;

  2. (ii)

    there exists ϕΩ such that 0 d ( f x , f y ) ϕ(s)dsc 0 ( d ( x , y ) ) ϕ(s)ds whenever, x A i , y A i + 1 , where A m + 1 = A 1 .

Then f has a unique fixed point t i = 1 m A i and f n yt for any y i = 1 m A i .

Proof We note that (Y,d) is a complete metric space. Let us consider a graph G consisting of V(G):=Y and E(G):=Δ{(x,y)Y×Y:x A i ,y A i + 1 ;i=1,,m}. By (i) and (ii) it follows that f is a sub-integral G-contraction. Now let f n x x in Y such that ( f n x, f n + 1 x)E(G) for all n1. Then in view of (3.10), the sequence { f n x} has infinitely many terms in each A i so that one can easily extract a subsequence of { f n x} converging to x in each A i . Since A i ’s are closed, then x i = 1 m A i . Now it is easy to form a subsequence { f n k x} in some A j , j{1,,m} such that ( f n k x, x )E(G) for k1, it vindicates G is a weakly connected ( C f )-graph and thus conclusion follows from Theorem 3.10. □

Remark 3.19 Taking ϕ(s)=1, Theorem 3.18 subsumes the main result of [17].

Theorem 3.20 Let f:XX be an integral G-contraction. Assume that the following assertions hold:

  1. (i)

    there exists z 0 X f such that

    0 d ( f x , f y ) ϕ(s)dsc 0 d ( x , y ) ϕ(s)ds,x,yO( z 0 ) [ z 0 ] G ˜ ,
    (3.11)

    where O( z 0 )={ z 0 ,f z 0 , f 2 z 0 ,}.

  2. (ii)

    G is a ( C f )-graph.

Then, for any z 0 X f , f | [ z 0 ] G ˜ is a Picard operator. Furthermore, if G is weakly connected then f is a Picard operator.

Proof Let z 0 X f , then f z 0 [ z 0 ] G ˜ . Now, it follows from Proposition 3.3(ii) that O( z 0 ) [ z 0 ] G ˜ . Moreover, from Lemma 3.4 we get

lim n d ( f n z 0 , f n + 1 z 0 ) =0.
(3.12)

We claim that { f n z 0 } is Cauchy sequence. Otherwise, there exists some ϵ>0 in such a way that, for each kN, there are m k , n k N with n k > m k >k satisfying

d ( f m k z 0 , f n k z 0 ) ϵ.
(3.13)

We may choose sequences { m k }, { n k } such that corresponding to m k , natural number n k is smallest satisfying (3.13). Therefore,

ϵd ( f n k z 0 , f m k z 0 ) d ( f n k z 0 , f n k 1 z 0 ) +d ( f n k 1 z 0 , f m k z 0 ) <d ( f n k z 0 , f n k 1 z 0 ) +ϵ.

On letting k and using (3.12), we get

lim k d ( f n k z 0 , f m k z 0 ) =ϵ.
(3.14)

Moreover, using (3.12) and (3.14), it follows from

d ( f n k 1 z 0 , f m k 1 z 0 ) d ( f n k 1 z 0 , f n k z 0 ) +d ( f n k z 0 , f m k z 0 ) +d ( f m k z 0 , f m k 1 z 0 )

and

d ( f n k z 0 , f m k z 0 ) d ( f n k z 0 , f n k 1 z 0 ) +d ( f n k 1 z 0 , f m k 1 z 0 ) +d ( f m k 1 z 0 , f m k z 0 )

that

lim n d ( f n k 1 z 0 , f m k 1 z 0 ) =ϵ.
(3.15)

Since f n k 1 z 0 , f m k 1 z 0 O( z 0 ), it follows from assertion (ii) that

0 d ( f n k z 0 , f m k z 0 ) ϕ(s)dsc 0 d ( f n k 1 z 0 , f m k 1 z 0 ) ϕ(s)ds.
(3.16)

Letting k and using (3.14), (3.15), we get (1c) 0 ϵ ϕ(s)ds0. As 0<c<1, this implies that ϵ=0. Therefore, { f n z 0 } is a Cauchy sequence in X. The rest of the proof runs on the same lines as the proof of Theorem 3.10. □

Remark 3.21 Theorem 3.20 generalizes [[1], Theorem 2.1].

Remark 3.22 The conclusion of Theorem 3.20 that f is a Picard operator remains valid if we replace assertion (ii) by (ii)′ f is orbital G-continuous or (ii)″ f is orbitally continuous.

Example 3.23 Let X:=[0,1] be equipped with the usual metric d. Define f:XX, ϕ:[0,+)[0,+) by

fx={ x 1 + p x if  x = 1 n , 0 if  x 1 n andϕ(s)={ s 1 s 2 ( 1 log s ) if  s > 0 , 0 if  s = 0

for all nN and p1 is any fixed positive integer. Consider the graph G such that V(G):=X and E(G):=Δ{(0,x):xX}{( 1 n + 1 , 1 n ):nN}. We observe that (2.1) holds. Moreover, 0 τ ϕ(s)ds= τ 1 τ , so that (3.1) is equivalent to

d ( f x , f y ) 1 d ( f x , f y ) cd ( x , y ) 1 d ( x , y ) for (x,y)E(G).
(3.17)

Next we show that (3.17) is satisfied for c= 1 1 + p <1.

Case i. Let (x,x)E(G), then (3.1) is trivially satisfied.

Case ii. Let (0,x)E(G); x 1 n for nN, (3.1) is trivially satisfied. Let (0,x)E(G); x= 1 n for nN

d ( f x , f y ) 1 d ( f x , f y ) = | 1 n + p 0 | 1 | 1 n + p 0 | = 1 ( n + p ) ( n + p )
(3.18)

and

d ( x , y ) 1 d ( x , y ) = | 1 n 0 | 1 | 1 n 0 | = 1 ( n ) n .
(3.19)

From inequality (3.17) we need to show that

1 ( n + p ) ( n + p ) 1 ( 1 + p ) ( n ) n
(3.20)

or, equivalently,

[ n n + p ] n 1 ( n + p ) p 1 1 + p .

Since 1 ( n + p ) p 1 ( n + p ) < 1 ( 1 + p ) for all nN and n n + p <1, thus inequality (3.20) is satisfied.

Case iii. Let ( 1 n + 1 , 1 n )E(G) for nN, then we have

d ( f x , f y ) 1 d ( f x , f y ) = | 1 n + 1 + p 1 n + p | 1 | 1 n + 1 + p 1 n + p | = [ 1 ( n + 1 + p ) ( n + p ) ] ( n + 1 + p ) ( n + p )
(3.21)

and

d ( x , y ) 1 d ( x , y ) = | 1 n 1 n + 1 | 1 | 1 n 1 n + 1 | = [ 1 n ( n + 1 ) ] n ( n + 1 ) ,
(3.22)

so we need to show that

[ 1 ( n + 1 + p ) ( n + p ) ] ( n + 1 + p ) ( n + p ) 1 ( 1 + p ) [ 1 n ( n + 1 ) ] n ( n + 1 ) .
(3.23)

On rearranging we have

[ n ( n + 1 ) ] n ( n + 1 ) [ ( n + 1 + p ) ( n + p ) ] ( n + 1 + p ) ( n + p ) 1 ( p + 1 )

or

[ n n + p ] n ( n + 1 ) [ n + 1 n + 1 + p ] n ( n + 1 ) 1 [ ( n + 1 + p ) ( n + p ) ] ( p 2 + 2 n p + p ) 1 1 + p .

By analyzing L.H.S., we see that n n + p <1 and n + 1 n + 1 + p <1 for all nN and 1 [ ( n + 1 + p ) ( n + p ) ] ( p 2 + 2 n p + p ) < 1 [ ( n + 1 + p ) ( n + p ) ] < 1 ( n + p ) 1 ( 1 + p ) for all nN, which infers that inequality (3.23) is indeed true. Therefore, f is an integral G-contraction with contraction constant c= 1 1 + p . Note that G is a weakly connected (C)-graph and (3.11) also holds for O(0). Thus all the conditions of Theorem 3.20 are satisfied and f is a Picard operator with fixed point 0. Note that f is not a Banach G-contraction since, for ( 1 n + 1 , 1 n )E(G),

d ( f 1 n + 1 , f 1 n ) d ( 1 n + 1 , 1 n ) = | 1 n + 1 + p 1 n + p | | 1 n 1 n + 1 | 1as n.

By setting p=2 in the above example, we have

d ( f 1 2 , f 3 4 ) 1 d ( f 1 2 , f 3 4 ) = ( 1 4 ) 4 =d ( 1 2 , 3 4 ) 1 d ( 1 2 , 3 4 ) .

Therefore one cannot apply Theorem 2.2 [1].

Conclusion

The notion of an integral G-contraction not only generalizes/extends the notion of a Banach G-contraction, but it also improves the integral inequality (2.3). Whereas, the notion of a sub-integral G-contraction generalizes the notion of a Banach G-contraction, but it partially generalizes the integral inequality (2.3). Therefore, Theorem 3.10 generalizes/extends some results of Jachymski [12] and provides partial improvement to the main result of Branciari [1]. A very natural question is bound to be posed: Are the conclusions of Theorems 3.10, 3.12, 3.14 still valid for integral G-contractions? In Theorem 3.20, we have provided a partial answer to this question by imposing condition (3.11). But it remains open to investigate an affirmative answer without the crucial condition of (3.11). Furthermore, Example 3.23 invokes the generality of Theorem 3.20.