Next Article in Journal
Tau-Theory-Based Guidance Methodology for Helicopter Obstacle Field Navigation
Next Article in Special Issue
Existence, Uniqueness, and Hyers–Ulam’s Stability of the Nonlinear Bagley–Torvik Equation with Functional Initial Conditions
Previous Article in Journal
Event-Triggered Adaptive Control for Multi-Agent Systems Utilizing Historical Information
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Two Types of Proximal Connected-Image Contractions in b-Metric Spaces and Applications to Fractional Differential Models

by
Khuanchanok Chaichana
1,2,3,
Ben Wongsaijai
1,2,3,*,
Adsadang Himakalasa
2 and
Phakdi Charoensawan
1,2,3,*
1
Advanced Research Center for Computational Simulation, Chiang Mai University, Chiang Mai 50200, Thailand
2
Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
3
Centre of Excellence in Mathematics, MHESI, Bangkok 10400, Thailand
*
Authors to whom correspondence should be addressed.
Mathematics 2026, 14(2), 262; https://doi.org/10.3390/math14020262
Submission received: 17 December 2025 / Revised: 6 January 2026 / Accepted: 7 January 2026 / Published: 9 January 2026

Abstract

In this paper, we introduce a new class of proximal connected-image contractions in the framework of b-metric spaces endowed with a directed graph. By employing auxiliary functions, we establish several existence and uniqueness results for best proximity points and fixed points under appropriate contractive conditions. To demonstrate the applicability of our theoretical findings, we apply the main results to a class of fractional differential equations, showing the effectiveness of the proposed approach.

1. Introduction

Fractional differential equations have emerged as a powerful tool for modeling economic and environmental processes, particularly in agricultural and resource-based systems, since their ability to capture memory and hereditary effects makes them especially suitable for describing long-term dependencies, delayed responses, and cumulative dynamics in economic activities such as investment behavior, production dynamics, market evolution, and risk-controlled financial systems [1,2], as well as in environmental and agricultural applications including crop growth, pest population control, soil moisture evolution, irrigation dynamics, and sustainable resource management, where the nonlocal structure of fractional derivatives accurately reflects historical environmental influences on long-term ecological balance and productivity [3,4]. From a theoretical perspective, the applicability and reliability of fractional models depend critically on the existence and uniqueness of their solutions. In this context, fixed point theory provides one of the most effective analytical frameworks for establishing well-posedness results for fractional differential equations. A wide range of existence and uniqueness results for fractional models has been obtained using fixed point techniques [5,6]. Consequently, the qualitative analysis of fractional differential equations via fixed point methods has become a central topic in modern applied mathematics, forming a rigorous foundation for their use in economic and environmental applications.
Over the past decades, fixed point theory has experienced substantial growth through the introduction of new geometric and algebraic structures that extend the classical metric framework. In a standard metric space, the distance function satisfies non-negativity, symmetry, and the usual triangle inequality, and Banach’s contraction principle guarantees the existence and uniqueness of a fixed point for contraction mappings on complete metric spaces, making it one of the most fundamental tools in nonlinear analysis. To broaden this classical setting, Czerwik [7] introduced in 1993 the notion of a b-metric space by relaxing the strict triangle inequality via a multiplicative constant s 1 , a generalization that has proved particularly effective in problems involving nonstandard contractions and irregular geometric structures, as defined in Definition 1.
Definition 1
([7]). Let X be a nonempty set. A function d s : X × X [ 0 , ) is called a b-metric on X if, for all a , b , c X and for some constant s 1 , it satisfies the following conditions:
d s ( a , b ) = 0 if and only if a = b ,
d s ( a , b ) = d s ( b , a ) ,
d s ( a , c ) s [ d s ( a , b ) + d s ( b , c ) ] .
Additionally, the pair ( X , d s ) is known as a b-metric space.
As a result, a wide range of fixed point results has been established in b-metric spaces, offering enhanced flexibility for existence and uniqueness theory. It is worth observing that every classical metric space is a particular case of a b-metric space corresponding to the choice s = 1 . Subsequently, in 1998, Czerwik [8] extended the analytical structure of b-metric spaces by introducing appropriate notions of Cauchy sequences, convergence, and completeness.
Definition 2
([8]). Let ( X , d s ) be a b-metric space and let { a n } be a sequence in X. For any ε > 0 and n , m N .
The sequence { a n } is said to be Cauchy if there exists N N such that d s ( a n , a m ) < ε for all n , m N .
The sequence { a n } is said to converge to a X if there exists N N such that d s ( a n , a ) < ε for all n N .
The space ( X , d s ) is called complete if every Cauchy sequence in X converges to a point of X.
While classical fixed point theorems guarantee the existence of points that remain invariant under a given mapping, many practical problems, particularly in optimization and approximation theory, arise in settings where such mappings do not possess fixed points. In these situations, the theory of best proximity points becomes indispensable, as it ensures the existence of points that minimize the distance between the domain and codomain, especially in the case of cyclic mappings or disjoint sets. Consequently, best proximity theory has emerged as a natural and powerful extension of classical fixed point methods. Alongside this development, fixed point theory has continued to expand through the introduction of new geometric and algebraic structures. In particular, the incorporation of graph-theoretic frameworks has provided a flexible and effective setting for dealing with discontinuous operators, order-type relations, and complex interaction systems. In this direction, Jachymski [9] made a significant contribution in 2008 by establishing fixed point results in metric spaces endowed with a directed graph G and by introducing the notion of G -continuity, which allows the classical Banach contraction principle to be extended to mappings defined along graph edges. As a result, numerous authors have developed graph-based fixed point theorems that refine and generalize the classical results of Banach and others, thereby broadening the applicability of fixed point techniques to differential and fractional equations. More recently, the use of auxiliary functions, including altering distance functions, simulation functions, and admissible control functions, has further enriched both fixed point and best proximity point theory by enabling the formulation of more general and unifying contraction conditions.
Motivated by the growing interest in fixed point theory on metric-type spaces equipped with graph structures, several recent works have explored the interplay between auxiliary functions, generalized metrics, and directed graphs. In particular, Karapınar et al. [10] employed auxiliary function techniques to establish fixed point results for fractional differential equations, highlighting their effectiveness in nonlocal and nonlinear settings. Building on this idea, Suebcharoen et al. (2023) [6] investigated fixed point theorems in spaces endowed with directed graphs, demonstrating that graph-based structures provide a flexible framework for handling complex dependencies in generalized metric spaces, including b-metric spaces. On the applied side, fractional differential models have received increasing attention due to their ability to capture memory and hereditary effects; for instance, recent works in [11,12] illustrate the relevance of fractional dynamics in realistic biological systems. Collectively, these developments underscore the importance of graph-based fixed point techniques and auxiliary functions in both theoretical and applied contexts. Motivated by these advances, we introduce a new class of proximal connected-image contractions in b-metric spaces endowed with directed graphs and investigate the existence of best proximity points. Our results yield explicit fixed point criteria and are further applied to fractional differential equations, demonstrating the effectiveness of the proposed framework.

2. Main Results

In this section, we develop the theoretical framework needed to establish the existence of best proximity points and fixed points for proximal connected-image contractions in b-metric spaces endowed with directed graphs. Our main goal is to combine the geometric structure of b-metric spaces, the order structure induced by the graph, and the flexibility provided by auxiliary functions into a unified analytical setting. Throughout this work, let ( X , d s , μ , G ) denote a structure satisfying the following assumptions:
X , and ( X , d s ) is a b-metric space with s 1 ,
X is endowed with a directed graph G = ( V ( G ) , E ( G ) ) , where V ( G ) denotes the vertex set and E ( G ) denotes the edge set, which contains all loops but no parallel edges,
μ is a mapping from A to B, where A and B are nonempty closed subsets of X.
The distance between A and B is measured by the standard infimum distance
d s ( A , B ) = inf { d s ( a , b ) : a A , b B } .
In many applications, this minimal distance is not zero, which prevents the existence of fixed points. This motivates the introduction of best proximity points, which serve as natural substitutes for fixed points in such settings. To facilitate their study, we also define the sets
A 0 = { a A : d s ( a , b ) = d s ( A , B ) for some b B }
and
B 0 = { b B : d s ( a , b ) = d s ( A , B ) for some a A } .
These sets consist precisely of the points that attain the minimal distance between the two sets. To incorporate both the b-metric structure and the graph framework into a single object, we now introduce the notion of a proximal connected-image set, which plays a central role in our approach.
Definition 3.
Given ( X , d s , μ , G ) , for each x X , we call the set
C ( x , μ ) = { a A : d s ( a , μ x ) = d s ( A , B ) }
the proximal connected-image set of x if the mapping μ has the property C I , that is,
i f a C ( x , μ ) a n d ( x , μ x ) E ( G ) , t h e n ( a , μ a ) E ( G ) .
Property C I guarantees that whenever a point x is connected to its image μ x , every proximal point a of μ x remains connected to its own image μ a . This condition plays a key role in preserving graph admissibility along proximal sequences. Motivated by the notion of G -continuity in [9] and adapted to our framework, we introduce the following modified concept of continuity for the mapping μ .
Definition 4.
Given ( X , d s , μ , G ) , the mapping μ is said to be G P -continuous if, for every a A , there exists a sequence { a n } A such that ( a n , μ a n ) E ( G ) for all n N , and
a n a implies μ a n μ a .
This definition ensures that μ preserves the convergence of sequences that respect the edge structure of the graph, which is essential for passing to the limit in iterative constructions. In particular, if the sequence { a n } satisfies μ a n = a n + 1 for all n N , then G P -continuity coincides with the classical notion of G -continuity. In this case, the sequence { ( a n , μ a n ) } = { ( a n , a n + 1 ) } consists of edges of G , and the preservation of convergence reduces exactly to G -continuity in the sense of [9]. Therefore, G P -continuity extends G -continuity to the proximal and non-self framework.
We now recall the notion of a best proximity point, which generalizes the concept of a fixed point when the domain and codomain do not intersect. A point x A is called a best proximity point of μ if it satisfies
d s ( x , μ x ) = d s ( A , B ) .
The set of all best proximity points of μ is denoted by
B P ( μ ) = { x X : x is a best proximity point of μ } .
Remark 1.
Given ( X , d s , μ , G ) , if x C ( x , μ ) , then x B P ( μ ) .
In order to ensure that the iterative procedure leading to best proximity points can be properly initiated, we introduce the following initial connected-image set.
Definition 5.
Given ( X , d s , μ , G ) , the initial connected-image set is defined as
I μ = { x A : ( x , μ x ) E ( G ) and μ ( A ) B 0 } .
The following lemma guarantees that such an iterative process is always well-defined and converges to a best proximity point under suitable continuity assumptions.
Lemma 1.
Given ( X , d s , μ , G ) , if there exists a 0 I μ and μ has the property C I , then there exists a sequence { a n } A such that a n + 1 belongs to the proximal connected-image set C ( a n , μ ) for all n 0 . Moreover, if μ is G P -continuous and a n a in A, then a B P ( μ ) .
Proof. 
By the assumption, there exists a 0 A such that ( a 0 , μ a 0 ) E ( G ) and μ ( A ) B 0 . Since μ a 0 μ ( A ) , there exists a 1 A such that
d s ( a 1 , μ a 0 ) = d s ( A , B ) ,
which implies that a 1 C ( a 0 , μ ) . Moreover, from ( a 0 , μ a 0 ) E ( G ) and μ has the property C I , it follows that ( a 1 , μ a 1 ) E ( G ) . Then C ( a 0 , μ ) is the proximal connected-image set. By iterating this argument, we obtain a sequence { a n } A such that, for every n 0 ,
d s ( a n + 1 , μ a n ) = d s ( A , B ) ,
that is, a n + 1 C ( a n , μ ) . Consequently, we also have
( a n + 1 , μ a n + 1 ) E ( G ) for all n 0 .
Then C ( a n , μ ) is the proximal connected-image set for all n 0 . Now, assume that μ is G P -continuous and that a n a in A. From (2) and the definition of G P -continuity, it follows that μ a n μ a . Passing to the limit in (1) as n , we obtain
d s ( a , μ a ) = d s ( A , B ) .
Therefore, a B P ( μ ) . □
We next introduce a class of auxiliary functions that plays a central role in formulating the contractive condition for proximal connected-image mappings and in establishing our main existence results. Let A be the class of all auxiliary functions A : X 4 0 , 1 s satisfying
if lim n A ( a n , b n , x n , y n ) = 1 s , then lim n d s ( a n , b n ) = 0 or lim n d s ( x n , y n ) = 0 ,
for all sequences { a n } , { b n } , { x n } , and { y n } in X such that the sequences { d s ( a n , b n ) } and { d s ( x n , y n ) } are decreasing, where ( X , d s ) is a b-metric space with s 1 .
Example 1.
The following are examples of functions A A when s 1 , which illustrate both simple and nonlinear choices of auxiliary functions.
(1) 
A ( a , b , x , y ) = c for 0 < c < 1 .
(2) 
A ( a , b , x , y ) = 0 if x = y , arctan ( d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | ) s ( d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | ) if x y .
Classical contraction principles are often inadequate in graph-based and non-self settings, where proximity is realized through best proximity pairs rather than fixed points. To overcome this limitation, we introduce R- and M-type proximal connected-image contractions, which generalize and refine existing contraction conditions by combining auxiliary control functions with structured distance comparisons on proximal connected-image sets. The R-type contraction measures contractiveness through rational and additive combinations of distances involving both domain and image points, while the M-type contraction further extends this framework by employing a maximum-based control function that allows greater flexibility and covers a wider class of nonlinear behaviors. This distinction enables our approach to unify several known contraction principles and adapt them effectively to b-metric spaces endowed with a directed graph.
Definition 6.
Given ( X , d s , μ , G ) , a mapping μ is said to be a proximal connected-image contraction of type R if, for each a , b , x , y X with ( a , b ) C ( x , μ ) × C ( y , μ ) , where C ( x , μ ) and C ( y , μ ) are proximal connected-image sets. Then there exists A A such that
d s ( a , b ) A ( a , b , x , y ) R ( a , b , x , y ) ,
where R : X 4 [ 0 , ) is defined by
R ( a , b , x , y ) = max { d s ( x , a ) d s ( y , b ) d s ( x , y ) + | d s ( x , y ) d s ( x , a ) | ,       d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | ,       d s ( x , a ) + | d s ( x , y ) d s ( y , b ) | ,       d s ( y , b ) + | d s ( x , y ) d s ( x , a ) | ,     d s ( x , b ) + d s ( y , a ) + s | d s ( x , a ) d s ( y , b ) | 2 s } .
This definition extends classical contraction conditions by incorporating both the auxiliary function and the geometric structure induced by the proximal connected-image sets and the b-metric. The following lemma describes the fundamental behavior of the iterative sequence generated under such contractive mappings and serves as a key step toward proving the main results.
Lemma 2.
Given ( X , d s , μ , G ) , if μ is a proximal connected-image contraction of type R and there exists a 0 I μ and μ has the property C I , then there exists a sequence { a n } such that
(i) 
if d s ( a n , a n + 1 ) = 0 for some n 0 , then a n B P ( μ ) ,
(ii) 
if d s ( a n , a n + 1 ) 0 for all n 0 , then lim n d s ( a n , a n + 1 ) = 0 .
Proof. 
( i ) By Lemma 1, the sequence satisfies a n + 1 C ( a n , μ ) for all n 0 . Suppose that d s ( a k , a k + 1 ) = 0 for some k 0 . Then a k = a k + 1 , and hence a k = a k + 1 C ( a k , μ ) . By Remark 1, it follows that a k B P ( μ ) .
( i i ) By Lemma 1, there exists a sequence { a n } A such that C ( a n , μ ) and C ( a n + 1 , μ ) are proximal connected-image sets, and
( a n + 1 , a n + 2 ) C ( a n , μ ) × C ( a n + 1 , μ ) for all n 0 .
Since μ is a proximal connected-image contraction of type R , for each n 0 and s 1 , we obtain
d s ( a n + 1 , a n + 2 ) A ( a n + 1 , a n + 2 , a n , a n + 1 ) R ( a n + 1 , a n + 2 , a n , a n + 1 ) 1 s R ( a n + 1 , a n + 2 , a n , a n + 1 ) R ( a n + 1 , a n + 2 , a n , a n + 1 ) .
Moreover, a direct computation shows that
R ( a n + 1 , a n + 2 , a n , a n + 1 ) = max { d s ( a n + 2 , a n + 1 ) , d s ( a n , a n + 1 ) + | d s ( a n , a n + 1 ) d s ( a n + 1 , a n + 2 ) | , d s ( a n , a n + 2 ) + s | d s ( a n , a n + 1 ) d s ( a n + 1 , a n + 2 ) | 2 s } .
Let us define
ϕ n = d s ( a n , a n + 1 ) , n 0 .
Since ( X , d s ) is a b-metric space with constant s 1 , we have
d s ( a n , a n + 2 ) s [ d s ( a n , a n + 1 ) + d s ( a n + 1 , a n + 2 ) ] .
Hence, it follows that
R ( a n + 1 , a n + 2 , a n , x n + 1 ) max ϕ n + 1 , ϕ n + | ϕ n ϕ n + 1 | , ϕ n + ϕ n + 1 + | ϕ n ϕ n + 1 | 2 .
Assume that the sequence { ϕ n } is not decreasing. Then there exists some K N such that
ϕ K ϕ K + 1 .
Consequently, we obtain
R ( a K + 1 , a K + 2 , a K , a K + 1 ) ϕ K + 1 .
Using inequality (4), we deduce
1 s ϕ K + 1 ϕ K + 1 A ( a K + 1 , a K + 2 , a K , a K + 1 ) R ( a K + 1 , a K + 2 , a K , a K + 1 ) 1 s ϕ K + 1 .
Since d s ( a n , a n + 1 ) 0 for all n 0 , we have ϕ K + 1 = d s ( a K + 1 , a K + 2 ) > 0 , which implies
A ( a K + 1 , a K + 2 , a K , a K + 1 ) = 1 s .
However, since A A , this yields
d s ( a K + 1 , a K + 2 ) = 0 or d s ( a K , a K + 1 ) = 0 ,
which is a contradiction. Therefore, the sequence { ϕ n } must be decreasing; that is,
ϕ n > ϕ n + 1 for all n 0 .
As a result, we obtain
R ( a n + 1 , a n + 2 , a n , a n + 1 ) max { ϕ n + 1 , 2 ϕ n ϕ n + 1 , ϕ n } = R * ( n ) .
Since { ϕ n } is decreasing and bounded below, it converges. Thus,
lim n ϕ n = ϕ 0 .
Now, suppose that ϕ > 0 . Then
lim n R * ( n ) = ϕ > 0 .
From inequality (4), it follows that
1 s ϕ n + 1 = 1 s d s ( a n + 1 , a n + 2 ) d s ( a n + 1 , a n + 2 ) A ( a n + 1 , a n + 2 , a n , a n + 1 ) R * ( n ) 1 s R * ( n ) .
Taking the limit as n in the above inequality, we obtain
1 s = lim n 1 s ϕ n + 1 R * ( n ) lim n A ( a n + 1 , a n + 2 , a n , a n + 1 ) 1 s .
Therefore,
lim n A ( a n + 1 , a n + 2 , a n , a n + 1 ) = 1 s .
By the definition of the auxiliary function A , this implies that either
lim n d s ( a n + 1 , a n + 2 ) = lim n ϕ n + 1 = 0 ,
or
lim n d s ( a n , a n + 1 ) = lim n ϕ n = 0 .
Both alternatives contradict our earlier assumption that ϕ > 0 . Hence, we must have
lim n d s ( a n , a n + 1 ) = ϕ = 0 .
To prove the existence of best proximity points, we combine proximal connected-image contractions with G P -continuity. The following result guarantees the existence of at least one best proximity point for μ .
Theorem 1.
Let ( X , d s , μ , G ) be a given structure, where μ is a proximal connected-image contraction of type R and is G P -continuous. If there exists a 0 I μ and μ has the property C I , then B P ( μ ) .
Proof. 
By Lemma 1, there exists a sequence { a n } A such that, for all n 0 ,
d s ( a n + 1 , μ a n ) = d s ( A , B ) ,
that is, a n + 1 C ( a n , μ ) . Consequently,
( a n + 1 , μ a n + 1 ) E ( G ) for all n 0 .
Then C ( a n , μ ) is the proximal connected-image set for all n 0 . If d s ( a k , a k + 1 ) = 0 for some k 0 , then by Lemma 2 we immediately obtain a k B P ( μ ) . Hence, we may assume that
d s ( a n , a n + 1 ) 0 for all n N .
Again by Lemma 2, we have
lim n d s ( a n , a n + 1 ) = 0 .
We now show that { a n } is a Cauchy sequence. Suppose, on the contrary, that { a n } is not Cauchy. Then there exists ϵ > 0 such that for every k N , there are integers n k > m k k with n k minimal satisfying
d s ( a m k , a n k ) ϵ and d s ( a m k , a n k 1 ) < ϵ .
From (8) and the b-triangular inequality, we have
ϵ d s ( a m k , a n k ) s ( d s ( a m k , a m k + 1 ) + d s ( a m k + 1 , a n k ) ) .
Rewriting this yields
1 s ϵ d s ( a m k , a n k ) s d s ( a m k , a m k + 1 ) + d s ( a m k + 1 , a n k ) .
Letting k and using (7), we obtain
1 s ϵ lim sup k   d s ( a m k + 1 , a n k ) .
Next, we have
R ( a m k + 1 , a n k , a m k , a n k 1 ) max { d s ( a m k , a m k + 1 ) d s ( a n k , a n k 1 ) d s ( a m k , a n k 1 ) + d s ( a m k , a n k 1 ) + d s ( a m k , a m k + 1 ) ,       d s ( a m k , a n k 1 ) + d s ( a m k , a m k + 1 ) + d s ( a n k 1 , a n k ) ,       d s ( a m k , a m k + 1 ) + d s ( a m k , a n k 1 ) + d s ( a n k 1 , a n k ) ,       d s ( a n k 1 , a n k ) + d s ( a m k , a n k 1 ) + d s ( a m k , a m k + 1 ) ,       d s ( a m k , a n k ) + d s ( a n k 1 , a m k + 1 ) + s d s ( a m k , a m k + 1 ) + s d s ( a n k 1 , a n k ) 2 s } .
Applying the b-triangular inequality gives
d s ( a m k , a n k ) + d s ( a n k 1 , a m k + 1 ) s ( d s ( a m k , a n k 1 ) + d s ( a n k 1 , a n k ) ) + s ( d s ( a n k 1 , a m k ) + d s ( a m k , a m k + 1 ) ) s ϵ + s d s ( a n k 1 , a n k ) ) + s ϵ + s d s ( a m k , a m k + 1 ) = 2 s ϵ + s d s ( a n k 1 , a n k ) ) + s d s ( a m k , a m k + 1 ) .
Substituting (8) and (10) into (9) gives
R ( a m k + 1 , a n k , a m k , a n k 1 ) max { d s ( a m k , a m k + 1 ) d s ( a n k , a n k 1 ) d s ( a m k , a n k 1 ) + ϵ + d s ( a m k , a m k + 1 ) ,       ϵ + d s ( a m k , a m k + 1 ) + d s ( a n k 1 , a n k ) ,       d s ( a m k , a m k + 1 ) + ϵ + d s ( a n k 1 , a n k ) ,       d s ( a n k 1 , a n k ) + ϵ + d s ( a m k , a m k + 1 ) ,       2 s ϵ + 2 s d s ( a n k 1 , a n k ) ) + 2 s d s ( a m k , a m k + 1 ) 2 s } .
Thus,
lim sup k   R ( a m k + 1 , a n k , a m k , a n k 1 ) ϵ .
From (5) and (6),
( a m k + 1 , a n k ) C ( a m k , μ ) × C ( a n k 1 , μ ) ,
and hence,
d s ( a m k + 1 , a n k ) A ( a m k + 1 , a n k , a m k , a n k 1 ) R ( a m k + 1 , a n k , a m k , a n k 1 ) 1 s R ( a m k + 1 , a n k , a m k , a n k 1 ) .
Since (7), letting k gives
1 s ϵ lim sup k   d s ( a m k + 1 , a n k ) lim sup k   A ( a m k + 1 , a n k , a m k , a n k 1 ) R ( a m k + 1 , a n k , a m k , a n k 1 ) lim sup k   A ( a m k + 1 , a n k , a m k , a n k 1 ) ϵ 1 s ϵ .
Thus,
lim sup k   A ( a m k + 1 , a n k , a m k , a n k 1 ) = 1 s ,
which yields
lim k d s ( a m k + 1 , a n k ) = 0 or lim k d s ( a m k , a n k 1 ) = 0 .
Finally, using (8) and the b-triangular inequality,
0 < ϵ d s ( a m k , a n k ) s ( d s ( a m k , a m k + 1 ) + d s ( a m k + 1 , a n k ) ) ,
and similarly,
0 < ϵ d s ( a m k , a n k ) s ( d s ( a m k , a n k 1 ) + d s ( a n k 1 , a n k ) ) .
Letting k and using (7) and (11), we obtain
lim k d s ( a m k , a n k ) = 0 ,
contradicting (8). Therefore, { a n } is Cauchy. By the completeness of X and A is closed, there exists a A such that
lim n d s ( a n , a ) = 0 .
By the G P -continuity of μ and Lemma 1, we conclude that a is a best proximity point of μ , that is, a B P ( μ ) . □
To capture a contractive behavior governed by rational and mixed distance expressions, we define another class of proximal connected-image contractions of type M as follows.
Definition 7.
Given ( X , d s , μ , G ) , a mapping μ is said to be a proximal connected-image contraction of type M if, for each a , b , x , y X with ( a , b ) C ( x , μ ) × C ( y , μ ) , where C ( x , μ ) and C ( y , μ ) are proximal connected-image sets. Then there exists A A such that
d s ( a , b ) A ( a , b , x , y ) M ( a , b , x , y ) ,
where M : X 4 [ 0 , ) is defined by
M ( a , b , x , y ) = max { d s ( x , a ) [ 1 + d s ( y , b ) ] 1 + d s ( x , y ) + | d s ( x , y ) d s ( x , a ) | , d s ( y , b ) [ 1 + d s ( x , a ) ] 1 + d s ( x , y ) + | d s ( x , y ) d s ( x , a ) | , d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | } .
The following lemma establishes two fundamental properties of the iterative sequence generated by a proximal connected-image contraction of type M .
Lemma 3.
Given ( X , d s , μ , G ) , if μ is a proximal connected-image contraction of type M and there exists a 0 I μ and μ has the property C I , then there exists a sequence { a n } such that
(i) 
if d s ( a n , a n + 1 ) = 0 for some n 0 , then a n B P ( μ ) ,
(ii) 
if d s ( a n , a n + 1 ) 0 for all n 0 , then lim n d s ( a n , a n + 1 ) = 0 .
Proof. 
( i ) The proof is identical to that of Lemma 2.
( i i ) By Lemma 1, there exists a sequence { a n } A such that C ( a n , μ ) and C ( a n + 1 , μ ) are proximal connected-image sets, and
( a n + 1 , a n + 2 ) C ( a n , μ ) × C ( a n + 1 , μ ) for all n 0 .
Since μ is a proximal connected-image contraction of type M , for each n 0 and s 1 , we obtain
d s ( a n + 1 , a n + 2 ) A ( a n + 1 , a n + 2 , a n , a n + 1 ) M ( a n + 1 , a n + 2 , a n , a n + 1 ) 1 s M ( a n + 1 , a n + 2 , a n , a n + 1 ) M ( a n + 1 , a n + 2 , a n , a n + 1 ) .
Moreover, a direct computation shows that
M ( a n + 1 , a n + 2 , a n , a n + 1 ) = max { d s ( a n , a n + 1 ) [ 1 + d s ( a n + 1 , a n + 2 ) ] 1 + d s ( a n , a n + 1 ) , d s ( a n + 1 , a n + 2 ) , d s ( a n , a n + 1 ) + | d s ( a n , a n + 1 ) d s ( a n + 1 , a n + 2 ) | } .
Let us define
ϕ n = d s ( a n , a n + 1 ) , n 0 .
We have
M ( a n + 1 , a n + 2 , a n , a n + 1 ) = max ϕ n ( 1 + ϕ n + 1 ) 1 + ϕ n , ϕ n + 1 , ϕ n + | ϕ n ϕ n + 1 | .
Assume that the sequence { ϕ n } is not decreasing. Then there exists an integer K N such that ϕ K ϕ K + 1 . Consequently, we obtain
M ( a K + 1 , a K + 2 , a K , a K + 1 ) = ϕ K + 1 .
Using inequality (12), we have
1 s ϕ K + 1 ϕ K + 1 A ( a K + 1 , a K + 2 , a K , a K + 1 ) M ( a K + 1 , a K + 2 , a K , a K + 1 ) 1 s ϕ K + 1 .
By applying the same argument as in the proof of Lemma 2, it follows that { ϕ n } must be a decreasing sequence, that is, ϕ n > ϕ n + 1 for all n 0 . Hence, we obtain
M ( a n + 1 , a n + 2 , a n , a n + 1 ) = max ϕ n ( 1 + ϕ n + 1 ) 1 + ϕ n , ϕ n + 1 , 2 ϕ n ϕ n + 1 .
Since { ϕ n } is bounded below, the sequence converges, and therefore
lim n ϕ n = ϕ 0 ,
which implies
lim n M ( a n + 1 , a n + 2 , a n , a n + 1 ) = ϕ .
Suppose, on the contrary, that ϕ > 0 . Then
lim n ϕ n = ϕ > 0 .
From inequality (12), we obtain
1 s ϕ n + 1 = 1 s d s ( a n + 1 , a n + 2 ) d s ( a n + 1 , a n + 2 ) ) A ( a n + 1 , a n + 2 , a n , a n + 1 ) M ( a n + 1 , a n + 2 , a n , a n + 1 ) 1 s M ( a n + 1 , a n + 2 , a n , a n + 1 ) .
Taking the limit as n in the above inequality yields
1 s = lim n 1 s ϕ n + 1 M ( a n + 1 , a n + 2 , a n , a n + 1 ) lim n A ( a n + 1 , a n + 2 , a n , a n + 1 ) 1 s .
Therefore,
lim n A ( a n + 1 , a n + 2 , a n , a n + 1 ) = 1 s .
By the definition of auxiliary functions, it follows that
lim n d s ( a n + 1 , a n + 2 ) = lim n ϕ n + 1 = 0
or
lim n d s ( a n , a n + 1 ) = lim n ϕ n = 0 ,
which contradicts the assumption that ϕ > 0 . Hence,
lim n d s ( a n , a n + 1 ) = ϕ = 0 .
Using the convergence properties established in the previous lemma for proximal connected-image contractions of type M , we now prove the existence of best proximity points under the additional assumption of G P -continuity.
Theorem 2.
Let ( X , d s , μ , G ) be a given structure, where μ is a proximal connected-image contraction of type M and is G P -continuous. If there exists a 0 I μ and μ has the property C I , then B P ( μ ) .
Proof. 
The proof follows the same framework as that of Theorem 1. Hence, there exists a sequence { a n } A such that, C ( a n , μ ) is the proximal connected-image set for all n 0 . If d s ( a k , a k + 1 ) = 0 for some k 0 , then by Lemma 3 we immediately obtain a k B P ( μ ) . Hence, we may assume that
d s ( a n , a n + 1 ) 0 for all n N .
Again by Lemma 3, we have
lim n d s ( a n , a n + 1 ) = 0 .
We now show that { a n } is a Cauchy sequence. Suppose, on the contrary, that { a n } is not Cauchy. Then there exists ϵ > 0 such that for every k N , there are integers n k > m k k with n k minimal satisfying
d s ( a m k , a n k ) ϵ and d s ( a m k , a n k 1 ) < ϵ .
By applying the same line of reasoning as in the proof of Theorem 1, we obtain that
M ( a m k + 1 , a n k , a m k , a n k 1 ) max { d s ( a m k , a m k + 1 ) [ 1 + d s ( a n k 1 , a n k ) ] 1 + d s ( a m k , a n k 1 ) + ϵ + d s ( a m k , a m k + 1 ) , d s ( a n k 1 , a n k ) [ 1 + d s ( a m k , a m k + 1 ) ] 1 + d s ( a m k , a n k 1 ) + ϵ + d s ( a m k , a m k + 1 ) , ϵ + d s ( a m k , a m k + 1 ) + d s ( a n k 1 , a n k ) } .
Using (13), we deduce that
lim sup k   M ( a m k + 1 , a n k , a m k , a n k 1 ) ϵ .
We observe that ( a m k + 1 , a n k ) C ( a m k , μ ) × C ( a n k 1 , μ ) . Hence, we conclude that
d s ( a m k + 1 , a n k ) A ( a m k + 1 , a n k , a m k , a n k 1 ) M ( a m k + 1 , a n k , a m k , a n k 1 ) 1 s M ( a m k + 1 , a n k , a m k , a n k 1 ) .
Since (13), letting k in the above inequality yields
1 s ϵ lim sup k   d s ( a m k + 1 , a n k ) lim sup k   A ( a m k + 1 , a n k , a m k , a n k 1 ) M ( a m k + 1 , a n k , a m k , a n k 1 ) lim sup k   A ( a m k + 1 , a n k , a m k , a n k 1 ) ϵ 1 s ϵ .
Following the same arguments as those used in the proof of Theorem 1, it follows that the sequence { a n } is a Cauchy sequence in ( X , d s ) . By the completeness of the b-metric space and A is closed, there exists an element a A such that
lim n d s ( a n , a ) = 0 .
By the G P -continuity of μ and Lemma 1, we conclude that a is a best proximity point of μ , that is, a B P ( μ ) . □
The following theorem establishes the uniqueness of the best proximity point under the hypotheses of Theorem 1 or Theorem 2, provided an additional coincidence condition is satisfied.
Theorem 3.
Assume that all the hypotheses of Theorem 1 (or equivalently, Theorem 2) hold. Suppose further that ( x , y ) C ( x , μ ) × C ( y , μ ) with x y . Then μ admits a unique best proximity point.
Proof. 
Let ( x , y ) C ( x , μ ) × C ( y , μ ) . Suppose, by contradiction, that x y ; then d s ( x , y ) > 0 . Since ( x , y ) C ( x , μ ) × C ( y , μ ) , we obtain
1 s d s ( x , y ) d s ( x , y ) A ( x , y , x , y ) R ( x , y , x , y ) 1 s R ( x , y , x , y ) = 1 s d s ( x , y ) .
Hence, it follows that A ( x , y , x , y ) = 1 s , which implies d s ( x , y ) = 0 . This contradicts the assumption that x and y are distinct points. Therefore, we must have x = y , and thus μ has a unique best proximity point. □
To further illustrate and validate our main results, we now present the following example.
Example 2.
Consider the following setting:
(i) 
Let X = ( R 2 , d s ) be a b-metric space endowed with the directed graph G defined by
E ( G ) = { ( ( a , b ) , ( x , y ) ) X × X : y b } ,
where the b-metric d s is given by
d s ( a 1 , b 1 ) , ( a 2 , b 2 ) = | a 1 a 2 | 2 + | b 1 b 2 | 2 .
(ii) 
Define the sets
A = 0.5 , b : 0 b 0.5
and
B = 1.5 , b : 0 b 0.5 a , 0.5 : 1.5 a 2 .
(iii) 
Define the mapping μ : A B by
μ 0.5 , b = 1.5 , 0.5 ln ( b + 1 ) , for all 0.5 , b A .
Since 0.5 , 0 A , we have
0.5 , 0 , μ 0.5 , 0 = 0.5 , 0 , 1.5 , 0 E ( G ) .
Moreover, since μ ( A ) B 0 , it follows that ( 0.5 , 0 ) I μ . Clearly, the mapping μ is G P -continuous. Next, we show that C ( x , μ ) and C ( y , μ ) are proximal connected-image sets for all x , y A . Let 0.5 , x , 0.5 , a A . Since
0.5 , x , μ 0.5 , x = 0.5 , x , 1.5 , 0.5 ln ( x + 1 ) E ( G ) ,
we obtain x 0.5 ln ( x + 1 ) for all x [ 0 , 0.5 ] . If 0.5 , u C ( x , μ ) , then
d s 0.5 , a , 1.5 , 0.5 ln ( x + 1 ) = d s ( A , B ) = 1 ,
which implies a = 0.5 ln ( x + 1 ) . For all x [ 0 , 0.5 ] , we have 0.5 ln ( x + 1 ) 0 then
0.5 ln ( x + 1 ) ln ( 0.5 ln ( x + 1 ) + 1 ) a ln ( a + 1 ) 0.5 ln ( a + 1 ) .
Therefore,
0.5 , a , μ 0.5 , a E ( G ) ,
and hence C ( x , μ ) is a proximal connected-image set. Likewise, C ( y , μ ) satisfies the same property. Now, define the function A A by
A ( a , b , x , y ) = 0 , if x = y , 1 2 arctan d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | d s ( x , y ) + | d s ( x , a ) d s ( y , b ) | if x y .
Let a , b , x , y A , where
a = 0.5 , a ¯ , b = 0.5 , b ¯ , x = 0.5 , x ¯ , y = 0.5 , y ¯ ,
such that ( a , b ) C ( x , μ ) × C ( y , μ ) , that is,
d s ( a , μ x ) = d s ( A , B ) = d s ( b , μ y ) .
It follows that
a ¯ = 0.5 ln ( 1 + x ¯ ) , b ¯ = 0.5 ln ( 1 + y ¯ ) ,
where x ¯ , y ¯ [ 0 , 0.5 ] . If a = b or x = y , the contraction inequality is trivial. Assume a b and x y . Then a ¯ , b ¯ , x ¯ , y ¯ are all distinct. Consequently, we have the following calculation
d s ( a , b ) = d s ( 0.5 , a ¯ ) , ( 0.5 , b ¯ ) = d s ( 0.5 , 0.5 ln ( x ¯ + 1 ) ) , ( 0.5 , 0.5 ln ( y ¯ + 1 ) ) = | 0.5 ln ( x ¯ + 1 ) 0.5 ln ( y ¯ + 1 ) | 2 = 0.25 ln x ¯ + 1 y ¯ + 1 2 = 0.25 ln 1 + x ¯ y ¯ y ¯ + 1 2 0.5 ln ( 1 + | x ¯ y ¯ | 2 ) 0.5 arctan ( | x ¯ y ¯ | 2 ) 0.5 arctan ( | x ¯ y ¯ | 2 + | x ¯ a ¯ | 2 | y ¯ b ¯ | 2 ) = 1 2 arctan ( | x ¯ y ¯ | 2 + | x ¯ a ¯ | 2 | y ¯ b ¯ | 2 ) | x ¯ y ¯ | 2 + | x ¯ a ¯ | 2 | y ¯ b ¯ | 2 ( | x ¯ y ¯ | 2 + | x ¯ a ¯ | 2 | y ¯ b ¯ | 2 ) = A ( a , b , x , y ) R ( a , b , x , y ) .
Hence, μ is a proximal connected-image contraction of type R . By Theorem 1, we conclude that B P ( μ ) , and 0.5 , 0 is the best proximity point of μ .
Finally, we consider a special case of our main results by assuming that A = B = X . Under this assumption, the best proximity point problem reduces to a fixed point problem. Consequently, the results obtained in the previous sections yield corresponding fixed point theorems. Moreover, in the next section, we shall illustrate the applicability of these fixed point results to fractional differential equations. Under this reduced framework, we introduce the following concepts.
Definition 8.
Given ( X , d s , μ , G ) , a mapping μ is said to be a C I -contraction of type R if the property C I holds for all x , y X and there exists a function A A such that
d s ( μ x , μ y ) A ( μ x , μ y , x , y ) R ( μ x , μ y , x , y ) ,
where R : X 4 [ 0 , ) is defined by
R ( μ x , μ y , x , y ) = max { d s ( x , μ x ) d s ( μ y , y ) d s ( x , y ) + | d s ( x , y ) d s ( x , μ x ) | , d s ( x , y ) + | d s ( x , μ x ) d s ( y , μ y ) | , d s ( x , μ x ) + | d s ( x , y ) d s ( y , μ y ) | , d s ( y , μ y ) + | d s ( x , y ) d s ( x , μ x ) | , d s ( x , μ y ) + d s ( y , μ x ) + s | d s ( x , μ x ) d s ( y , μ y ) | 2 s } .
Definition 9.
Given ( X , d s , μ , G ) , a mapping μ is said to be a C I -contraction of type M if the property C I holds for all x , y X and there exists a function A A such that
d s ( μ x , μ y ) A ( μ x , μ y , x , y ) M ( μ x , μ y , x , y ) ,
where M : X 4 [ 0 , ) is defined by
M ( μ x , μ y , x , y ) = max { d s ( x , μ x ) [ 1 + d s ( y , μ y ) ] 1 + d s ( x , y ) + | d s ( x , y ) d s ( x , μ x ) | , d s ( y , μ y ) [ 1 + d s ( x , μ x ) ] 1 + d s ( x , y ) + | d s ( x , y ) d s ( x , μ x ) | , d s ( x , y ) + | d s ( x , μ x ) d s ( y , μ y ) | } .
For a self-mapping μ : X X , let F ( μ ) denote the set of all fixed points of μ . In this particular case, since A = B = X , it is clear that
F ( μ ) = B P ( μ ) and I μ = { x X : ( x , μ x ) E ( G ) } .
We are now in a position to derive the corresponding fixed point consequences of our main results.
Corollary 1.
Let ( X , d s , μ , G ) be given. Suppose that μ is a C I -contraction of type R and is G P -continuous. If there exists a 0 I μ , then F ( μ ) .
Corollary 2.
Let ( X , d s , μ , G ) be given. Suppose that μ is a C I -contraction of type M and is G P -continuous. If there exists a 0 I μ , then F ( μ ) .

3. Applications to Nonlinear Fractional Differential Equations

In this section, we extend the fixed point results established earlier to the setting of fractional differential equations. Fractional models naturally arise in diverse scientific fields and are well known for their nonlocal behavior, which makes classical analytical techniques difficult to apply directly. By reformulating the fractional differential equation as an equivalent integral equation and invoking the fixed point theorems developed in the previous sections, we obtain conditions guaranteeing the existence of solutions in the fractional framework. This demonstrates that the fixed point approach remains effective not only for standard differential and integral equations but also for their fractional counterparts, further emphasizing the broad applicability of the theory.
To make the fixed point method applicable to the fractional problem, we introduce the structural requirements that the operator must satisfy. These assumptions ensure that the solution map behaves well enough for the existence theory to hold. Let X be a nonempty set, and let γ : X X be a given mapping. Define Γ as the collection of all functions ρ : R 2 R satisfying:
  • For every u X , if ρ ( u , γ u ) 0 , then ρ ( γ u , γ 2 u ) 0 ,
  • For every u , v X , if ρ ( u , v ) 0 and ρ ( v , γ v ) 0 , then ρ ( u , γ v ) 0 .
For each ρ Γ , we define a directed graph
G ρ = ( X , E ( G ρ ) ) , E ( G ρ ) = { ( u , v ) X × X : ρ ( u , v ) 0 } .
This graph structure forms the basis for the subsequent application of our fixed point theorems. In the fractional setting, a fractional differential equation can be rewritten as an equivalent Volterra-type integral equation. We therefore study the problem in the space ( C [ 0 , 1 ] , d s ) equipped with the b-metric
d s ( u , v ) = sup t [ 0 , 1 ] | u ( t ) v ( t ) | 2 ,
which is complete for s = 2 . This framework allows us to apply the abstract fixed point results established earlier and to prove the existence of solutions to fractional differential equations. The following consequence illustrates this application in detail.
Here, we discuss the following nonlinear fractional differential equations with nonlocal integral boundary condition of order α , where n < α n + 1 . Specifically, we consider
D R L α u ( t ) + f ( t , u ( t ) ) = 0 , 0 < t < 1 , u k ( 0 ) = 0 , k = 0 , 1 , 2 , n 1 u ( 1 ) = λ 0 η u ( τ ) d τ ,
where λ > 0 , λ α , f : [ 0 , 1 ] × R R is a given function, and D R L α denotes the Riemann-Liouville fractional derivative of order α , that is,
D R L α u ( t ) = 1 Γ ( n α ) d n d x n 0 t u ( τ ) ( x τ ) α + 1 n d τ if n 1 < α < n , d n d x n u ( t ) if α = n .
Next, we derive the Green’s function associated with the nonlinear fractional Equation (16). This representation will be useful for establishing the existence of solutions.
Lemma 4.
Let n < α n + 1 , 0 < η < 1 , and let y C [ 0 , 1 ] . Consider
D R L α C u ( t ) + y ( t ) = 0 , 0 < t < 1 , u k ( 0 ) = 0 , k = 0 , 1 , 2 , n 1 u ( 1 ) = λ 0 η u ( τ ) d τ ,
with κ : = 1 λ η α α 0 . Then the problem has a unique solution
u ( t ) = 0 1 G ( t , τ ) y ( τ ) d τ ,
where the Green function is
G ( t , τ ) = 1 κ Γ ( α ) κ ( t τ ) α 1 + t α 1 ( 1 τ ) α 1 λ α ( η τ ) α if 0 τ min { t , η } , t α 1 ( 1 τ ) α 1 λ α ( η τ ) α if t τ η , κ ( t τ ) α 1 + t α 1 ( 1 τ ) α 1 if η τ t , t α 1 ( 1 τ ) α 1 if max { t , η } τ 1 .
Proof. 
Since n < α n + 1 , it is well known (see [13]) that the general solution of D R L α u ( t ) = y ( t ) is
u ( t ) = 1 Γ ( α ) 0 t ( t τ ) α 1 y ( τ ) d τ + k = 1 n + 1 C k t α k .
Using the conditions u ( 0 ) = u ( 0 ) = = u ( n 1 ) ( 0 ) = 0 , we directly obtain C k = 0 , for k = 2 , 3 , , n + 1 . Thus
u ( t ) = 1 Γ ( α ) 0 t ( t τ ) α 1 y ( τ ) d τ + C 1 t α 1 .
To compute C n + 1 , we note that
u ( 1 ) = 1 Γ ( α ) 0 1 ( 1 τ ) α 1 y ( τ ) d τ + C 1 ,
and
0 η u ( τ ) d τ = 1 Γ ( α ) 0 η 0 ν ( ν τ ) α 1 y ( τ ) d τ d ν + C 1 η α α .
By reversing the order of integration gives
1 Γ ( α ) 0 η 0 ν ( ν τ ) α 1 y ( τ ) d τ d ν = 1 α Γ ( α ) 0 η ( η τ ) α y ( τ ) d τ
Using the boundary condition u ( 1 ) = λ 0 η u ( τ ) d τ we have
1 Γ ( α ) 0 1 ( 1 τ ) α 1 y ( τ ) d τ + C 1 = λ 1 α Γ ( α ) 0 η ( η τ ) α y ( τ ) d τ + C 1 η α α ,
which implies
C 1 = 1 κ Γ ( α ) 0 1 ( 1 τ ) α 1 y ( τ ) d τ λ α 0 η ( η τ ) α y ( τ ) d τ ,
where κ : = 1 λ η α α 0 . Splitting according to the four possible orders of τ , t, and η produces the piecewise Green function in (18). This completes the proof. □
Remark 2.
It is worth noting that when η = 1 , the integral boundary condition reduces to a local one and the nonlocal effect disappears. In this case, for n = 2 our result reduces to Theorem 2.1 of [14]. Moreover, when n = 3 , our result recovers Theorem 3.1 of [15] under the corresponding parameter identification.
The following lemma provides an essential estimate for the Green’s function associated with problem (16). This bound will be used later to establish the properties required for the existence results.
Lemma 5.
Let n < α n + 1 , 0 < η < 1 , and λ R be such that κ : = 1 λ η α α 0 . The Green function G : [ 0 , 1 ] × [ 0 , 1 ] R defined by Equation (18) satisfies
0 1 G ( t , τ ) 2 d τ σ 2 Γ ( α ) 2 ( 2 α 1 ) ,
where σ : = 1 + 1 | κ | + | λ | α | κ | .
Proof. 
Let t , τ [ 0 , 1 ] . We consider in a first case of | G ( t , τ ) | that 0 τ min { t , η } . In this case, we have
G ( t , τ ) = 1 Γ ( α ) ( t τ ) α 1 + t α 1 κ ( 1 τ ) α 1 λ α ( η τ ) α .
Using the triangle inequality and the fact that 0 τ , t , η 1 , we have
| G ( t , τ ) | 1 Γ ( α ) ( t s ) α 1 + | t α 1 | | κ | ( 1 τ ) α 1 + | t α 1 λ | α | κ | ( η τ ) α 1 Γ ( α ) ( 1 τ ) α 1 + 1 | κ | ( 1 τ ) α 1 + | λ | α | κ | ( 1 τ ) α 1 = σ Γ ( α ) ( 1 τ ) α 1 ,
where σ : = 1 + 1 | κ | + | λ | α | κ | . The same estimates can be carried out for the other three cases in (18), yielding the identical bound as
| G ( t , τ ) | σ Γ ( α ) ( 1 τ ) α 1 , 0 τ , t 1 .
This implies that
0 1 | G ( t , τ ) | 2 d τ σ 2 Γ ( α ) 2 0 1 ( 1 τ ) 2 α 2 d τ = σ 2 Γ ( α ) 2 ( 2 α 1 ) ,
which proves the desired estimate. □
Let us consider the mapping Υ : C [ 0 , 1 ] C [ 0 , 1 ] given by
( Υ u ) ( t ) = 0 1 G ( t , τ ) f ( τ , u ( τ ) ) d τ .
The kernel G ( t , τ ) denotes the Green function associated with the fractional boundary-value problem, while the function f characterizes the nonlinear effects. Rather than working directly with the differential Equation (16), it is often more convenient to interpret a solution as a function that is reproduced by this integral transformation. A function u C [ 0 , 1 ] satisfies the fractional problem exactly when it satisfies the fixed point relation Υ u = u . In this way, the boundary-value problem reduces to locating a fixed point of the operator Υ .
Lemma 6.
Consider the space C [ 0 , 1 ] , d s , Υ , G ρ and the operator Υ is defined in (19). Assume that one of the following conditions holds.
(H1) 
For every τ [ 0 , 1 ] and all u , v C [ 0 , 1 ] , there exists A A such that
f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) Γ ( α ) 2 α 1 σ A ( Υ u , Υ v , u , v ) R ( Υ u , Υ v , u , v ) .
(H2) 
For every τ [ 0 , 1 ] and all u , v C [ 0 , 1 ] , there exists A A such that
f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) Γ ( α ) 2 α 1 σ A ( Υ u , Υ v , u , v ) M ( Υ u , Υ v , u , v ) .
When condition (H1) is imposed, the operator Υ becomes a CI-contraction of type R ; on the other hand, if (H2) is used, then Υ acts as a CI-contraction of type M .
Proof. 
Using the definition of the operator Υ , we have
d s ( Υ u , Υ v ) = sup t [ 0 , 1 ] 0 1 G ( t , τ ) f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) d τ 2 ,
which implies
d s ( Υ u , Υ v ) sup t [ 0 , 1 ] 0 1 G ( t , τ ) g ( τ , u ( τ ) ) g ( τ , v ( τ ) ) d τ 2 .
By applying assumption (H1) to the nonlinear term f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) , it follows that
d s ( Υ u , Υ v ) Γ ( α ) 2 ( 2 α 1 ) σ 2 A ( Υ u , Υ v , u , v ) R ( Υ u , Υ v , u , v ) sup t [ 0 , 1 ] 0 1 | G ( t , τ ) | d τ 2 .
Using Lemma 5, we get
d s ( Υ u , Υ v ) A ( Υ u , Υ v , u , v ) R ( Υ u , Υ v , u , v ) .
By the definition of a CI-contraction of type R , condition (H1) ensures that the operator Υ possesses this property. When (H2) is invoked instead, the same argument shows that Υ operates as a CI-contraction of type M . The proof is complete. □
We are now ready to present the main existence result for the nonlinear fractional differential problem (16), obtained as a consequence of the fixed point framework developed above and Corollaries 1 and 2.
Theorem 4.
Consider the space C [ 0 , 1 ] , d s , Υ , G ρ , where ρ Γ and the operator Υ is given by (19). Assume that one of the conditions (H1) or (H2) is fulfilled. Suppose further that there exists a function u 0 C [ 0 , 1 ] for which ρ u 0 ( t ) , Υ u 0 ( t ) 0 for all t [ 0 , 1 ] . Under these hypotheses, the operator Υ possesses a fixed point u * C [ 0 , 1 ] , and this fixed point provides a solution of the nonlinear fractional differential problem (16).
Although conditions (H1) and (H2) are stated in a general form, their effectiveness relies on concrete and verifiable choices of the auxiliary function A . In the absence of such structure, these assumptions may become overly flexible and difficult to verify in practice. Therefore, in applications, the function A should be specified explicitly in advance and chosen in accordance with the structure of the operator Υ . In what follows, we apply our results to study the existence of solutions for the nonlinear fractional differential Equation (16).
Example 3.
Consider the following nonlocal integral boundary-value problem:
D R L 5 2 u ( t ) + 1 3 arctan ( u 2 ( t ) ) + 1 = 0 , t [ 0 , 1 ] ,
with the boundary conditions:
u ( 0 ) = u ( 0 ) = 0 , u ( 1 ) = 4 0 1 u ( τ ) d τ .
Proof. 
We observe that α = 5 2 ,   λ = 4 and η = 1 , which satisfy condition κ = 3 5 0 and by Lemma 5 we obtain
0 1 | G ( t , τ ) | 2 d τ 64 9 Γ ( 5 / 2 ) 2 = 1024 81 π 4.0241 .
By applying the Cauchy-Schwarz inequality, we have
| Υ u ( t ) Υ v ( t ) | 2 = 1 9 0 1 G ( t , τ ) arctan ( u 2 ( τ ) ) arctan ( v 2 ( τ ) ) d τ 2 1 9 0 1 | G ( t , τ ) | 2 d τ 0 1 | arctan ( u 2 ( τ ) ) arctan ( v 2 ( τ ) ) | 2 d τ 1 2 0 1 | arctan ( u 2 ( τ ) ) arctan ( v 2 ( τ ) ) | 2 d τ .
We let ϕ : [ 0 , ) [ 0 , ) by ϕ ( t ) = arctan ( t 2 ) . We note that
ϕ ( t ) = t ( 1 + t 4 ) arctan ( t 2 ) 0 ,
and ϕ ( 0 ) = 0 by continuity. Hence ϕ is non-decreasing on [ 0 , ) . Direct differentiation yields
ϕ ( t ) = ( 1 3 t 4 ) arctan ( t 2 ) t 2 ( 1 + t 4 ) 2 arctan ( t 2 ) 3 / 2 .
We note that the denominator is strictly positive for t > 0 , so the sign of ϕ ( t ) depends on the numerator. Let x = t 2 0 and define p ( x ) = ( 1 3 x 2 ) arctan ( x ) x . We also have p ( 0 ) = 0 and
p ( x ) = 4 x 2 1 + x 2 6 x arctan ( x ) 0 , for all x 0 ,
Hence p ( x ) 0 for all x 0 , which implies ϕ is concave on ( 0 , ) , and by continuity at t = 0 , it is concave on [ 0 , ) . Since ϕ is concave on [ 0 , ) and ϕ ( 0 ) = 0 , it follows that ϕ is sub-additive, that is, ϕ ( a + b ) ϕ ( a ) + ϕ ( b ) for all a , b 0 . Since ϕ is non-decreasing and sub-additive, using the fact | u ( τ ) | | v ( τ ) | | u ( τ ) v ( τ ) | , we obtain
ϕ ( | u ( τ ) | ) ϕ ( | v ( τ ) | ) ϕ | u ( τ ) | | v ( τ ) | ϕ ( | u ( τ ) v ( τ ) | ) .
That is
arctan ( | u ( τ ) | 2 ) arctan ( | v ( τ ) | 2 ) arctan ( | u ( τ ) v ( τ ) | 2 ) .
Consequently, this implies that
| Υ u ( t ) Υ v ( t ) | 2 1 2 0 1 arctan ( | u ( τ ) v ( τ ) | 2 ) d τ 1 2 arctan ( d s ( u , v ) ) .
By taking the supremum over t [ 0 , 1 ] , one has
d s ( Υ u , Υ v ) 1 2 arctan ( d s ( u , v ) ) .
This suggests us to introduce
A ( Υ u , Υ v , u , v ) = 1 2 if u = v , 1 2 arctan ( d s ( u , v ) ) d s ( u , v ) if u v .
Therefore, we arrive at
d s ( Υ u , Υ v ) A ( Υ u , Υ v , u , v ) R ( Υ u , Υ v , u , v ) .
due to the fact that d s ( u , v ) R ( Υ u , Υ v , u , v ) . Hence, by applying Theorem 4, Υ has a fixed point u * C [ 0 , 1 ] , which is a solution to the problem. □
After establishing existence results for problem (16), we proceed to study positivity of the solutions. The key ingredient in this analysis is the positivity of the Green function associated with the fractional boundary-value problem.
Lemma 7.
Let n < α n + 1 , 0 < η < 1 , and λ > 0 . Assume that κ ( 0 , 1 ) . Then the Green function G ( t , τ ) given by (18) is a non-negative function for all ( t , τ ) [ 0 , 1 ] × [ 0 , 1 ] .
Proof. 
Since Γ ( α ) > 0 and κ > 0 , it suffices to show that the numerator in each branch of G ( t , s ) is nonnegative.
Case 1:
0 τ min { t , η } . Consider
G ( t , s ) = 1 κ Γ ( α ) κ ( t τ ) α 1 + t α 1 ( 1 τ ) α 1 λ α ( η τ ) α .
Here, for 0 τ η , we define Q : [ 0 , η ] R by
Q ( τ ) : = ( 1 τ ) α 1 λ α ( η τ ) α .
We claim that Q ( τ ) κ ( 1 τ ) α 1 , for τ [ 0 , η ] . To prove this, we consider
Q ( τ ) κ ( 1 τ ) α 1 = ( 1 τ ) α 1 λ α ( η τ ) α κ ( 1 τ ) α 1 = λ α η α ( 1 τ ) α 1 ( η τ ) α .
This suggests us to show that η α ( 1 τ ) α 1 ( η τ ) α 0 η α ( 1 τ ) α 1 ( η τ ) α 1 . We let Φ : [ 0 , η ] R + by
Φ ( τ ) = η α ( 1 τ ) α 1 ( η τ ) α .
By taking differential of ln Φ ( τ ) , we see that
Φ ( τ ) Φ ( τ ) = α 1 1 τ + α η τ = ( α 1 ) ( 1 η ) + 1 τ ( 1 τ ) ( η τ ) .
Since Φ ( τ ) > 0 , we can conclude that Φ is strictly increasing. Therefore, we arrive at
Φ ( τ ) = η α ( 1 τ ) α 1 ( η τ ) α Φ ( 0 ) = 1 ,
as expected. That is Q ( τ ) κ ( 1 τ ) α 1 , for τ [ 0 , η ] . We observe that
G ( t , τ ) = 1 κ Γ ( α ) κ ( t τ ) α 1 + t α 1 Q ( τ ) 1 Γ ( α ) t α 1 ( 1 τ ) α 1 ( t τ ) α 1 .
For 0 τ t 1 , we note that t ( 1 τ ) t τ , which implies G ( t , τ ) 0 .
Case 2:
t τ η . In this region, we see that
G ( t , τ ) = t α 1 κ Γ ( α ) Q ( τ ) ,
which directly implies that G ( t , τ ) 0 .
Case 3:
η τ t . Here, we consider
G ( t , τ ) = 1 κ Γ ( α ) κ ( t τ ) α 1 + t α 1 ( 1 τ ) α 1 .
As before, t ( 1 τ ) t τ for 0 τ t 1 and 0 < κ < 1 , we obtain
t α 1 ( 1 τ ) α 1 ( t τ ) α 1 κ ( t τ ) α 1 ,
hence G ( t , τ ) 0 .
Case 4:
max { t , η } τ 1 . In the last region, we have
G ( t , τ ) = t α 1 ( 1 τ ) α 1 κ Γ ( α ) .
Since all factors are nonnegative, then G ( t , τ ) 0 . This completes the proof. □
Let P be the class of positive function P C [ 0 , 1 ] as
P = u C [ 0 , 1 ] | u ( t ) 0 for all t [ 0 , 1 ] .
Based on Lemma 7, it is clear that Υ : P P , when f is positive. Therefore, based on the setting of Theorem 4, we obtain the existence of a positive solution of the nonlinear fractional differential Equation (16).
Theorem 5.
Consider the space P , d s , Υ , G ρ and the operator Υ is given by (19). Assume that κ ( 0 , 1 ) and one of the conditions (H1) or (H2) is fulfilled. Suppose further that there exists a function u 0 P for which ρ u 0 ( t ) , T u 0 ( t ) 0 for all t [ 0 , 1 ] . Under these hypotheses, the operator Υ ; possesses a fixed point u * P , and this fixed point provides a positive solution of the boundary-value problem (16).
Example 4.
Consider the following nonlocal integral boundary-value problem:
D R L 7 2 u ( t ) + f ( t , u ( t ) ) = 0 , t [ 0 , 1 ] ,
where
f ( t , u ( t ) ) = 1 1 + u ( t ) , u ( t ) 0 for t [ 0 , 1 ] ,
together with the boundary conditions:
u ( 0 ) = u ( 0 ) = u ( 0 ) = 0 , u ( 1 ) = 0 η u ( τ ) d τ .
Proof. 
We observe that here α = 7 2 and λ = 1 , which satisfy condition κ = 1 2 7 η 7 / 2 ( 5 7 , 1 ) and by Lemma 5 we obtain
0 1 | G ( t , τ ) | 2 d τ 1 6 Γ ( 7 / 2 ) 2 1 + 9 7 1 2 7 η 7 / 2 2 = 32 675 π 1 + 9 7 1 2 7 η 7 / 2 2 .
Based on the fact that κ = 1 2 7 η 7 / 2 ( 5 7 , 1 ) , we see that
0 1 | G ( t , τ ) | 2 d τ 0.118
By applying the Cauchy-Schwarz inequality, we have
| Υ u ( t ) Υ v ( t ) | 2 = 0 1 G ( t , τ ) f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) d τ 2 0 1 | G ( t , τ ) | 2 d τ 0 1 | f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) | 2 d τ
Let us consider
| f ( τ , u ( τ ) ) f ( τ , v ( τ ) ) | 2 = 1 1 + u ( τ ) 1 1 + v ( τ ) 2 = u ( τ ) v ( τ ) ( 1 + u ( τ ) + v ( τ ) + u ( τ ) v ( τ ) ) 2 | u ( τ ) v ( τ ) | 2 1 + u 2 ( τ ) + v 2 ( τ ) | u ( τ ) v ( τ ) | 2 1 + 1 2 u 2 ( τ ) + 1 2 v 2 ( τ ) u ( τ ) v ( τ )
Using the fact that x 1 + x ln ( 1 + x ) , for x 0 , we get
| Υ u ( t ) Υ v ( t ) | 2 2 0 1 | G ( t , τ ) | 2 d τ 0 1 ln 1 + 1 2 | u ( τ ) v ( τ ) | 2 d τ .
By taking the supremum over t [ 0 , 1 ] , one has
d s ( Υ u , Υ v ) ln 1 + 1 2 d s ( u , v ) .
Here, we define
A ( Υ u , Υ v , u , v ) = 1 2 if u = v , ln 1 + 1 2 d s ( u , v ) d s ( u , v ) if u v .
Therefore, we arrive at
d s ( Υ u , Υ v ) A ( Υ u , Υ v , u , v ) R ( Υ u , Υ v , u , v ) .
due to the fact that d s ( u , v ) R ( Υ u , Υ v , u , v ) . Hence, by applying Theorem 5, Υ has a fixed point u * P , which is a positive solution to the problem. □
Remark 3.
To further illustrate the role of the Green function in the existence of positive solutions, Figure 1 presents a graphical comparison of the Green functions corresponding to Examples 3 and 4. For the parameters in Example 3, the Green function G ( t , τ ) changes sign on [ 0 , 1 ] × [ 0 , 1 ] , and therefore the associated integral operator does not preserve positivity. In contrast, for the parameters in Example 4, the Green function is nonnegative for all ( t , τ ) [ 0 , 1 ] × [ 0 , 1 ] , in agreement with Lemma 7. This comparison explains why the additional assumption κ ( 0 , 1 ) is required to obtain positive solutions in Theorem 5. More generally, it illustrates that the positivity of solutions is governed by the sign of the associated Green’s function.
To illustrate the theoretical results, we compute numerical solutions of the integral equation using a standard Picard fixed point iteration. The integral equation is discretized by a quadrature-based scheme on a uniform grid, and the iteration is performed until convergence in the supremum norm with tolerance 10 8 or until a maximum of 1000 iterations is reached. The numerical solutions reflect the qualitative properties of the underlying Green’s function and the nonlocal boundary condition
u ( 1 ) = 0 η u ( τ ) d τ ,
which couples the endpoint value to the integral of the solution over the interval [ 0 , η ] , with the parameter η controlling the strength of the nonlocal effect. The numerical results are consistent with the theoretical analysis. In Example 3, where κ ( 0 , 1 ) , the associated Green’s function changes sign and the numerical solution is not positive. In contrast, in Example 4, where κ ( 0 , 1 ) , the Green’s function is nonnegative and the numerical solutions remain positive for η = 0.5 , 0.75 , and 1, as shown in Figure 2.

4. Conclusions

This paper introduces a new class of proximal connected-image contractions in b-metric spaces endowed with directed graphs and investigates the existence of best proximity points and fixed points for such mappings. By employing auxiliary functions and proximal structures, explicit and verifiable conditions guaranteeing the existence and uniqueness of best proximity points are established, extending several classical fixed point results within a graph-based framework. The theoretical results are applied to fractional differential equations by reformulating them as equivalent integral equations. Using the developed proximal fixed point principles, sufficient conditions for the existence of solutions to these fractional problems are obtained. These findings show that the proposed proximal approach effectively captures the nonlocal nature of fractional models and provides a robust tool for analyzing both classical and fractional equations.

Author Contributions

Conceptualization, K.C., B.W., A.H. and P.C.; Methodology, K.C., B.W., A.H. and P.C.; Writing—original draft, K.C., B.W., A.H. and P.C.; Writing—review & editing, K.C., B.W., A.H. and P.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by (1) Fundamental Fund 2026, Chiang Mai University, Chiang Mai, Thailand; (2) Chiang Mai University, Chiang Mai, Thailand; and (3) Centre of Excellence in Mathematics, MHESI, Bangkok 10400, Thailand.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Tarasova, V.V.; Tarasov, V.E. Concept of dynamic memory in economics. Commun. Nonlinear Sci. Numer. Simul. 2018, 55, 127–145. [Google Scholar] [CrossRef]
  2. Tarasov, V.E. General Fractional Economic Dynamics with Memory. Mathematics 2024, 12, 2411. [Google Scholar] [CrossRef]
  3. Atangana, A. Fractional Operators with Constant and Variable Order with Application to Geo-Hydrology; Academic Press: Cambridge, MA, USA, 2017. [Google Scholar]
  4. Bachher, M.; Nantu, S. Nonlocal theory of thermoelastic materials with voids and fractional derivative heat transfer. Waves Random Complex Media 2019, 29.4, 595–613. [Google Scholar] [CrossRef]
  5. Wongsaijai, B.; Charoensawan, P.; Suebcharoen, T.; Atiponrat, W. Common Fixed Point Theorems for Auxiliary Functions with Applications in Fractional Differential Equations. Adv. Differ. Equ. 2021, 2021, 503. [Google Scholar] [CrossRef]
  6. Teeranush, S.; Watchareepan, A.; Khuanchanok, C. Fixed Point Theorems via Auxiliary Functions with Applications to Two-Term Fractional Differential Equations with Nonlocal Boundary Conditions. AIMS Math. 2023, 8, 7394–7418. [Google Scholar] [CrossRef]
  7. Czerwik, S. Contraction Mappings in b-Metric Spaces. Acta Math. Inform. Univ. Ostrav. 1993, 1, 5–11. [Google Scholar]
  8. Czerwik, S. Nonlinear Set-Valued Contraction Mappings in b-Metric Spaces. Atti Semin. Mat. Fis. Univ. Modena 1998, 46, 263–276. [Google Scholar]
  9. Jachymski, J. The Contraction Principle for Mappings on a Metric Space with a Graph. Proc. Am. Math. Soc. 2007, 136, 1359–1373. [Google Scholar] [CrossRef]
  10. Karapınar, E.; Abdeljawad, T.; Jarad, F. Applying New Fixed Point Theorems on Fractional and Ordinary Differential Equations. Adv. Differ. Equ. 2019, 2019, 421. [Google Scholar] [CrossRef]
  11. Gundogdu, H.; Joshi, H. Numerical analysis of time-fractional cancer models with different types of net killing rate. Mathematics 2025, 13, 536. [Google Scholar] [CrossRef]
  12. Joshi, H.; Yavuz, M. A novel fractional-order model and analysis of cancer-immune system interaction in an avascular environment with an efficient control mechanism. J. Comput. Appl. Math. 2026, 473, 116888. [Google Scholar] [CrossRef]
  13. Diethelm, K. The Analysis of Fractional Differential Equations: An Application Oriented Exposition Using Differential Operators of Caputo Type; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar] [CrossRef]
  14. Cabada, A.; Hamdi, Z. Nonlinear fractional differential equations with integral boundary value conditions. Appl. Math. Comput. 2014, 228, 251–257. [Google Scholar] [CrossRef]
  15. Shivanian, E. On the existence and uniqueness of the solution of a nonlinear fractional differential equation with integral boundary condition. J. Nonlinear Math. Phys. 2023, 30, 1345–1356. [Google Scholar] [CrossRef]
Figure 1. Comparison of the Green functions G ( t , τ ) for Examples 3 and 4.
Figure 1. Comparison of the Green functions G ( t , τ ) for Examples 3 and 4.
Mathematics 14 00262 g001
Figure 2. The numerical solutions for Examples 3 and 4.
Figure 2. The numerical solutions for Examples 3 and 4.
Mathematics 14 00262 g002
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

Chaichana, K.; Wongsaijai, B.; Himakalasa, A.; Charoensawan, P. Two Types of Proximal Connected-Image Contractions in b-Metric Spaces and Applications to Fractional Differential Models. Mathematics 2026, 14, 262. https://doi.org/10.3390/math14020262

AMA Style

Chaichana K, Wongsaijai B, Himakalasa A, Charoensawan P. Two Types of Proximal Connected-Image Contractions in b-Metric Spaces and Applications to Fractional Differential Models. Mathematics. 2026; 14(2):262. https://doi.org/10.3390/math14020262

Chicago/Turabian Style

Chaichana, Khuanchanok, Ben Wongsaijai, Adsadang Himakalasa, and Phakdi Charoensawan. 2026. "Two Types of Proximal Connected-Image Contractions in b-Metric Spaces and Applications to Fractional Differential Models" Mathematics 14, no. 2: 262. https://doi.org/10.3390/math14020262

APA Style

Chaichana, K., Wongsaijai, B., Himakalasa, A., & Charoensawan, P. (2026). Two Types of Proximal Connected-Image Contractions in b-Metric Spaces and Applications to Fractional Differential Models. Mathematics, 14(2), 262. https://doi.org/10.3390/math14020262

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