Next Article in Journal
A Penalized Empirical Likelihood Approach for Estimating Population Sizes under the Negative Binomial Regression Model
Previous Article in Journal
An Enhanced Credit Risk Evaluation by Incorporating Related Party Transaction in Blockchain Firms of China
Previous Article in Special Issue
Anisotropic Moser–Trudinger-Type Inequality with Logarithmic Weight
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Weak ψ-Contractions on Directed Graphs with Applications to Integral Equations

1
Department of Mathematical Science, College of Sciences, Princess Nourah Bint Abdulrahman University, Riyadh 11671, Saudi Arabia
2
Department of Mathematics, Faculty of Science, University of Tabuk, Tabuk 71491, Saudi Arabia
3
Department of Mathematics, Islamic University of Madinah, Madinah 42351, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(17), 2675; https://doi.org/10.3390/math12172675
Submission received: 12 June 2024 / Revised: 24 August 2024 / Accepted: 25 August 2024 / Published: 28 August 2024

Abstract

:
This article deals with a few outcomes ensuring the fixed points of a weak ( G , ψ ) -contraction map of metric spaces comprised with a reflexive and transitive digraph G. To validate our findings, we furnish several examples. The findings we obtain enable us to seek out the unique solution of a nonlinear integral equation. The outcomes presented herewith sharpen, subsume, unify, improve, enrich, and compile a number of existing theorems.
MSC:
47H10; 54H25; 45G10

1. Introduction

Within this text, the following notations and abbreviations are adopted:
  • N —the set of natural numbers;
  • R —the set of real numbers;
  • N 0 : = N { 0 } ;
  • R + : = [ 0 , ) ;
  • BCP—Banach contraction principle;
  • MS—metric space;
  • CMS—complete metric space;
  • fpt—fixed-point theorem;
  • NIE—nonlinear integral equation;
  • Fix ( H ) —the set of fixed points of a self-map H .
The classical BCP, proved in 1922, pioneered the discipline of metric fixed-point theory. This standard outcome continues to be the primary finding in nonlinear functional analysis. Later on, to generalize the BCP, a number of investigators expanded the class of contraction mappings. One of the noted generalizations of contraction mapping is nonlinear contraction or ϕ -contraction given as
ϖ ( H t , H s ) ϕ ( ϖ ( t , s ) ) .
where ϕ : R + R + remains an appropriate function. The idea of ϕ -contractions was first proposed by Browder [1] and developed by Boyd and Wong [2] and Matkowski [3]. Rhoades [4] developed a comparison of several contractive mapping types, assessing and contrasting 149 distinct conditions. A large portion of Rhoades’s work [4] was absorbed by Browder [5] using an understandable and straightforward style of argumentation.
In 1972, Krasnosel’skii et al. [6] investigated the concept of weak ψ -contraction depending on an auxiliary function ψ : R + R + , which is defined as follows:
ϖ ( H t , H s ) ϖ ( t , s ) ψ ( ϖ ( t , s ) ) .
Following the idea of weak contraction, Alber and Guerre-Delabriere [7] presented certain fpt in the setup of Hilbert space. Subsequently, Rhoades [8] generalized the BCP for weak contractions and pointed out that the fpts contained in [7] also remain accurate in CMSs.
In recent years, various researchers extended many existing fpts employing the structure of a directed graph, e.g., [9,10,11,12,13,14]. This trend was investigated by Jachymski [15], who obtained the graphical formulation of the BCP. In such outcomes, the contraction inequality requires a hold on merely the edges of the graph. Consequently, graphical contractions remain weaker than the corresponding usual contractions. Owing to such limitations, these outcomes can be employed to solve special kinds of NIEs wherein the usual fpt cannot be applied.
The outcomes presented in this manuscript are fixed-point theorems under a weak ( G , ψ ) -contraction in the setup of metric spaces equipped with a reflexive and transitive directed graph. The findings proved herewith sharpen, subsume, unify, improve, enrich, and compile a number of existing theorems, especially thanks to Rhoades [4], Jachymski [15], Samreen and Kamran [9], Filali et al. [10], Geraghty [16], and Harjani and Sadarangani [17]. Our findings are illustrated by several examples. As an application, we utilize our outcomes to seek out the unique solution of an NIE prescribed with some additional hypotheses.

2. Preliminaries

This section aims to summarize allied essential notions and supplementary findings needed to prove our main results.
Definition 1
([18]). A graph G is interpreted by pair ( v ( G ) , e ( G ) ) , whereas v ( G ) is a nonempty set and e ( G ) remains a binary relation on v ( G ) . Elements of v ( G ) and e ( G ) are known as the vertices and the edges, respectively.
Definition 2
([18]). A graph in which each edge remains an ordered pair of vertices is referred to as a digraph (or directed graph).
Definition 3
([18]). Given a graph G, the induced graph G 1 described by
v ( G 1 ) = v ( G ) a n d e ( G 1 ) = { ( t , s ) v ( G ) 2 : ( s , t ) e ( G ) }
is named as the transpose of G.
Definition 4
([18]). Every digraph G = ( v ( G ) , e ( G ) ) induces an undirected graph G ˜ , which is described by
v ( G ˜ ) = v ( G ) a n d e ( G ˜ ) = e ( G ) e ( G 1 ) .
Definition 5
([13]). A digraph G is named as transitive if for every t , s , r v ( G ) with
( t , s ) e ( G ) a n d ( s , r ) e ( G ) ( t , r ) e ( G ) .
Definition 6
([18]). Given t , s v ( G ) , the finite set { r 0 , r 1 , r 2 , r } of vertices is referred as a path in G from t to s of length ℓ if r 0 = t , r = s , and ( r j 1 , r j ) e ( G ) , j { 1 , 2 , } .
Definition 7
([18]). A graph G is named as connected if any two vertices in G admit a path. One says that G is weakly connected when G ˜ is connected.
Definition 8
([15]). An MS ( P , ϖ ) is named as an MS endowed with a graph G if
  • v ( G ) = P ;
  • e ( G ) contains all loops;
  • G admits no parallel edge.
Definition 9
([15]). Let ( P , ϖ ) be an MS endowed with a digraph G. A map H : P P is named as an orbitally G-continuous if, for all t , t ¯ P and for each sequence { n j } N , we have
lim j H n j ( t ) = t ¯ and ( H n j t , H n j + 1 t ) e ( G ) lim n H ( H n j t ) = H ( t ¯ ) .
Definition 10
([11]). Let ( P , ϖ ) be an MS endowed with a digraph G. Then, G is referred as a ( C ) -graph if each sequence { t n } P enjoying the properties t n t and ( t n , t n + 1 ) e ( G ) for each n N admits a subsequence { t n k } verifying ( t n k , t ) e ( G ) for each k N .
Following Hossain et al. [19], Ψ refers to the collection of functions ψ : R + R + verifying the following:
  • Ψ 1 : ψ ( r ) > 0 , r > 0 ,
  • Ψ 2 : lim inf p r ψ ( p ) > 0 , r > 0 .
Remark 1
([19]). Ψ 1 is equivalent to
  • Ψ 1 : ψ ( r ) = 0 r = 0 .
Proposition 1
([19]). If ψ Ψ satisfies r r ψ ( r ) for every r , r R + with r 0 , then
r < r .
Definition 11.
Let ( P , ϖ ) be an MS endowed with a digraph G and ψ Ψ . A map H : P P is named as a weak ( G , ψ ) -contraction if
(i)
( t , s ) e ( G ) ( H t , H s ) e ( G ) ;
(ii)
( t , s ) e ( G ) ϖ ( H t , H s ) ϖ ( t , s ) ψ ( ϖ ( t , s ) ) .
Lemma 1
([20]). If a sequence { t n } in an MS ( P , ϖ ) is not Cauchy, then there exist ϵ 0 > 0 and subsequences { t n k } and { t l k } of { t n } verifying
  • k l k < n k , k N ;
  • ϖ ( t l k , t n k ) > ϵ 0 , k N ;
  • ϖ ( t l k , t n k 1 ) ϵ 0 , k N .
Furthermore, if lim n ϖ ( t n , t n + 1 ) = 0 , then
  • lim k ϖ ( t l k , t n k ) = ϵ 0 ;
  • lim k ϖ ( t l k , t n k + 1 ) = ϵ 0 ;
  • lim k ϖ ( t l k + 1 , t n k ) = ϵ 0 ;
  • lim k ϖ ( t l k + 1 , t n k + 1 ) = ϵ 0 .

3. Main Results

For a digraph G with v ( G ) = P and a map H : P P , we use the following notation:
P H = { t P : ( t , H t ) e ( G ) } .
We are now going to demonstrate the following fpt in an MS over a weak ( G , ψ ) -contractivity condition.
Theorem 1.
Let ( P , ϖ ) be a CMS endowed with a transitive digraph G. Let H : P P be a weak ( G , ψ ) -contraction map. If either H is orbitally G-continuous or G is a ( C ) -graph, then H owns a fixed point provided P H .
Proof. 
Take t 0 P H so that ( t 0 , H t 0 ) e ( G ) . Construct a sequence { t n } in the following way:
t n + 1 = H n ( t 0 ) = H ( t n ) , n N 0 .
Since ( t 0 , H t 0 ) e ( G ) , using (i) of weak ( G , ψ ) -contractivity condition inductively, we have
( H n t 0 , H n + 1 t 0 ) e ( G ) ,
which through (1) simplifies to
( t n , t n + 1 ) e ( G ) n N 0 .
Define ϖ n : = ϖ ( t n , t n + 1 ) . If there is some n 0 N 0 with ϖ n 0 = 0 , then using (1), we find t n 0 = t n 0 + 1 = H ( t n 0 ) ; so, t n 0 Fix ( H ) unless we have ϖ n > 0 for every n N 0 . Upon implementing a weak ( G , ψ ) -contractivity condition, we find
ϖ ( t n , t n + 1 ) = ϖ ( H t n 1 , H t n ) ϖ ( t n 1 , t n ) ψ ( ϖ ( t n 1 , t n ) )
so that
ϖ n + 1 ϖ n ψ ( ϖ n ) .
In view of Proposition 1, Equation (3) gives rise to
ϖ n < ϖ n 1 , n N 0
which follows that { ϖ n } R + { 0 } remains a decreasing sequence. Consequently, there is an element δ 0 verifying
lim n ϖ n = δ .
We now argue that δ = 0 . In contrast, assume that δ > 0 . From (3), we find
lim sup n ϖ n + 1 lim sup n ϖ n + lim sup n [ ψ ( ϖ n ) ] lim sup n ϖ n lim inf n ψ ( ϖ n )
Employing (4), the inequality shown above simplifies to
δ δ lim inf n ψ ( ϖ n )
leading to, in turn,
lim inf ϖ n δ ψ ( ϖ n ) = lim inf n ψ ( ϖ n ) 0
which contradicts Ψ 2 . Thus, we have
lim n ϖ n = lim n ϖ ( t n , t n + 1 ) = 0 .
We now argue that { t n } remains Cauchy. In contrast, assuming that { t n } is not Cauchy, we apply Lemma 1, ϵ 0 > 0 and subsequences { t n k } and { t l k } of { t n } for which
k l k < n k , ϖ ( t l k , t n k ) > ϵ 0 ϖ ( t l k , t n k 1 ) , k N .
Define δ k : = ϖ ( t l k , t n k ) . Employing (2) and the transitivity of G, we find ( t l k , t n k ) e ( G ) . Using a weak ( G , ψ ) -contractivity condition, we obtain
ϖ ( t l k + 1 , t n k + 1 ) = ϖ ( P t l k , P t n k ) ϖ ( t l k , t n k ) ψ ( ϖ ( t l k , t n k ) )
so that
ϖ ( t l k + 1 , t n k + 1 ) δ k ψ ( δ k ) .
From (6) and Lemma 1, one obtains
lim sup k ϖ ( t l k + 1 , t n k + 1 ) lim sup k δ k + lim sup k [ ψ ( δ k ) ] ,
yielding thereby
ϵ 0 ϵ 0 lim inf k ψ ( δ k )
so that
lim inf δ k ϵ ψ ( δ k ) = lim inf k ψ ( δ k ) 0 ,
which contradicts Ψ 2 . Consequently, { t n } is a Cauchy. Through the completeness of ( P , ϖ ) , there exists t P whereby t n ϖ t .
Suppose that H is orbitally G-continuous. Then, one finds
t n + 1 = H ( t n ) ϖ H ( t ) ,
leading to in turn H ( t ) = t . Therefore, t is a fixed point of H . Otherwise, if G is a ( C ) -graph, then a subsequence { t n k } of { t n } can be determined that satisfies ( t n k , t ) e ( G ) for every k N 0 . Based on the weak ( G , ψ ) -contractivity condition, we have
ϖ ( t n k + 1 , H t ) = ϖ ( H t n k , H t ) ϖ ( t n k , t ) ψ ( ϖ ( t n k , t ) ) ϖ ( t n k , t ) , k N 0 .
Taking k in the above inequality and using t n k ϖ t , we obtain
t n k + 1 ϖ H ( t ) ,
leading to in turn H ( t ) = t . Hence, t is a fixed point of H . □
Theorem 2.
Irrespective of the presumptions laid out in Theorem 1, if G is weakly connected, then H owns a unique fixed point.
Proof. 
Regarding Theorem 1, if t , s Fix ( H ) , then for every n N 0 we find
H n ( t ) = t , H n ( s ) = s .
With the weak connectedness of G, there is a path { r 0 , r 1 , r 2 , r } between t and s, i.e.,
r 0 = t , r = s and ( r j 1 , r j ) e ( G ) , j { 1 , 2 , } .
Through the utilisation of (i) of the weak ( G , ψ ) -contractivity condition, we find for each 0 j 1 that
( H n r j , H n r j + 1 ) e ( G ˜ ) , n N 0 .
The application of the triangle inequality reveals
ϖ ( t , s ) = ϖ ( H n r 0 , H n r ) j = 0 1 ϖ ( H n r j , H n r j + 1 ) .
For every j ( 0 j 1 ) , denote μ n j : = ϖ ( H n r j , H n r j + 1 ) , where n N 0 . Now, claim that
lim n μ n j = 0 .
To substantiate this, upon fixing j, assuming first that μ n 0 j = 0 for some n 0 N 0 , then H n 0 + 1 ( r j ) = H n 0 + 1 ( r j + 1 ) . Thus, we find μ n 0 + 1 j = ϖ ( H n 0 + 1 r j , H n 0 + 1 r j + 1 ) = 0 ; so, inductively, we find μ n j = 0 for every n n 0 so that lim n μ n j = 0 . In contrast, if μ n j > 0 for every n N 0 , then by (8) and (ii) of the weak ( G , ψ ) -contractivity condition, we obtain
μ n + 1 j = ϖ ( H n + 1 r j , H n + 1 r j + 1 ) ϖ ( H n r j , H n r j + 1 ) ψ ( ϖ ( H n r j , H n r j + 1 ) ) = μ n j ψ ( μ n j ) μ n j .
Consequently, { μ n j } is a decreasing sequence in R + ; so μ n j μ R + . In contrast, if μ 0 , then from (10), we obtain
lim sup n μ n + 1 j lim sup n μ n j + lim sup n ( ψ ( μ n j ) )
μ μ lim inf n ( ψ ( μ n j ) )
implying thereby lim inf n ψ ( μ n j ) 0 , which contradicts Ψ 2 . Thus, lim n μ n j = 0 . Furthermore, (9) can be written as
ϖ ( t , s ) = ϖ ( H n r 0 , H n r ) j = 0 1 ϖ ( H n r j , H n r j + 1 ) μ n 0 + μ n 1 + + μ n 1 0 as n
which yields t = s ; so, H owns a unique fixed point. □

4. Special Cases

Note that Theorems 1 and 2 deduce a number of existing results in the following respects:
  • Case-1. Under the complete digraph G 0 defined by e ( G 0 ) = P 2 , Theorem 2 reduces to a sharpened version of classical fixed-point theorem of Rhoades [4], which again by setting ψ ( r ) = r r β ( r ) , whereas β : R + [ 0 , 1 ) verifying β ( r n ) 1 r n 0 , reduces to the classical fixed-point theorem of Geraghty [16].
  • Case-2. Let ( P , ) be a poset. Define a digraph G 1 on P by e ( G 1 ) = { ( t , s ) P 2 : t s } ; our main results reduce to Theorems 2 and 3 of Harjani and Sadarangani [17]. Condition (i) of Definition 11 means that H is ⪯-nondecreasing, and Condition (ii) of Definition 11 means that the weak ψ -contraction inequality holds for merely ⪯-preserving elements of P .
  • Case-3. Let ( P , ) be a poset. Define a digraph G 2 on P by e ( G 2 ) = { ( t , s ) P 2 : t s s t } . Theorem 2 reduces to Theorem 6 of Harjani and Sadarangani [17]. Condition (i) of Definition 11 means that H map two ⪯-comparable elements to two ⪯-comparable elements, and Condition (ii) of Definition 11 means that the weak ψ -contraction inequality holds for merely ⪯-comparable elements of P .
  • Case-4. Let e > 0 be fixed. Define a digraph G 3 on P by e ( G 3 ) = { ( t , s ) P 2 : ϖ ( t , s ) e } . Elements of e ( G 3 ) are termed e-closed (c.f. [14]). We see that e ( G 3 ) contains all loops. Under this setting, our results deduce certain new results wherein the map H takes e-closed elements of P to e-closed elements, and the weak ψ -contraction inequality must be satisfied for merely e-closed elements of P .
  • Case-5. Particularly for ψ ( r ) = ( 1 λ ) r ( 0 λ 1 ) , (after removing the transitivity requirement on G), Theorems 1 and 2 reduce to the corresponding results of Jachymski [15].
  • Case-6. If ψ : R + [ 0 , ) is continuous and increasing such that ψ ( r ) > 0 for r > 0 , ψ ( 0 ) = 0 and lim p ψ ( p ) = , then ψ Ψ . Under this substitution, Theorems 1 and 2 deduce the corresponding results of Samreen and Kamran [9].
  • Case-7. If ψ ( r ) = r φ ( r ) , where φ is a right upper semi-continuous function such that φ ( r ) < r for r > 0 , then ψ Ψ . Under this substitution, Theorems 1 and 2 deduce the recent results because of Filali et al. [10].

5. Examples

To illuminate our results, we offer the following examples.
Example 1.
Suppose P = [ 0 , 1 ] is an MS with Euclidean metric ϖ. It is clear that ( P , ϖ ) is a CMS. Define a directed graph by v ( G ) = P and e ( G ) = { t , s P : 0 t < s 1 2 } . Then, G is transitive.
Consider the self-map
H ( t ) = 1 5 + t 3 , i f t [ 0 , 1 2 ] 1 4 , i f t ( 1 2 , 1 ] .
Then, H is orbitally G-continuous. Now, take ( t , s ) e ( G ) ; then, ( H t , H s ) e ( G ) and
ϖ ( H t , H s ) = | 1 5 + t 3 1 5 s 3 | = | t 3 s 3 | = 1 3 | t s | 1 6 a s ( t , s ) e ( G ) t h e n | t s | 1 2 < | t s | ( 1 | t s | ) = | t s | | t s | 2 = ϖ ( t , s ) ψ ( ϖ ( t , s ) ) ,
which implies that H satisfies the weak ( G , ψ ) -contractivity condition for ψ ( r ) = r 2 . Henceforth, all requirements of Theorem 1 are met; consequently, H owns a fixed point. Meanwhile, the fixed point remains unique because it fulfills every assumption contained in Theorem 2. Note that the fixed point of H in the present instance is t = 3 10 .
Example 2.
Suppose P = R 2 is a MS with the following metric:
ϖ ( ( t , s ) ( p , q ) ) = | t p | + | s q | 2 ( t , s ) , ( p , q ) P .
It is clear that ( P , ϖ ) is a CMS. Define a directed graph by v ( G ) = P and e ( G ) = { ( ( t , s ) , ( p , q ) ) M 2 × M 2 : p t 0 , s q 0 } . Then, G is transitive.
Consider the self-map
H ( t , s ) = t 2 s 4 , s 2 t 4 ( t , s ) P .
Then, ( 2 , 3 ) M ( H , e ( G ) ) . Define ψ ( r ) = r 8 . Then, ψ Ψ . Take ( t , s ) , ( p , q ) ) e ( G ) . Then, we have ( H t , H s ) , ( p , q ) ) e ( G ) . Also, we have
ϖ ( H ( t , s ) , H ( p , q ) ) = 1 4 ( | ( t p ) + 2 ( q s ) | + | ( q s ) + 2 ( t p ) | ) = 3 8 ( t p + q s ) .
On the other hand, we have
ϖ ( ( t , s ) , ( p , q ) ) ) ψ ( ϖ ( ( t , s ) , ( p , q ) ) ) = ϖ ( ( t , s ) , ( p , q ) ) ϖ ( ( t , s ) , ( p , q ) ) 8 = 7 8 ϖ ( ( t , s ) , ( p , q ) ) = 7 16 ( t p + q s ) .
Thus, the weak ( G , ψ ) -contractivity condition holds. It can be easily verified that G remains a ( C ) -graph. Hence, by Theorem 1, H possesses a fixed point. Meanwhile, the fixed point remains unique because it fulfills every assumption contained in Theorem 2. Note that the fixed point of H in the present instance is t = ( 0 , 0 ) .
Example 3.
Suppose P = [ 0 , 1 ] is a MS with Euclidean metric ϖ. It is clear that ( P , ϖ ) is a CMS. Define a directed graph by v ( G ) = P and e ( G ) = { ( t , s ) P 2 : t s { t , s } } . Then G is transitive.
Let ζ : V V be a map defined by
H ( t ) = t 2 , if t Q P 0 , if t Q c P .
Then H is orbitally G-continuous. Also, it can be easily verified that H satisfies the weak ( G , ψ ) -contractivity condition for ψ ( r ) = 1 2 r . Consequently, in lieu of Theorem 1, H owns a fixed point. Meanwhile, the fixed point remains unique because it fulfills every assumption contained in Theorem 2. Take note that the fixed point of H in the present instance is t = 0 .
The involved map in the above example is not a weak ψ -contraction, as, in particular, for the pair t = 0 and s = 1 2 , we have
ϖ ( H t , H s ) = 0 > 1 2 2 = ϖ ( t , s ) ψ ( ϖ ( t , s ) ) .
Thus far, Example 3 cannot work in the context of an ordinary MS, which substantiates the utility of fixed-point outcomes in an MS endowed with a graph over the corresponding outcomes in an ordinary MS.

6. An Application to NIEs

This section addresses an application of earlier fpts to compute a unique solution of the following NIE:
v ( ω ) = F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ( τ ) ) d τ , ω S : = [ a , b ]
where F : S R , L : S 2 R and Θ : S × R R remain functions.
Definition 12.
v ¯ C ( S ) is named as a lower solution of (11) if
v ¯ ( ω ) F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ¯ ( τ ) ) d τ , ω S .
Definition 13.
v ̲ C ( S ) is named as an upper solution of (11) if
v ̲ ( ω ) F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ̲ ( τ ) ) d τ , ω S .
Below are the essential results of this section.
Theorem 3.
In addition to Problem (11), suppose that
(a)
F, Θ and L are continuous;
(b)
L ( ω , τ ) > 0 , f o r a l l ω , τ S ;
(c)
There exists ε > 0 that satisfies for any α , β R with α β that
0 [ Θ ( ω , α ) + ε α ] [ Θ ( ω , β ) + ε β ] ε ln ( α β + 1 ) ,
(d)
sup ω S a b L ( ω , τ ) d τ 1 ε .
If Problem (11) has a lower solution, then it enjoys a unique solution.
Proof. 
Define P : = C ( S ) . Consider metric ϖ on P by
ϖ ( v , u ) = sup ω S | v ( ω ) u ( ω ) | , for all v , u P .
Clearly ( P , ϖ ) is a CMS. Define a digraph G by v ( G ) = P and e ( G ) = { ( v , u ) P 2 : v ( ω ) u ( ω ) , ω S } . Then, G is transitive. Consider a map H : P P defined by
( H v ) ( ω ) = F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ( τ ) ) d τ , for all ω P .
Naturally, v 0 P forms a solution to Problem (11) iff v 0 is a fixed point of H .
Define the auxiliary function ψ Φ by ψ ( r ) = r ln ( r + 1 ) . In order to verify that H satisfies a weak ( G , ψ ) -contractivity condition, let us take v , u P such that ( v , u ) e ( G ) . For a coat of (c), we arrive at
Θ ( ω , v ( τ ) ) Θ ( ω , u ( τ ) ) 0 , ω , τ S .
Through (14), (15), and (b), we conclude
( H v ) ( ω ) ( H u ) ( ω ) = a b L ( ω , τ ) [ Θ ( τ , v ( τ ) ) Θ ( τ , u ( τ ) ) ] d τ 0 ,
following that ( H v ) ( ω ) ( H u ) ( ω ) . Consequently, we have ( H v , H u ) e ( G ) . Furthermore, using item (c), (13) and (14), we find
ϖ ( H v , H u ) = sup ω S | ( H v ) ( ω ) ( H u ) ( ω ) | = sup ω S [ ( H u ) ( ω ) ( H v ) ( ω ) ] sup ω S a b L ( ω , τ ) [ Θ ( ω , u ( τ ) ) + ε u ( τ ) Θ ( ω , v ( τ ) ) ε v ( τ ) ] d τ sup ω S a b L ( ω , τ ) ε ln ( u ( τ ) v ( τ ) + 1 ) d τ .
But θ ( r ) = ln ( r + 1 ) is increasing, and 0 u ( τ ) v ( τ ) ϖ ( v , u ) ; so, we find
ln ( u ( τ ) v ( τ ) + 1 ) ln ( ϖ ( v , u ) + 1 ) .
Hence, (16) becomes
ϖ ( H v , H u ) ε ln ( ϖ ( v , u ) + 1 ) sup ω S a b L ( ω , τ ) d τ ε ln ( ϖ ( v , u ) + 1 ) · 1 ε = ϖ ( v , u ) [ ϖ ( v , u ) ln ( ϖ ( v , u ) + 1 ) ]
so that
ϖ ( H v , H u ) ϖ ( v , u ) ψ ( ϖ ( v , u ) ) , ( v , u ) e ( G ) .
Assuming that { v n } P is a sequence, which verifies ( v n , v n + 1 ) e ( G ) and v n v ˜ P . Then, for every ω S , { v n ( ω ) } R is increasing, which will converge to v ˜ ( ω ) , indicating that v n ( ω ) v ˜ ( ω ) for all ω S , and so, ( v n , v ˜ ) e ( G ) . Thus, G is a ( C ) -graph.
Let v ¯ P be a lower solution of (11). Then,
v ¯ ( ω ) F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ¯ ( τ ) ) d τ = ( H v ¯ ) ( ω )
yielding thereby ( v ¯ , H v ¯ ) e ( G ) so that P H . Thus, all premises of Theorem 1 are validated, and hence, H is WPM. Finally, we verify the assumption of Theorem 2. Let v , u be chosen arbitrarily. Set w : = max { v , u } P . We have ( v , w ) e ( G ) and ( u , w ) e ( G ) . Consequently, G is weakly connected; so, using Theorem 2, H admits a unique fixed point, which remains a unique solution for (11). □
Theorem 4.
In the conjunction with accusations (a)–(d) of Theorem 3, if there is an upper solution of (11), then the problem admits a unique solution.
Proof. 
Let P : = C ( S ) with a metric ϖ . Clearly, ( P , ϖ ) is a CMS. Consider a map H : P P defined the same as the proof of Theorem 3. Define a directed graph G by v ( G ) = P and e ( G ) = { ( v , u ) P 2 : v ( ω ) u ( ω ) , ω S } . Then, G is transitive. If v ̲ P is an upper solution of (11), then we obtain
v ̲ ( ω ) F ( ω ) + a b L ( ω , τ ) Θ ( τ , v ̲ ( τ ) ) d τ = ( H v ̲ ) ( ω )
which concludes that ( v ̲ , H v ̲ ) e ( G ) so that P H .
Take v , u P such that ( v , u ) e ( G ) . Using (c), we obtain
Θ ( ω , v ( τ ) ) Θ ( ω , u ( τ ) ) 0 , for all ω , τ S .
Making use of (14), (17) and (b), we get
( H v ) ( ω ) ( H u ) ( ω ) = a b L ( ω , τ ) [ Θ ( τ , v ( τ ) ) Θ ( τ , u ( τ ) ) ] d τ 0 .
Thus, ( H v ) ( ω ) ( H u ) ( ω ) so that ( H v , H u ) e ( G ) .
Let { v n } P be a sequence, which verifies ( v n , v n + 1 ) e ( G ) and v n v ˜ P . Then, for every ω S , { v n ( ω ) } is a decreasing sequence (in R ) that converges to v ( ω ) . Consequently, for all n N , we have v n ( ω ) v ( ω ) for all ω S ; so, ( v n , v ) e ( G ) . Thus, G is a ( C ) -graph.
Overall, we have therefore confirmed all claims of Theorems 1 and 2 for the MS ( P , ϖ ) , the map H and the graph G . The proof is now finalized. □

7. Conclusions

We demonstrate some fpts employing a weak ( G , ψ ) -contraction map of metric spaces comprising a reflexive and transitive digraph G. We also observe that our findings deduce a number of existing results especially contained in Harjani and Sadarangani [17], Rhoades [4], Geraghty [16], Jachymski [15], Samreen and Kamran [9], and Filali et al. [10]. To validate our findings, we furnish several examples. The findings we obtain enable us to seek out the unique solution of a nonlinear integral equation.
The idea of weak ψ -contractions was further generalized and developed by Dutta and Choudhury [21], Đorić [22], Popescu [23], Fallahi et al. [24] and similar others by employing the concept of ( ψ , ϕ ) -contractions that depend on two auxiliary functions. Thus far, as a future work, we can further extend Theorem 1 for ( ψ , ϕ ) -contractions in a metric space equipped with a reflexive and transitive directed graph. In a short while, scholars may also adapt the fpt we found to two or more maps or to various generalized distance spaces, such as b-metric space, quasi-metric space, cone metric space, etc., or we can apply the same results to obtain a unique solution of certain boundary value problems.

Author Contributions

Methodology, M.D. and M.A.; Validation, D.F.; Formal analysis, M.A.; Investigation, M.D.; Writing—original draft, M.A.; Writing—review & editing, M.D.; Funding acquisition, D.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work is funded by Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia, under the Researchers supporting project number (PNURSP2024R174).

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Acknowledgments

All authors would like to offer thanks to an academic editor and three learned referees for their fruitful suggestions and constructive comments toward the improvement of the manuscript. The first author acknowledges the Princess Nourah bint Abdulrahman University Researchers Supporting Project, project number PNURSP2024R174, Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors have revealed no competing interests.

References

  1. Browder, F.E. On the convergence of successive approximations for nonlinear functional equations. Indag. Math. 1968, 30, 27–35. [Google Scholar] [CrossRef]
  2. Boyd, D.W.; Wong, J.S. On nonlinear contractions. Proc. Am. Math. Soc. 1969, 20, 458–464. [Google Scholar] [CrossRef]
  3. Matkowski, J. Integrable Solutions of Functional Equations; Dissertationes Math.; Instytut Matematyczny Polskiej Akademi Nauk: Warsaw, Poland, 1975; Volume 127, p. 68. [Google Scholar]
  4. Rhoades, B.E. A comparison of various definitions of contractive mappings. Trans. Am. Math. Soc. 1977, 226, 257–290. [Google Scholar] [CrossRef]
  5. Browder, F.E. Remarks on fixed point theorems of contractive type. Nonlinear Anal. 1979, 3, 693–702. [Google Scholar] [CrossRef]
  6. Krasnosel’skii, M.A.; Rutitskii, Y.B.; Stesenko, V.Y.; Vainniko, G.M.; Zabreiko, P.P.; Zabreiko, P. Approximate Solution of Operator Equations; Louvish, D., Translator; Wolters-Noordhoff: Groningen, The Netherlands, 1972. [Google Scholar]
  7. Alber, Y.I.; Guerre-Delabriere, S. Principle of weakly contractive maps in hilbert spaces. In New Results in Operator Theory and Its Applications; Springer: Berlin/Heidelberg, Germany, 1997; pp. 7–22. [Google Scholar]
  8. Rhoades, B. Some theorems on weakly contractive map. Nonlinear Anal. 2001, 47, 2683–2693. [Google Scholar] [CrossRef]
  9. Samreen, M.; Kamran, T. Fixed point theorems for weakly contractive mappings on a metric space endowed with a graph. Filomat 2014, 28, 441–450. [Google Scholar] [CrossRef]
  10. Filali, D.; Akram, M.; Dilshad, M. Nonlinear contractions on directed graphs with applications to boundary value problems. AIMS Math. 2024, 9, 15263–15275. [Google Scholar] [CrossRef]
  11. Aleomraninejad, S.M.A.; Rezapoura, S.; Shahzad, N. Some fixed point results on a metric space with a graph. Topol. Appl. 2012, 159, 659–663. [Google Scholar] [CrossRef]
  12. Berinde, V.; Păcurar, M. The contraction principle for nonself mappings on Banach spaces endowed with a graph. J. Nonlinear Convex Anal. 2015, 16, 1925–1936. [Google Scholar]
  13. Alfuraidan, M.R.; Bachar, M.; Khamsi, M.A. Almost monotone contractions on weighted graphs. J. Nonlinear Sci. Appl. 2016, 9, 5189–5195. [Google Scholar] [CrossRef]
  14. Fallahi, K.; Rad, G.S. Fixed points of a φ-G-contractive mapping with respect to a c-distance on an abstract metric space endowed with a graph. Math Notes 2019, 105, 781–788. [Google Scholar] [CrossRef]
  15. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  16. Geraghty, M. On contractive mappings. Proc. Am. Math. Soc. 1973, 40, 604–608. [Google Scholar] [CrossRef]
  17. Harjani, J.; Sadarangani, K. Fixed point theorems for weakly contractive mappings in partially ordered sets. Nonlinear Anal. 2009, 71, 3403–3410. [Google Scholar] [CrossRef]
  18. Johnsonbaugh, R. Discrete Mathematics; Prentice-Hall, Inc.: Hoboken, NJ, USA, 1997. [Google Scholar]
  19. Hossain, A.; Alam, A.; Sessa, S.; Khan, Q.H. Relation-theoretic weak contractions and applications. Mathematics 2023, 11, 1976. [Google Scholar] [CrossRef]
  20. Jleli, M.; Rajic, V.C.; Samet, B.; Vetro, C. Fixed point theorems on ordered metric spaces and applications to nonlinear elastic beam equations. Fixed Point Theory Appl. 2012, 12, 175–192. [Google Scholar] [CrossRef]
  21. Dutta, P.N.; Choudhury, B.S. A generalisation of contraction principle in metric spaces. Fixed Point Theory Appl. 2008, 2008, 406368. [Google Scholar] [CrossRef]
  22. Đorić, D. Common fixed point for generalized (ψ, ϕ)-weak contractions. Appl. Math. Lett. 2009, 22, 1896–1900. [Google Scholar] [CrossRef]
  23. Popescu, O. Fixed points for (ψ, ϕ)-weak contractions. Appl. Math. Lett. 2011, 24, 1–4. [Google Scholar] [CrossRef]
  24. Fallahi, K.; Rad, G.S.; Fulga, A. Best proximity points for (φψ)-weak contractions and some applications. Filomat 2023, 37, 1835–1842. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Filali, D.; Dilshad, M.; Akram, M. Weak ψ-Contractions on Directed Graphs with Applications to Integral Equations. Mathematics 2024, 12, 2675. https://doi.org/10.3390/math12172675

AMA Style

Filali D, Dilshad M, Akram M. Weak ψ-Contractions on Directed Graphs with Applications to Integral Equations. Mathematics. 2024; 12(17):2675. https://doi.org/10.3390/math12172675

Chicago/Turabian Style

Filali, Doaa, Mohammad Dilshad, and Mohammad Akram. 2024. "Weak ψ-Contractions on Directed Graphs with Applications to Integral Equations" Mathematics 12, no. 17: 2675. https://doi.org/10.3390/math12172675

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