1 Introduction

Fixed point theory for nonlinear mappings is an important subject of nonlinear functional analysis. One of the basic and the most widely applied fixed point theorem in all of analysis is the ‘Banach (or Banach-Caccioppoli) contraction principle’ due to Banach [1]. This Banach contraction principle [1] is a simple and powerful result with a wide range of applications, including iterative methods for solving linear, nonlinear, differential, integral, and difference equations. Due to its applications in mathematics and other related disciplines, the Banach contraction principle has been generalized in many directions.

The existence of fixed points in ordered metric spaces has been discussed by Ran and Reurings [2]. Recently, many researchers have obtained fixed point and common fixed point results for single valued maps defined on partially ordered metric spaces (see, e.g., [3, 4]). Jachymski [5] investigated a new approach in metric fixed point theory by replacing an order structure with graph structure on a metric space. In this way, the results proved in ordered metric spaces are generalized (see for details [5] and the references therein). For further work in this direction, we refer to, e.g., [68].

In 1968, Kannan [9] proved a fixed point theorem for a map satisfying a contractive condition that did not require continuity at each point. This paper led to the genesis for a multitude of fixed point papers over the next two decades. Since then, there have been many theorems dealing with mappings satisfying various types of contractive inequalities involving linear and nonlinear expressions. For a thorough survey, we refer to [10] and the references therein. On the other hand, Branciari [11] obtained a fixed point theorem for a single valued mapping satisfying an analog of Banach’s contraction principle for an integral type inequality. Recently, Akram et al. [12] introduced a new class of contraction maps, called A-contractions, which is a proper generalization of Kannan’s mappings [9], Bianchini’s mappings [13], and Reich type mappings [14].

The theory of modular spaces was initiated by Nakano [15] in connection with the theory of ordered spaces which was further generalized by Musielak and Orlicz [16] (see also [1721]). The study of fixed point theory in the context of modular function spaces was initiated by Khamsi et al. [22] (see also [2226]). Also, some fixed point theorems have been proved for mappings satisfying contractive conditions of integral type in modular space [27, 28].

In this paper, we introduce three new classes of mappings satisfying integral type contractive conditions in the setup of modular space endowed with graphs. We study the existence, uniqueness, and iterative approximations of fixed points for such mappings. Our results extend, unify, and generalize the comparable results in [5, 11, 12].

2 Preliminaries

A mapping T from a metric space (X,d) into (X,d) is called a Picard operator (PO) if T has a unique fixed point zX and lim n T n x=z for all xX.

Define Φ = {φ: R + R + : φ is a Lebesgue integral mapping which is summable, nonnegative and satisfies 0 ϵ φ(t)dt>0, for each ϵ>0}.

Let A = {α: R + 3 R + : α is continuous and akb for some k[0,1) whenever aα(a,b,b) or aα(b,a,b) or aα(b,b,a) for all a, b}.

Let ψ: R + R + be a nondecreasing mapping which satisfies the following conditions:

( ψ 1 ) ψ(x)=0 if and only if x=0;

( ψ 2 ) for a sequence { x n } in R + , we have ψ( x n )0 if and only if x n 0 as n;

( ψ 3 ) for every x,y R + , we have ψ(x+y)ψ(x)+ψ(y).

The collection of all such mappings will be denoted by Ψ.

Define

Φ 1 = { ϕ : R + R + : ϕ  is increasing, upper semi-continuous and  ϕ ( t ) < t , t > 0 } .

Theorem 2.1 [11]

Let (X,d) be a complete metric space, η[0,1), and T:XX a mapping. Suppose that

0 d ( T x , T y ) φ(t)dtη 0 d ( x , y ) φ(t)dt

is satisfied for every x,yX, where φΦ. Then T has a unique fixed point zX and for each xX, we have lim n T n x=z.

Lemma 2.2 [29]

Let (X,d) be a metric space, φΦ, and { x n } a nonnegative sequence. Then

  1. (a)

    lim n x n =x implies that lim n 0 x n φ(t)dt= 0 x φ(t)dt;

  2. (b)

    lim n 0 x n φ(t)dt=0 if and only if lim n x n =0.

Definition 2.3 [12]

A selfmap T on a metric space X is called an A-contraction if for any x,yX and for some αA, the following condition holds:

d(Tx,Ty)α ( d ( x , y ) , d ( x , T x ) , d ( y , T y ) ) .

Now, we recall some basic facts and notations as regards modular spaces. For more details the reader may consult [16].

Definition 2.4 Let X be an arbitrary vector space. A functional ρ:X[0,] is called modular if for any arbitrary x, y in X:

(m1) ρ(x)=0 if and only if x=0;

(m2) ρ(αx)=ρ(x) for every scalar α with |α|=1;

(m3) ρ(αx+βy)ρ(x)+ρ(y) if α+β=1, α0, β0.

If (m3) is replaced by ρ(αx+βy) α s ρ(x)+ β s ρ(y) if α s + β s =1, where s(0,1], α0, β0 then we say that ρ is s-convex modular. If s=1, then ρ is called convex modular.

ρ:R[0,] defined by ρ(x)= | x | is a simple example of a modular functional.

The vector space X ρ given by

X ρ = { x X ; ρ ( λ x ) 0  as  λ 0 }

is called a modular space. In general the modular ρ is not sub-additive and therefore does not behave as a norm or a distance. One can associate to a modular an x-norm.

Remark 2.5 [28]

The following are immediate consequences of condition (m3):

(r1) if a,bR (set of all real numbers) with |a|<|b|, then ρ(ax)<ρ(bx) for all xX;

(r2) if a 1 ,, a n are nonnegative real numbers with i = 1 n a i =1, then we have

ρ ( i = 1 n a i x i ) i = 1 n ρ( x i )( x 1 ,, x n X).

Define the ρ-ball, B ρ (x,r), centered at x X ρ with radius r as

B ρ (x,r)= { h X ρ ; ρ ( x h ) r } .

A point x X ρ is called a fixed point of T: X ρ X ρ if T(x)=x.

A function modular is said to satisfy the Δ 2 -type condition if there exists K>0 such that for any x X ρ we have ρ(2x)Kρ(x). A modular ρ is said to satisfy the Δ 2 -condition if ρ(2 x n )0 as n, whenever ρ( x n )0 as n.

Definition 2.6 Let X ρ be a modular space. The sequence { x n } X ρ is said to be:

(t1) ρ-convergent to x X ρ if ρ( x n x)0 as n;

(t2) ρ-Cauchy if ρ( x n x m )0 as n and m.

X ρ is ρ-complete if any ρ-Cauchy sequence is ρ-convergent. Note that ρ-convergence does not imply ρ-Cauchy since ρ does not satisfy the triangle inequality. In fact, one can show that this will happen if and only if ρ satisfies the Δ 2 -condition.

Proposition 2.7 [30]

Let X ρ be a modular space. If a,b R + with ba, then ρ(ax)ρ(bx).

Proposition 2.8 [30]

Suppose that X ρ is a modular space, ρ satisfies the Δ 2 -condition and { x n } n N is a sequence in X ρ . If ρ(c( x n x n 1 ))0, then ρ(αl( x n x n 1 ))0, as n, where c,l,α R + with c>l and l c + 1 α =1. Now we give some basic definitions from graph theory needed in the sequel.

Throughout this paper, Δ={(x,x):xX} denotes the diagonal of X×X, where X is any nonempty set. Let G be a directed graph such that the set V(G) of its vertices coincides with X and E(G) be the set of edges of the graph such that ΔE(G). Further assume that G has no parallel edge and G is a weighted graph in the sense that each edge is assigned a distance d(x,y) between their vertices x and y and each vertex x is assigned a weight d(x,x). The graph G is identified by the pair (V(G),E(G)).

If x and y are vertices of G, then a path in G from x to y of length kN is a finite sequence { x n }, n{0,1,2,,k} of vertices such that x= x 0 ,, x k =y and ( x i 1 , x i )E(G) for i{1,2,,k}.

Recall that a graph G is connected if there is a path between any two vertices and it is weakly connected if G ˜ is connected, where G ˜ denotes the undirected graph obtained from G by ignoring the direction of edges. Denote by G 1 the graph obtained from G by reversing the direction of the edges. Thus

E ( G 1 ) = { ( x , y ) X × X : ( y , x ) E ( G ) } .
(1)

Since it is more convenient to treat G ˜ as a directed graph for which the set of its edges is symmetric, under this convention we have

E( G ˜ )=E(G)E ( G 1 ) .
(2)

Let G x be the component of G consisting of all the edges and vertices which are contained in some path in G beginning at x. If G is such that E(G) is symmetric, then for xV(G), the equivalence class [ x ] G defined on V(G) by the rule R (xRy if there is a path in G from x to y) is such that V( G x )= [ x ] G .

Definition 2.9 [[5], Definition 2.1]

A mapping T:XX is called a Banach G-contraction if and only if:

  1. (a)

    for each x, y in X with (x,y)E(G), we have (T(x),T(y))E(G), that is, T preserves edges of G;

  2. (b)

    there exists α in (0,1) such that for each x,yX with (x,y)E(G) implies

    d ( T ( x ) , T ( y ) ) αd(x,y).
    (3)

That is, T decreases weights of edges of G.

For any x,y V , (x,y) E such that V V(G), E E(G), ( V , E ) is called a subgraph of G.

3 Main results

In this section, we obtain several fixed point results in the setup of a modular space endowed with a graph. We start with the following definitions. Let X ρ be a modular space endowed with a graph G and let T: X ρ X ρ be a mapping. Denote

X T = { x X : ( x , T x ) E ( G ) } .

Definition 3.1 Let { T n x} be a sequence, there exists C>0 such that

ρ ( C ( T n x x ) ) 0for  x X ρ

and

( T n x , T n + 1 x ) E(G)for all nN.

Then a graph G is called a C ρ -graph if there exists a subsequence { T n p x} of { T n x} such that ( T n p x, x )E(G) for pN.

Definition 3.2 A mapping T: X ρ X ρ is called orbitally G ρ -continuous for all x,y X ρ and any sequence ( n p ) p N of positive integers, if there exists C>0 such that

ρ ( C ( T n p x y ) ) 0 , ( T n p x , T n p + 1 x ) E ( G ) imply ρ ( C ( T ( T n p x ) T ( y ) ) ) 0 ,

as p.

Definition 3.3 A mapping T is called a ( G , A ) ρ -contraction if it satisfies the following conditions:

(A1) T preserves edges of G;

(A2) there exist nonnegative numbers l, c with l<c such that

0 ρ ( c ( T x T y ) ) φ ( t ) d t α ( 0 ρ ( l ( x y ) ) φ ( t ) d t , 0 ρ ( l ( x T x ) ) φ ( t ) d t , 0 ρ ( l ( y T y ) ) φ ( t ) d t )

holds for each (x,y)E(G), and some αA and φΦ.

Remark 3.4 Let T: X ρ X ρ be a ( G , A ) ρ -contraction. If there exists x 0 X ρ such that T x 0 [ x 0 ] G ˜ , then

  1. (i)

    T is both a ( G 1 , A ) ρ -contraction and a ( G ˜ , A ) ρ -contraction,

  2. (ii)

    [ x 0 ] G ˜ is T-invariant and T | [ x 0 ] G ˜ is a ( G ˜ x 0 , A ) ρ -contraction.

Lemma 3.5 Let T: X ρ X ρ be a ( G , A ) ρ -contraction. If x X T , then there exists r(x,Tx)0 such that

0 ρ ( c ( T n x T n + 1 x ) ) φ(t)dt k n r(x,Tx)

holds for all nN, where r(x,Tx)= 0 ρ ( c ( x T x ) ) φ(t)dt.

Proof Let x X T , that is, (x,Tx)E(G). Then by induction, we have ( T n x, T n + 1 x)E(G) for all nN. Now, we have

0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t α ( 0 ρ ( l ( T n 1 x T n x ) ) φ ( t ) d t , 0 ρ ( l ( T n 1 x T n x ) ) φ ( t ) d t , 0 ρ ( l ( T n x T n + 1 x ) ) φ ( t ) d t ) α ( 0 ρ ( l ( T n 1 x T n x ) ) φ ( t ) d t , 0 ρ ( l ( T n 1 x T n x ) ) φ ( t ) d t , 0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t ) .

By the definition of α, we obtain

0 ρ ( c ( T n x T n + 1 x ) ) φ(t)dtk 0 ρ ( l ( T n 1 x T n x ) ) φ(t)dtk 0 ρ ( c ( T n 1 x T n x ) ) φ(t)dt

for some k(0,1). Thus we have

0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t k 0 ρ ( l ( T n 1 x T n x ) ) φ ( t ) d t k 0 ρ ( c ( T n 1 x T n x ) ) φ ( t ) d t k k 0 ρ ( l ( T n 2 x T n 1 x ) ) φ ( t ) d t k 2 0 ρ ( c ( T n 2 x T n 1 x ) ) φ ( t ) d t k n 0 ρ ( l ( x T x ) ) φ ( t ) k n 0 ρ ( c ( x T x ) ) φ ( t ) .

That is, 0 ρ ( c ( T n x T n 1 x ) ) φ(t)dt k n r(x,Tx) for all nN, where r(x,Tx)= 0 ρ ( c ( x T x ) ) φ(t)dt. □

Theorem 3.6 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a ( G ˜ , A ) ρ -contraction. If the set X T is nonempty, the graph G is weakly connected and a C ρ -graph, then T is a PO.

Proof If x X T , then Tx [ x ] G ˜ and ( T n x, T n + 1 x)E(G) for all nN. Let m,nN with m>n. Note that

ρ ( c m n ( T n x T m x ) ) = ρ ( c m n ( T n x T n + 1 x ) + c m n ( T n + 1 x T n + 2 x ) + + c m n ( T m 1 x T m x ) ) ρ ( c ( T n x T n + 1 x ) ) + ρ ( c ( T n + 1 x T n + 2 x ) ) + + ρ ( c ( T m 1 x T m x ) ) .

Using Lemma 3.5, we have

0 ρ ( c m n ( T n x T m x ) ) φ ( t ) d t 0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t + 0 ρ ( c ( T n + 1 x T n + 2 x ) ) φ ( t ) d t + + 0 ρ ( c ( T m 1 x T m x ) ) φ ( t ) d t k n r ( x , T x ) + k n + 1 r ( x , T x ) + + k m 1 r ( x , T x ) k n 1 k r ( x , T x ) 0 , as  n .

It follows that { c m n T n x} is a ρ-Cauchy sequence in X ρ . Since X ρ is ρ-complete, there exists a point x X ρ such that ρ( c m n ( T n x x ))0. Consequently, ρ(l( T n x x ))0.

Now we show that x is a fixed point of T. As ρ( c m n ( T n x x ))0, ( T n x, T n + 1 x)E(G) for all nN and G is a C ρ -graph, there exists a subsequence { T n p x} of { T n x} such that ( T n p x, x )E(G) for each pN. Since ( T n p x, x )E( G ˜ ) and T is a ( G ˜ , A ) ρ -contraction, it follows that

0 ρ ( c ( T n p + 1 x T x ) ) φ ( t ) d t α ( 0 ρ ( l ( T n p x x ) ) φ ( t ) d t , 0 ρ ( l ( T n p x T n p + 1 x ) ) φ ( t ) d t , 0 ρ ( l ( x T x ) ) φ ( t ) d t ) ,

which on taking the limit as p gives

0 ρ ( c ( x T x ) ) φ(t)dtα ( 0 , 0 , 0 ρ ( l ( x T x ) ) φ ( t ) d t ) α ( 0 , 0 , 0 ρ ( c ( x T x ) ) φ ( t ) d t ) .

By the definition of function α, we have

0 ρ ( c ( x T x ) ) φ(t)dtk0=0.

From Lemma 2.2, it follows that ρ(c( x T x ))=0 and T x = x .

Next, we prove that x is a unique fixed point. Suppose that T has another fixed point y X ρ { x }. Since G is a C ρ -graph, there exists a subsequence { T n p x} of { T n x} such that ( T n p x, x )E(G) and ( T n p x, y )E(G) for each pN. Furthermore, G is weakly connected, ( x , y )E( G ˜ ), and we have

0 ρ ( c ( x y ) ) φ ( t ) d t = 0 ρ ( c ( T x T y ) ) φ ( t ) d t α ( 0 ρ ( l ( x y ) ) φ ( t ) d t , 0 ρ ( l ( x T x ) ) φ ( t ) d t , 0 ρ ( l ( y T y ) ) φ ( t ) d t ) α ( 0 ρ ( l ( x y ) ) φ ( t ) d t , 0 , 0 ) α ( 0 ρ ( c ( x y ) ) φ ( t ) d t , 0 , 0 ) .

By the definition of α and Lemma 2.2, we have 0 ρ ( c ( x y ) ) φ(t)dtk0=0, ρ(c( x y ))=0, and x = y . □

In Theorem 3.6, if we replace the condition that G is a C ρ -graph with orbitally G ρ -continuity of T, then we have the following theorem.

Theorem 3.7 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a ( G ˜ , A ) ρ -contraction and orbitally G ρ -continuous. If the set X T is nonempty and the graph G is weakly connected, then T is a PO.

Proof If x X T , then Theorem 3.6 implies that { c m n T n x} is a ρ-Cauchy sequence in  X ρ . Owing to ρ-completeness of X ρ , there exists x X ρ such that ρ( c m n ( T n x x ))0. As ( T n x, T n + 1 x)E(G) for all nN and T is orbitally G ρ -continuous, we have ρ( c m n (T( T n x)T( x )))0, as n. That is, T x = x . Assume that y is another fixed point of T. Following arguments similar to those in the proof of Theorem 3.6, we obtain y = x . □

Corollary 3.8 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be edge-preserving, the set X T nonempty and graph G be weakly connected and a C ρ -graph. If there exist nonnegative numbers l, c with l<c such that

ρ ( c ( T x T y ) ) α ( ρ ( l ( x y ) ) , ρ ( l ( x T x ) ) , ρ ( l ( y T y ) ) )

holds for all (x,y)E( G ˜ ) and some αA, then T is a PO.

Now, we introduce Hardy-Rogers type ( G ) ρ -contraction and obtain related fixed point results.

Definition 3.9 Let X ρ be a modular space. A mapping T: X ρ X ρ is called a Hardy-Rogers type ( G ) ρ -contraction if the following conditions hold:

(H1) T preserves edges of G;

(H2) there exist nonnegative numbers l i , c with l i <c for i=1,,5 such that

0 ρ ( c ( T x T y ) ) φ ( t ) d t η 0 ρ ( l 1 ( x y ) ) φ ( t ) d t + β 0 [ ρ ( l 2 ( x T x ) ) + ρ ( l 3 ( y T y ) ) ] φ ( t ) d t + γ 0 [ ρ ( l 4 2 ( x T y ) ) + ρ ( l 5 2 ( y T x ) ) ] φ ( t ) d t

holds for each (x,y)E(G) with nonnegative numbers η, β, γ such that η+2β+2γ<1 and φΦ.

Remark 3.10 Let X ρ be a modular space endowed with a graph G and let T: X ρ X ρ be a Hardy-Rogers type ( G ) ρ -contraction. If there exists x 0 X ρ such that T x 0 [ x 0 ] G ˜ , then

  1. (i)

    T is both a Hardy-Rogers type ( G 1 ) ρ -contraction and a Hardy-Rogers type ( G ˜ ) ρ -contraction,

  2. (ii)

    [ x 0 ] G ˜ is T-invariant and T | [ x 0 ] G ˜ is a Hardy-Rogers type ( G ˜ x 0 ) ρ -contraction.

Theorem 3.11 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a Hardy-Rogers type ( G ˜ ) ρ -contraction. Assume that the set X T is nonempty and the C ρ -graph G is weakly connected. Then T is a PO.

Proof If x X T , then Tx [ x ] G ˜ and ( T n x, T n + 1 x)E(G) for all nN. Note that

0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t η 0 ρ ( l 1 ( T n 1 x T n x ) ) φ ( t ) d t + β 0 [ ρ ( l 2 ( T n 1 x T n x ) ) + ρ ( l 3 ( T n x T n + 1 x ) ) ] φ ( t ) d t + γ 0 [ ρ ( l 4 2 ( T n 1 x T n + 1 x ) ) + ρ ( l 5 2 ( T n x T n x ) ) ] φ ( t ) d t η 0 ρ ( c ( T n 1 x T n x ) ) φ ( t ) d t + β 0 [ ρ ( c ( T n 1 x T n x ) ) + ρ ( c ( T n x T n + 1 x ) ) ] φ ( t ) d t + γ 0 [ ρ ( c ( T n 1 x T n x ) ) + ρ ( c ( T n x T n + 1 x ) ) ] φ ( t ) d t .

It follows that

0 ρ ( c ( T n x T n + 1 x ) ) φ(t)dth 0 ρ ( c ( T n 1 x T n x ) ) φ(t)dt,

where h= η + β + γ 1 β γ <1. Also,

0 ρ ( c ( T n x T n + 1 x ) ) φ(t)dt h n 0 ρ ( c ( x T x ) ) φ(t)dt.
(4)

Taking the limit as n, and using Lemma 2.2, we get

lim n 0 ρ ( c ( T n x T n + 1 x ) ) φ(t)dt=0,

which implies that lim n ρ(c( T n x T n + 1 x))=0.

Let m,nN with m>n. By (4) and Remark 2.5, we get

0 ρ ( c m n ( T n x T m x ) ) φ ( t ) d t 0 ρ ( c ( T n x T n + 1 x ) ) φ ( t ) d t + 0 ρ ( c ( T n + 1 x T n + 2 x ) ) φ ( t ) d t + + 0 ρ ( c ( T m 1 x T m x ) ) φ ( t ) d t h n 0 ρ ( c ( x T x ) ) φ ( t ) d t + h n + 1 0 ρ ( c ( x T x ) ) φ ( t ) d t + + h m 1 0 ρ ( c ( x T x ) ) φ ( t ) d t h n 1 h 0 ρ ( c ( x T x ) ) φ ( t ) d t 0 , as  n .

Thus, { c m n T n x} is a ρ-Cauchy sequence in X ρ . Since X ρ is ρ-complete, there exists a point x X ρ such that ρ( c m n ( T n x x ))0. As G is a C ρ -graph, there exists a subsequence { T n p x} such that ( T n p x, x )E(G) for all pN. Also, ( T n p x, x )E(G) for all pN. Now we have

0 ρ ( c ( T n p + 1 x T x ) ) φ ( t ) d t η 0 ρ ( l 1 ( T n p x x ) ) φ ( t ) d t + β 0 [ ρ ( l 2 ( T n p x T n p + 1 x ) ) + ρ ( l 3 ( x T x ) ) ] φ ( t ) d t + γ 0 [ ρ ( l 4 2 ( T n p x T x ) ) + ρ ( l 5 2 ( x T n p + 1 x ) ) ] φ ( t ) d t .

Taking the limit as n, we have

0 ρ ( c ( x T x ) ) φ(t)dt(β+γ) 0 ρ ( c ( x T x ) ) φ(t)dt.

As (β+γ)<1, so ρ(c( x T x ))=0 and x =T x .

Next, we prove that x is a unique fixed point. Suppose that T has another fixed point y X ρ { x }. Since G is a C ρ -graph, there exists a subsequence { T n p x} of { T n x} such that ( T n p x, x )E(G) and ( T n p x, y )E(G) for each pN. As G is weakly connected, we have ( x , y )E( G ˜ ), and

0 ρ ( c ( x y ) ) φ ( t ) d t = 0 ρ ( c ( T x T y ) ) φ ( t ) d t η 0 ρ ( l 1 ( x y ) ) φ ( t ) d t + β 0 [ ρ ( l 2 ( x T x ) ) + ρ ( l 3 ( y T y ) ) ] φ ( t ) d t + γ 0 [ ρ ( l 4 2 ( x T y ) ) + ρ ( l 5 2 ( y T x ) ) ] φ ( t ) d t ,

which further implies that

0 ρ ( c ( x y ) ) φ(t)dt(η+2γ) 0 ρ ( c ( x y ) ) φ(t)dt.

Since (η+2γ)<1, 0 ρ ( c ( x y ) ) φ(t)dt=0. The result follows. □

In Theorem 3.11, if we replace the condition that G is a C ρ -graph with orbitally G ρ -continuity of T, then we have the following theorem.

Theorem 3.12 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a Hardy-Rogers type ( G ˜ ) ρ -contraction, which is orbitally G ρ -continuous. Assume that the set X T is nonempty and the graph G is weakly connected. Then T is a PO.

In the following suppose that X ρ is a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and T: X ρ X ρ is edge-preserving such that the set X T is nonempty.

Corollary 3.13 Assume

  1. (i)

    the C ρ -graph G is weakly connected and

  2. (ii)

    there exist nonnegative numbers l, c with l<c such that

    0 ρ ( c ( T x T y ) ) φ(t)dtη 0 ρ ( l ( x y ) ) φ(t)dt

holds for each (x,y)E( G ˜ ) with η(0,1) and φΦ. Then T is a PO.

Corollary 3.14 Assume

  1. (i)

    the C ρ -graph G is weakly connected and

  2. (ii)

    there exist nonnegative numbers l 1 , l 2 , c with l 1 , l 2 <c such that

    0 ρ ( c ( T x T y ) ) φ(t)dtβ 0 [ ρ ( l 1 ( x T x ) ) + ρ ( l 2 ( y T y ) ) ] φ(t)dt

holds for each (x,y)E( G ˜ ) with β(0, 1 2 ) and φΦ. Then T is a PO.

Corollary 3.15 Assume

  1. (i)

    the C ρ -graph G is weakly connected and

  2. (ii)

    there exist nonnegative numbers l 1 , l 2 , c with l 1 , l 2 <c such that

    0 ρ ( c ( T x T y ) ) φ(t)dtγ 0 [ ρ ( l 1 2 ( x T y ) ) + ρ ( l 2 2 ( y T x ) ) ] φ(t)dt

for each (x,y)E( G ˜ ) with γ(0, 1 2 ) and φΦ. Then T is a PO.

Now we introduce the ( G , ϕ , ψ ) ρ -contraction and obtain some fixed point results.

Definition 3.16 A mapping T: X ρ X ρ is called a ( G , ϕ , ψ ) ρ -contraction if the following conditions hold:

(Q1) T preserves edges of G;

(Q2) there exist nonnegative numbers l, c with l<c such that

0 ψ ( ρ ( c ( T x T y ) ) ) φ(t)dtϕ ( 0 ψ ( ρ ( l ( x y ) ) ) φ ( t ) d t )

holds for each (x,y)E(G), where ψΨ, ϕ Φ 1 , and φΦ.

Remark 3.17 Let T: X ρ X ρ be a ( G , ϕ , ψ ) ρ -contraction. If there exists x 0 X ρ such that T x 0 [ x 0 ] G ˜ , then

  1. (i)

    T is both a ( G 1 , ϕ , ψ ) ρ -contraction and a ( G ˜ , ϕ , ψ ) ρ -contraction,

  2. (ii)

    [ x 0 ] G ˜ is T-invariant and T | [ x 0 ] G ˜ is a ( G ˜ x 0 , ϕ , ψ ) ρ -contraction.

Theorem 3.18 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a ( G ˜ , ϕ , ψ ) ρ -contraction. If X T is nonempty and C ρ -graph G is weakly connected, then T is a PO.

Proof If x X T , then ( T n x, T n + 1 x)E(G) for all nN. First, we show that the sequence {ψ(ρ(c( T n x T n + 1 x)))} converges to 0. From Definition 3.16, we have

0 ψ ( ρ ( c ( T n x T n + 1 x ) ) ) φ ( t ) d t ϕ ( 0 ψ ( ρ ( l ( T n 1 x T n x ) ) ) φ ( t ) d t ) < 0 ψ ( ρ ( l ( T n 1 x T n x ) ) ) φ ( t ) d t < 0 ψ ( ρ ( c ( T n 1 x T n x ) ) ) φ ( t ) d t .

Thus,

{ 0 ψ ( ρ ( c ( T n x T n + 1 x ) ) ) φ ( t ) d t }

is decreasing and bounded from below and so

{ 0 ψ ( ρ ( c ( T n x T n + 1 x ) ) ) φ ( t ) d t }

converges to a nonnegative number L. If L0, we obtain

L = lim n 0 ψ ( ρ ( c ( T n x T n + 1 x ) ) ) φ ( t ) d t lim n ϕ ( 0 ψ ( ρ ( l ( T n 1 x T n x ) ) ) φ ( t ) d t ) lim n ϕ ( 0 ψ ( ρ ( c ( T n 1 x T n x ) ) ) φ ( t ) d t ) ,

that is, Lϕ(L), a contradiction. Hence 0 ψ ( ρ ( c ( T n x T n + 1 x ) ) ) φ(t)dt0 as n. It follows that ψ(ρ(c( T n x T n + 1 x)))0. Suppose that

lim n supψ ( ρ ( c ( T n x T n + 1 x ) ) ) =ε>0.

Then there exists a v ε N and a sequence { T n v x } v v ε such that

ψ ( ρ ( c ( T n v x T n v + 1 x ) ) ) ε>0,v,
(5)
ψ ( ρ ( c ( T n v x T n v + 1 x ) ) ) ε 2 ,v v ε .
(6)

Hence we get the following:

0= lim v 0 ψ ( ρ ( c ( T n v x T n v + 1 x ) ) ) φ(t)dt 0 ε 2 φ(t)dt>0.

Assume that there is an ε>0 and there exist m v , n v N such that m v > n v >v for each vN and

ψ ( ρ ( l ( T m v x T n v x ) ) ) ε.

Then we choose the sequence ( m v ) v N and ( n v ) v N such that for each vN, m v is minimal in the sense that ψ(ρ(l( T m v x T n v x)))ε but ψ(ρ(l( T s x T n v x)))<ε, for all s{ n v +1,, m v 1}. Now, let δ R + be such that l c + 1 δ =1, then we have

0 ε φ ( t ) d t 0 ψ ( ρ ( l ( T m v x T n v x ) ) ) φ ( t ) d t 0 ψ ( ρ ( c ( T m v x T n v + 1 x ) ) ) φ ( t ) d t + 0 ψ ( ρ ( δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t ϕ ( 0 ψ ( ρ ( l ( T m v 1 x T n v x ) ) ) φ ( t ) d t ) + 0 ψ ( ρ ( δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t 0 ψ ( ρ ( l ( T m v 1 x T n v x ) ) ) φ ( t ) d t + 0 ψ ( ρ ( δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t 0 ε φ ( t ) d t + 0 ψ ( ρ ( δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t .

Thus, taking the limit as v, and Proposition 2.8, we have

0 ψ ( ρ ( δ l ( T n v + 1 x T n v x ) ) ) φ(t)dt0.

Therefore,

0 ψ ( ρ ( l ( T m v x T n v x ) ) ) φ(t)dtε,v.

Now,

0 ψ ( ρ ( l ( T m v x T n v x ) ) ) φ ( t ) d t 0 ψ ( ρ ( c ( T m v + 1 x T n v + 1 x ) ) ) φ ( t ) d t + 0 ψ ( ρ ( 2 δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t + 0 ψ ( ρ ( 2 δ l ( T m v + 1 x T m v x ) ) ) φ ( t ) d t ϕ ( 0 ψ ( ρ ( l ( T m v x T n v x ) ) ) φ ( t ) d t ) + 0 ψ ( ρ ( 2 δ l ( T n v + 1 x T n v x ) ) ) φ ( t ) d t + 0 ψ ( ρ ( 2 δ l ( T m v + 1 x T m v x ) ) ) φ ( t ) d t .

If v, then we have

0 ε φ(t)dtϕ ( 0 ε φ ( t ) d t ) ,

a contradiction for ε>0. Hence, {l T n x} is a ρ-Cauchy sequence. By ρ-completeness of X ρ , there exists x X ρ such that ρ(l( T n x x ))0 as n and ( T n x, T n + 1 x)E(G) for all nN and G is a C ρ -graph, then there exists a subsequence { T n p x} such that ( T n p x, x )E(G) for each pN. Also, ( T n p x, x )E(G) for each pN. From Remark 2.5 and ( ψ 3 ), it follows that

ψ ( ρ ( c 2 ( x T x ) ) ) = ψ ( ρ ( c 2 ( x T n p + 1 x ) + c 2 ( T n p + 1 x T x ) ) ) ψ ( ρ ( c ( x T n p + 1 x ) ) + ρ ( c ( T n p + 1 x T x ) ) ) ψ ( ρ ( c ( x T n p + 1 x ) ) ) + ψ ( ρ ( c ( T n p + 1 x T x ) ) ) .

Taking the limit as p, we have

0 ψ ( ρ ( c ( T n p + 1 x T x ) ) ) φ ( t ) d t ϕ ( 0 ψ ( ρ ( l ( T n p x x ) ) ) φ ( t ) d t ) 0 ψ ( ρ ( l ( T n p x x ) ) ) φ ( t ) d t .

Since ρ(l( T n p x x ))0 (p), we obtain

lim p 0 ψ ( ρ ( l ( T n p x x ) ) ) φ(t)dt0,

which implies that ψ(ρ(c( T n p + 1 xT x )))0, as p. Thus,

ψ ( ρ ( c ( x T n p + 1 x ) ) ) +ψ ( ρ ( c ( T n p + 1 x T x ) ) ) 0,as p.

Hence lim n ψ(ρ( c 2 ( x T x )))=0 and x =T x .

Finally, we prove that x is a unique fixed point. Suppose that T has another fixed point y X ρ { x }. Since G is a C ρ -graph, there exists a subsequence { T n p x} of { T n x} such that ( T n p x, x )E(G) and ( T n p x, y )E(G) for each pN. Furthermore, as G is weakly connected, ( x , y )E( G ˜ ). We have

0 ψ ( ρ ( c ( x y ) ) ) φ ( t ) d t = 0 ψ ( ρ ( c ( T x T y ) ) ) φ ( t ) d t ϕ ( 0 ψ ( ρ ( l ( x y ) ) ) φ ( t ) d t ) < 0 ψ ( ρ ( l ( x y ) ) ) φ ( t ) d t < 0 ψ ( ρ ( c ( x y ) ) ) φ ( t ) d t ,

a contradiction. Hence, x = y . □

In Theorem 3.18, if we replace the condition that G is a C ρ -graph with orbitally G ρ -continuity of T, then we have the following theorem.

Theorem 3.19 Let X ρ be a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be a ( G ˜ , ϕ , ψ ) ρ -contraction, which is orbitally G ρ -continuous. Assume that the set X T is nonempty and the graph G is weakly connected. Then T is a PO.

In the following corollaries, suppose that X ρ is a ρ-complete modular space endowed with a graph G, where ρ satisfies the Δ 2 -condition and let T: X ρ X ρ be edge-preserving and the set X T be nonempty.

Corollary 3.20 Assume

  1. (i)

    the C ρ -graph G is weakly connected and

  2. (ii)

    there exist nonnegative numbers l, c with l<c such that

    0 ρ ( c ( T x T y ) ) φ(t)dtϕ ( 0 ρ ( l ( x y ) ) φ ( t ) d t )

hold for each (x,y)E( G ˜ ) with ϕ Φ 1 and φΦ. Then T is a PO.

Corollary 3.21 Assume

  1. (i)

    the C ρ -graph G is weakly connected and

  2. (ii)

    there exist nonnegative numbers l, c with l<c such that

    0 ψ ( ρ ( c ( T x T y ) ) ) φ(t)dtη 0 ψ ( ρ ( l ( x y ) ) ) φ(t)dt

for each (x,y)E( G ˜ ) with η(0,1) and φΦ. Then T is a PO.

Now we provide examples in support of our results.

Example 3.22 Let X ρ ={0,1,2,3,4,5} and ρ(x)=|x|, for all x X ρ . Consider

E( G ˜ )= { ( 1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) , ( 5 , 5 ) } { ( 0 , x ) : x X ρ } ,

and Tx=0, x X ρ . Then G is weakly connected and C ρ -graph, X T is nonempty and T is a ( G ˜ , A ) ρ -contraction where c= 7 5 , l= 6 5 , φ(t)=1. Hence, T is a PO.

Example 3.23 Let X ρ ={0,1,2,3} and ρ(x)=|x|, for all x X ρ . Consider

E( G ˜ )= { ( 0 , 0 ) , ( 0 , 1 ) , ( 1 , 1 ) , ( 1 , 3 ) , ( 2 , 2 ) , ( 0 , 3 ) , ( 2 , 3 ) , ( 3 , 3 ) } .

Define T: X ρ X ρ as follows:

Tx= { 0 , x { 0 , 1 } , 1 , x { 2 , 3 } .

Then G is weakly connected and C ρ -graph, X T is nonempty, and T is a Hardy-Rogers type ( G ˜ ) ρ -contraction where c=4, l 1 = l 2 = l 3 =3, l 4 = l 5 = 1 2 , η= 1 3 , β= 1 4 , γ=0, and φ(t)=1. Moreover, 0 is a unique fixed point of T.

Example 3.24 Let X ρ =[0,1] and ρ(x)=|x|, for all x X ρ . Consider

E(G)= { ( 0 , 0 ) } { ( 0 , x ) : x 1 / 2 } { ( x , y ) : x , y ( 0 , 1 ] } ,

and Tx= x 2 , x X ρ . Then G is weakly connected and a C ρ -graph, X T is nonempty and T is a ( G ˜ , ϕ , ψ ) ρ -contraction where c= 1 2 , l= 1 3 , φ(t)=1, ϕ(ξ)= ξ 1 + ξ , and ψ(ω)= ω 3 . Thus all conditions of Theorem 3.18 are satisfied. Moreover, T is a PO.

Remark 3.25 In the above examples, if we use ρ(x)= x 2 , the conclusions remain the same.