Computational and Applied Mathematics (2023) 42:44

https://doi.org/10.1007/s40314-023-02193-1

A unique approach to graph-based metric spaces

with an application to rocket ascension

Mudasir Younis1 · Dhirendra Bahuguna1

Received: 11 August 2022 / Revised: 24 December 2022 / Accepted: 3 January 2023 /

Published online: 17 January 2023
© The Author(s) under exclusive licence to Sociedade Brasileira de Matemática Aplicada e Computacional 2023

Abstract
This article introduces the notion of controlled graphical metric type spaces, which integrates
the concepts of controlled metric type spaces, extended metric type spaces, b−metric type
spaces, and graphical type spaces. The associated topology of the articulated space is also
researched along with the graph structure. Additionally, within the framework of controlled
graphical metric type spaces, we provide various novel fixed point findings that enrich,
enlarge, and renovate a variety of outcomes in the present fixed point analysis. Our findings
provide relevant examples that back up our assertions. Our research is then used to determine
if a nonlinear model of a rocket’s ascending motion has a solution.

Keywords Differential equation · Motion of rocket · Fixed point · Controlled metric type
space

Mathematics Subject Classification 47H09 · 347H10 · 34G20

1 Introduction and preliminaries

The theory of fixed points relies heavily on Banach’s theorem. Many researchers have there-
fore sought to advance and refine this hypothesis. To that purpose, the authors suggest
applying a number of different abstract spaces to some of the notable discoveries (see, e.g.,
Dubey et al. 2019; Mostefaoui et al. 2019; Singh et al. 2018; Younis et al. 2022). A major
inspection activity has been directed at graph theory, which has taken on a crucial role in
continuing research, notably in metric fixed point hypothesis. In the system of graphical
metric spaces and the field of fixed point theory, a few manuscripts have recently come to
light. Here we review some important work that was done in the groundbreaking publica-

Communicated by Leonardo de Lima.

B Mudasir Younis
mudasiryouniscuk@gmail.com; myounis@iitk.ac.in
Dhirendra Bahuguna
dhiren@iitk.ac.in
1 Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, Kanpur, India

123
44 Page 2 of 19 M. Younis, D. Bahuguna

tions (Chuensupantharat et al. 2019; Hussain et al. 2014, 2016; Radenović et al. 2019, 2016;
Singh et al. 2017; Younis et al. 2022) based on diverse applications in this area. As a result,
graphical metric spaces generalize metric spaces since we need not assume that the triangle
inequality holds for all three points in the underlying space. In graphical metric spaces, it
is not essential that the edge (, ν) also holds the contractive condition if it holds for two
other edges, such as (,  ) and (, ν). The concept of graphical metric spaces, which is
a graphical representation of metric spaces, was introduced by Shukla et al. (2017) in this
setting. The concept presented in Shukla et al. (2017) was recently expanded by Chuensupan-
tharat et al. (2019), who also included graphical b-metric spaces and appropriate graphs. The
ideas presented in Chuensupantharat et al. (2019), George et al. (2015) are further extended
by Younis et al. (2019a), displaying a novel structure termed graphical rectangular b-metric
spaces together with a variety of topological features. We direct the reader to the notable
and instructive article de Hierro and Shahzad (2017) for a comprehensive explanation of the
graphical structures.
On the other side, Fagin and Stockmeyer (1998) employed a relaxed triangle inequality to
quantify non-linear elastic matching in pattern matching. Both the measurement of ice floes
and sales (McConnell et al. 1991; Cortelazzo et al. 1994) were done using a similar style
of relaxed triangle inequality. By further weakening the triangle inequality, Kamran et al.
(2017) established a new class of generalized metric spaces known as extended b-metric
spaces, which were inspired by such concepts and introduced with an eye on the applica-
tions of such spaces. Younis et al. (2019a, b) chose a few notable real-world engineering
science concerns and used their findings to solve these problems while using graph struc-
ture. Graphical structure of extended b-metric space with an application to the oscillations
of a homogeneous bar was recently developed by Younis et al. (2021). We aim to introduce
the concept of controlled graphical metric type spaces, which is more general than that of
b-metric spaces, controlled metric spaces extended b-metric spaces, and graphical metric
spaces, while also taking into consideration the work done in the literature and being moti-
vated by the works described in the preceding part. In order to further demonstrate the validity
of the major results, we also offer several illustrations.

2 Key concepts and fundamental definitions

In this section, we provide some fundamental notions and terminology that are necessary for
the article’s further analysis.
Let  be a nonempty set in the sense of Jachymski (2008) and Δ be the diagonal of  × .
Also, consider the directed graph £ = (∨(£)), (£)), where ∨(£) is the vertex set of £ so
that it coincides with the set  and (£) is the edge set of £ ensuring that it includes all the
loops of £, that is, (£) ⊇ Δ. We also designate the graph that results from reversing the
orientation of (£) as £−1 . If the graph £ has symmetrical edges, the notation £̆ is used to
indicate this, that is,
(£̆) = (£−1 ) ∪ (£).

Assume that £ is a directed graph with  and ν as its vertices. A path in £ is described
as a series of vertices { j }mj=0 with (m + 1) vertices such that ν0 =  , νm = , and
( j−1 , ν j ) are all present in (£), where j = 1, 2, . . . , m. If there is a path connecting each
pair of its vertices, a graph £ is said to be linked or connected. We refer to a graph as being
weakly connected when there is a path connecting every pair of its vertices and the graph £
is undirected.

123
A unique approach to graph-based metric spaces Page 3 of 19 44

We use the following notations as in Shukla et al. (2017):

(a) [ ]l£ ={ ∈  : there exists a directed path of length l in the graph £ from the vertex 
to the vertex .
(b) (ν P )£ represents a path leading from  to ν in £ and if  ∈ (ν P )£ , then  is a
vertex lying on the path (ν P )£ in the graph £.
A sequence {m } ⊂  is said to be £-W C [£-termwise connected] if (m Pνm+1 )£ for all
m ∈ N.
The graph theory was recently employed in metric fixed point theory in a very fascinating
manner by the authors Chuensupantharat et al. (2019), who also presented graphical b-metric
space as a refinement of b-metric space, see also Suantai and Chaipornjareansri (2019).
From now on, unless anything to the contrary is stated, we will assume that all of the
graphs that are being evaluated are directed and we adopt the usual notations of N, R and
R+ to denote the sets of all natural numbers, real numbers and non-negative real numbers
respectively.
Definition 1 (Chuensupantharat et al. 2019) A mapping b£ :× → [0, ∞ [ with s ≥ 1 that
satisfies the following assertions is said to be a graphical b-metric on a nonempty set .
1. b£ (,  ) = 0 if and only if  =  ;
2. b£ (,  ) = b£ (, ) for all ,  ∈ ;
3. (P )£ , ν ∈ (P )£b ⇒ b£ (,  ) ≤ s[b£ (, ν) + b£ (ν,  )] .
The pair (, b£ ) is referred to as graphical b-metric space with coefficient s on .

Example 1 Younis et al. (2019b) Let the associated metric b£ defined on  = {n, l, o, p, m}
be given by the following b-metric b£ defined by:
⎧
⎪
⎨ 6  or  or both ∈ / { p, m} and   = ,
b£ (,  ) =  ,  ∈ {m, p},
⎪
⎩
0  = ,

where 0 < . It is not difficult to demonstrate that (, b£ ) is a graphical b-metric space
with coefficient s = 3 that encompasses the graph £ = (∨(£), (£)) that is furnished with
∨(£) =  and (£) as shown in Fig. 1.

In the next section, we will cover the basic ideas of graphical extended b-metric spaces.

Fig. 1 Related garph

123
44 Page 4 of 19 M. Younis, D. Bahuguna

Fig. 2 Related graph

Definition 2 Younis et al. (2021) Assume  is a nonempty set endowed with a graph £ and
e :  ×  → [1, ∞[. A mapping £e :× → [0, ∞ [ is considered a graphical extended
b-metric if the following claims are true for every , , ν ∈ :

1. £e (,  ) = 0 if and only if  =  ;

2. £e (,  ) = £e (, ) for all ,  ∈ ;
3. (P )£ , ν ∈ (P )£ ⇒ £e (,  ) ≤ e(,  )[£e (, ν) + £e (ν,  )].
We call the pair (, £e ) as a graphical extended b-metric space.

Remark 1 Notably, graphical extended b-metric spaces generalise graphical b-metric spaces
Chuensupantharat et al. (2019) and graphical metric spaces Shukla et al. (2017) when
e(,  ) = s for 1 ≤ s and e(,  ) = 1 is substituted in Definition 2 respectively.

Example 2 (Younis et al. 2021) For instance, let  = {1, 3, 5, 7, 11}. Define e :  ×  →
[1, ∞) by
+
e(,  ) = 5 + ; ,  ∈ .
2
Let the extended b-metric, which is defined as follows, be endowed with the set .
⎧
⎪
⎨0;  = ,
κ
e (,  ) = 2 ;  or  or both ∈ / {1, 3} and   = ,
⎪
⎩
2κ; ,  ∈ {1, 3} and   = ,

where 0 < κ is a constant.

The fact that (, e ) is an extended b-metric space is evident. Now, we examine the graph
£ with the set of vertices  = {1, 3, 5, 7, 11} = ∨(£), and the following set of edges:
(£) = Δ ∪ {(11, 7), (1, 5), (3, 5), (1, 3), (3, 11), (5, 7), (5, 11), (7, 3), (7, 1), (11, 1)},
then (, e ) is a graphical extended b-metric space with e(,  ) = 2 + 2 +5, encompassing
the graph £ as displayed in Fig. 2.

3 Graphical controlled metric type Spaces

In this part, we introduce the graphical representation of controlled metric type space as
follows, taking into consideration the importance of graph theory in metric fixed point theory.

123
A unique approach to graph-based metric spaces Page 5 of 19 44

Definition 3 Consider a non-void set  furnished with a graph £ and α :  ×  → [1, ∞) is

a function. We say that a mapping £c :  ×  → [0, ∞); , , ν ∈ , defines a graphically
controlled type metric, if the following holds
1. £c (,  ) = 0 if and only if  = ,
2. £c (,  ) = £c (, ),
3. (P )£ , ν ∈ (P )£ ⇒ £c (,  ) ≤ α (, ν) £c (, ν) + α (ν,  ) £c (ν,  ) .
The pair (, £c ) is called a controlled graphical metric type space.

Remark 2 It is worth mentioning that controlled graphical metric type space generalises
graphical extended b−metric space, as addressed in Younis et al. (2021) .

Example 3 Every controlled metric type space is controlled graphical metric type space.
Let  = {0, 1, 2, 3, 4, 5}. Define α :  ×  → [1, ∞) to be symmetric and defined as
α(,  ) = 21 + 22 ; ,  ∈ .
Consider the function £c given as £c (, ) = 0 and £c (,  ) = £c (, ), where

£c 0 1 2 3 4 5

0 0 1 1 1 1 1
11 12 13 14 15

1 1 0 2 3 4 5
11 3 4 5 6

2 1 2 0 1 1 1
12 3 8 9 10

3 1 3 1 0 6 7
13 4 8 7 8

4 1 4 1 6 0 1
14 5 9 7 4

5 1 5 1 7 1 0
15 6 10 8 4

We can clearly see that (, c ) is a controlled metric type space. Analyze the graph £ with
 = ∨(£) as the collection of vertices and the edge set provided below:
(£) = Δ ∪ {(0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 4),
(2, 5), (3, 4), (3, 5), (4, 5)}, then (, £c ) is a controlled graphical metric type space with
α(,  ) = 21 + 22, confining the graph £ as explained in Fig. 3.

Remark 3 It is important to mention that controlled graphical metric type space is not always
controlled metric type space. The following example supports our assertion.

Example 4 Let  = {0, 1, 2, 3} be a controlled graphical metric type space £c : × defined
as

0, when  = ,
£c (,  ) =
| −  |2 , otherwise,
including the graph £ = (∨(£), (£)) such that  = ∨(£) and (£) be displayed in the
Fig. 4. One can easily illustrate that (, £c ) is a controlled graphical metric type space with
α(,  ) =  + 5. So, we observe that
£c (0, 3) ≤ α(0, 1)£c (0, 1) + α(1, 3)£c (1, 3)

123
44 Page 6 of 19 M. Younis, D. Bahuguna

Fig. 3 Associated graph

Fig. 4 Related directed graph

Fig. 5 Inclusion is represented by an arrow (inverse inclusion is not true)

9 ≤ 37.

Hence, we conclude that (, £c ) is a graphical controlled metric type space but is not a
controlled metric type space.

To have a better grasp on the graphical structure of controlled metric type spaces, we
create the following Fig. 5 utilizing the pioneer papers (George et al. 2015; Shukla et al.
2017; Younis et al. 2021), and the work done in this article.
 
Definition 4 Consider a graphical controlled metric type space , £c . Let  ∈  and
γ > 0. Then £c −open ball having center  and radius γ is

B£c (, γ ) = {ν ∈  | ( Pν)£c , £c (, ν) < γ }.

123
A unique approach to graph-based metric spaces Page 7 of 19 44

Since (£) ⊇ Δ, ν ∈ B£c (, γ ), and thus B£c (, γ ) is non-empty for all  ∈  and
0 < γ.
The topology τ£c on  that is enclosed by the controlled graphical metric type space is
represented by the set B = {B£c (, γ )| ∈ , γ > 0} as a neighbourhood system.
 
Proposition 1 Consider a controlled graphical metric type space , £c with α (z,  ) =
β ∈ [1, ∞), z,  ∈ . If ν ∈ B£c (, γ ), for γ > 0, then there exists ζ > 0 such that
BGc (, γ ) ⊇ B£c (ν, ζ ).
Proof Suppose ν ∈ B£c (, γβ ). In case ν =  , then we choose ζ = γβ . Now assume
that ν  = , then we have £c (ν,  )  = 0. Choose 0 < ζ = γβ − £c (ν,  ) and let
z ∈ B£c (ν, ζ ), therefore, in line with the proposed theory, we get ( Pν)£c and (ν P z)£c ,
and hence ( P z)£c (i.e., graph £c contains a path from z to graph £c ). From the assertion of
graphically controlled metric type space, we have
£c (z,  ) ≤ α (z, ν) £c (z, ν) + α (ν,  ) £c (ν,  )
< βζ + β£c (ν,  )
γ
=β − £c (ν,  ) + β£c (ν,  ) = γ .
β
Hence, we sum up with £c (z,  ) < γ , so that
B£c (, γ ) ⊇ B£c (ν, ζ ).
This illustrates that each open ball in  is an open set. 

 
Definition 5 Let , £c be a controlled graphical metric type space. A sequence {νn } con-
verges to some ν in , if for all positive , there is some positive N such that £c (νn , ν) <
for each n ≥ N . It can be written as
lim νn = ν.
n→∞
 
Definition 6 The sequence {νn } in a graphically controlled metric type space , £c is said
to be a Cauchy sequence, if £c (νn , νm ) → 0 as n, m → ∞.
 
Definition 7 A controlled graphical metric type space , £c is said to be £−complete if
every Cauchy sequence is convergent in  with respect to graph £.

4 Some new results concerning controlled graphical metric type spaces

Assume that £ = (∨(£), (£)) is a weighted graph that contains all of the loops. If νn =
νn−1 = n ν0 for all n ∈ N., then a sequence {νn } in  with starting value ν0 ∈  is said to
constitute a −Picard sequence ( − P S) for the self map  :  → .
Additionally, if a £−term-wise associated  − P S {νn } convergent in  ensures that there
must be a limit ν ∈  of {νn } and n 0 ∈ N such that (νn , ν) ∈ (£) or (ν, νn ) ∈ (£) for all
n > n 0 , then £ = (∨(£), (£)) is said to meet property (Γ ).
Definition 8 Assume that a graph £ spanning all the loops is endowing the controlled graph-
ical metric space (, £c ). If the following conditions are true, a mapping  :  →  is said
to be a graphical £c −contraction (in short g£c −contraction) on controlled graphical metric
type space (, £c ).

123
44 Page 8 of 19 M. Younis, D. Bahuguna

1.  preserves edges of £.
.
2. there exists L ∈]0, 1[ and α (, ν) ∈ [1, ∞[, for all , ν ∈  with (, ν) ∈ (£), we
have
£c (, ν) ≤ L £c (, ν). (1)

Theorem 1 Assume that  :  →  is a g£c −contraction on a £−complete controlled

graphical metric type space (, £c ). If the the property (Γ ) holds the graph £, then there
exists 0 ∈  with 0 ∈ [0 ]l£ for some l ∈ N. Also if
α(i+1 , i+2 ) 1
sup lim α(i+1 , m ) < , (2)
m≥1 i→∞ α(i , i+1 ) k

where {n } is  − P S with starting value 0 ∈  and k ∈ (0, 1). Further assume that, for
every  ∈ 
lim α(, n ) and lim α(n ,  ), (3)
n→∞ n→∞

exist and are finite. Then, there exists   ∈  such that the  − P S{n } is £−term-wise
connected converging to both   and   .

Proof Let 0 ∈  such that 0 ∈ [0 ]l£ for any l ∈ N. As we know that the sequence
{n } is a  − P S with starting value 0 , there exists a path {ν j }lj=0 with 0 = ν0 ,
0 = ν1 and (ν j−1, ν j ) ∈ (£) for j = 1, 2, . . . , l. Since  is graph preserving, we
have (ν j−1, ν j ) ∈ (£) for j = 1, 2, . . . , l. This shows that {ν j }lj=0 is a path from
ν0 = 0 = 1 to νl = 2 0 = 2 having length l, and hence 2 ∈ [1 ]l£ . Using
the same process again, we observe that {n ν j }lj=0 is a path from n ν0 = n 0 = n to
n ν1 = n 0 = n+1 of length l, and thus n+1 ∈ [n ]l£ , for all n ∈ N. This ensures
that {n } is a £−term-wise connected sequence.
Now (n ν j−1 , n ν j ) ∈ (£) for j = 1, 2, . . . , l and n ∈ N, then by using (1), we obtain

£c (n ν j−1 , n ν j ) ≤ L d£c (n−1 ν j−1 , n−1 ν j ). (4)

Continuing in the same manner, we have

£c (n ν j−1 , n ν j ) ≤ Ln £c (ν j−1 , ν j ). (5)

Since {n } is £−term wise connected sequence, for n, m ∈ N, m > n, we have

£c (n , m ) ≤ α(n , n+1 )£c (n , n+1 ) + α(n+1 , m )£c (n+1 , m )
≤ α(n , n+1 )£c (n , n+1 )
+α(n+1 , m )α(n+1 , n+2 )£c (n+1 , n+2 )
+α(n+1 , m )α(n+2 , m )£c (n+2 , m )
≤ α(n , n+1 )£c (n , n+1 )
+α(n+1 , m )α(n+1 , n+2 )£c (n+1 , n+2 )
+α(n+1 , m )α(n+2 , m )α(n+2 , n+3 )£c (n+2 , n+3 )
+α(n+1 , m )
α(n+2 , m )α(n+3 , m )£c (n+3 , m )
≤ α(n , n+1 )£c (n , n+1 )

123
A unique approach to graph-based metric spaces Page 9 of 19 44

⎛ ⎞
m−2 
i
+ ⎝ α( j , m ))α(i , i+1 )£c (i , i+1 ⎠
i=n+1 j=n+1


m−1
+ α(k , m )£c (m−1 , m )
k=n+1
≤ α(n , n+1 )Ln £c £c (0 , 1 )
⎛ ⎞
m−2  i
+ ⎝ α( j , m ))α(i , i+1 )Li £c (0 , 1 ⎠
i=n+1 j=n+1


m−1
+ α(k , m )Lm−1 £c (0 , 1 )
k=n+1
≤ α(n , n+1 )Ln £c (0 , 1 )
⎛ ⎞
m−2  i
+ ⎝ α( j , m ))α(i , i+1 )Li £c (0 , 1 ⎠
i=n+1 j=n+1


m−1
+ α(k , m )α(m−1 , m )Lm−1 £c (0 , 1 )
k=n+1

= α(n , n+1 )Ln £c (0 , 1 )

⎛ ⎞
m−1 i
+ ⎝ α( j , m ))α(i , i+1 )Li £c (0 , 1 ⎠
i=n+1 j=n+1
≤ α(n , n+1 )Ln £c (0 , 1 )
⎛ ⎞
m−1 i
+ ⎝ α( j , m ))α(i , i+1 )Li £c (0 , 1 ⎠ .
i=n+1 j=0

Assume that
p 
i
Sp = ( α( j , m ))α(i , i+1 )Li .
i=0 j=0

Then, we obtain
£c (n , m ) ≤ £c (0 , 1 )[Ln α(n , n+1 ) + (Sm−1 − Sn )]. (6)
Utilizing the ratio test, we acquire

i
ai+1 1
ai = α( j , m )α(i , i+1 )Li , where < ,
ai k
j=0

taking limm,n→∞ in (6) to get

lim £c (n , m ) = 0, (7)
n→∞

which implies that {n } is a Cauchy sequence. Since (, £c ) is a £−complete controlled
graphical metric type space, the sequence {n } converges in  and by using (Γ ) property

123
44 Page 10 of 19 M. Younis, D. Bahuguna

there exist some   ∈  and n 0 ∈ N such that (n ,   ) ∈ (£) or (  , n ) ∈ (£) for all
n > n 0 and
lim £c (n ,   ) = 0,
n→∞

which confirms that {n } converges to   .

If (n ,   ) ∈ (£), by using (1), we have
£c (n+1 ,   ) = £c (n ,   ) ≤ L £c (n ,   ),
for all n > n 0 . This shows that
lim £c (n+1 ,   ) = 0.
n→∞

Now if (  , n ) ∈ (£), by using the same hypothesis as above used, we conclude

lim £c (  , n+1 ) = 0.
n→∞

Hence {n } converges to both   and   . 



Definition 9 Let (, £c ) be a controlled graphical metric type space and  :  →  be a
self-map. We say that a triplet (, £c , ) satisfies property (M), if corresponding to two
limits   ∈  and ν  ∈ () of a £−term-wise-connected -PS {n }, we have   = ν  .

Theorem 2 If the assumptions in Theorem 1 hold, and further assuming that the triplet
(, £c , ) has the criterion (M), then  admits a fixed point.

Proof Theorem 1 ensures that the −Picards sequence {n } having starting value 0 con-
verges to   and   both. Also,   ∈  and   ∈ (), consequently, we get the
conclusion that   =   . As a result,  has a fixed point. 


Example 5 Let  = {0, 1, 2, 3}. Consider α :  ×  → [1, ∞) to be symmetric and defined

as
α(,  ) = 23 + 24 ; ,  ∈ .
Also, consider the function £c given by £c (, ) = 0 and £c (,  ) = £c (, ), where

£c 0 1 2 3

0 0 1 2 4
2 3 5

1 1 0 1 5
2 13 6

2 2 1 0 3
3 13 4

3 4 5 3 0
5 6 4

We can clearly see that (, £c ) is graphical controlled metric type space with  = ∨(£)
as the vertex set and the edge set is constituted by the following.
(£) = Δ ∪ {(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)}.
Then (, £c ) is a controlled graphical metric type space with α(,  ) = 23 + 24,
concerning the graph £ shown in Fig. 6, where the weight of edge (, ν) is equal G c (, ν).

123
A unique approach to graph-based metric spaces Page 11 of 19 44

Fig. 6 ∨(£), the weighted graph

Consider a self map  :  →  defined by the following


1, when  ∈ {1, 2},
 =
2, when  ∈ {0, 3}.
Case (i): If we choose  = 3 and ν = 0, then
£c (3, 0) ≤ L d£c (3, 0)
£c (2, 2) ≤ L d£c (3, 0).
Case (ii): If we choose  = 0 and ν = 2, then
£c (0, 2) ≤ L d£c (0, 2)
£c (2, 1) ≤ L d£c (0, 2).
Case (iii): If we choose  = 3 and ν = 2, then
£c (3, 2) ≤ L d£c (3, 2)
£c (2, 1) ≤ L d£c (3, 2).
It is now evident that requirement (1) is met in all the circumstances. Moreover, if we take
L = 21 , 0 = 0 and k = 2851
, we procure
α(i+1 , i+2 ) 6745 1
sup lim α(i+1 , m ) = < 285 = ,
m≥1 i→∞ α(i , i+1 ) 24 k
inferring that the predicate condition (2) is contended for every  ∈ . In addition, for each
 ∈ , we can easily verify that lim α(, n ) and lim α(n ,  ) exist and are finite.
n→∞ n→∞
Hence all hypothesis of the Theorem 1 are contended and 1 is the required fixed point.

5 More general results

In this section, we prove some more general results concerning Kannan-type mappings in the
framework of controlled graphical metric-type space. One of the great things about Kannan’s
theorem is that it allows us to define metric completeness in terms of the fixed point of the
mapping in question. Therefore, it is worthy and intriguing to investigate mappings of this
kind.

123
44 Page 12 of 19 M. Younis, D. Bahuguna

Definition 10 Suppose (, £c ) is a controlled graphical metric type space equipped with a
graph £ carrying all the loops. A map  :  →  is called a graphical £β −contraction on
controlled graphical metric type space (, £c ) if the following properties hold:
1.  preserves edges of £.
.
2. There exists β ∈ (0, and α (, ν) ∈ [1, ∞), for all , ν ∈  with (, ν) ∈ (£), we
2)
1

have
£c (, ν) ≤ β[£c (,  ) + £c (ν, ν)]. (8)

Theorem 3 Let  :  →  be a graphical £β −contraction on a £−complete controlled

graphical metric type space (, £c ). Suppose the graph £ satisfies the property (Γ ), then
there exists 0 ∈  with 0 ∈ [0 ]l£ for some l ∈ N. Further suppose that
α(i+1 , i+2 ) 1
sup lim α(i+1 , m ) < , (9)
m≥1 i→∞ α(i , i+1 ) k

where {n } is  − P S with initial value 0 ∈ , where k ∈ (0, 1). Further assume that, for
every  ∈ 
lim α(, n ) and lim α(n ,  ), (10)
n→∞ n→∞

exist and are finite. Then, there exists 

∈  such that the  − P S{n } is £−term–wise
connected, converging to   and   both.

Proof Let us assume that 0 ∈  with 0 ∈ [0 ]l£ for any l ∈ N. As {n } is a
−Picards sequence with starting value 0 , there exists a path {ν j }lj=0 such that 0 = ν0 ,
0 = ν1 and (ν j−1, ν j ) ∈ (£) for j = 1, 2, . . . , l. Since  is graph preserving, we
have (ν j−1, ν j ) ∈ (£) for j = 1, 2, . . . , l. This shows that {ν j }lj=0 is a path from
ν0 = 0 = 1 to ν1 = 2 0 = 2 having length l, and hence 2 ∈ [1 ]l£ . Using
the same process again, we conclude that {n ν j }lj=0 is a path from n ν0 = n 0 = n to
n ν1 = n 0 = n+1 of length l, and thus n+1 ∈ [n ]l£ , for all n ∈ N. This assures
that {n } is a £−term–wise connected sequence.
Now (n ν j−1 , n ν j ) ∈ (£) for j = 1, 2, . . . , l and n ∈ N, then by using (8), we obtain

£c (ν j , ν j+1 ) = £c (n−1 ν j−1 , n−1 ν j )

≤ β[£c (ν j−1 , n−1 ν j−1 ) + £c (ν j , n−1 ν j )],
≤ β[£c (ν j−1 , n−1 ν j−1 ) + £c (ν j , ν j+1 )].
Consequently, we get
β β
£c (ν j , ν j+1 ) ≤ £ (ν j−1 , ν j ) ≤ . . . ≤ ( ) j £c (ν0 , ν1 ). (11)
1−β c 1−β
β
If we choose 1−β = η ∈ (0, 1) then the above equation becomes,

£c (ν j , ν j+1 ) ≤ η j £c (ν0 , ν1 ). (12)

Since {n } is £−term wise connected sequence, for n, m ∈ N, m > n, we have
£c (n , m ) ≤ α(n , n+1 )£c (n , n+1 ) + α(n+1 , m )£c (n+1 , m )
≤ α(n , n+1 )£c (n , n+1 )

123
A unique approach to graph-based metric spaces Page 13 of 19 44

+α(n+1 , m )α(n+1 , n+2 )£c (n+1 , n+2 )

+α(n+1 , m )α(n+2 , m )£c (n+2 , m )
≤ α(n , n+1 )£c (n , n+1 )
+α(n+1 , m )α(n+1 , n+2 )£c (n+1 , n+2 )
+α(n+1 , m )α(n+2 , m )α(n+2 , n+3 )£c (n+2 , n+3 )
+α(n+1 , m )
α(n+2 , m )α(n+3 , m )£c (n+3 , m )
≤ α(n , n+1 )£c (n , n+1 )
⎛ ⎞
m−2  i
+ ⎝ α( j , m ))α(i , i+1 )£c (i , i+1 ⎠
i=n+1 j=n+1


m−1
+ α(k , m )£c (m−1 , m )
k=n+1

≤ α(n , n+1 )ηn £c £c (0 , 1 )

⎛ ⎞
m−2  i
+ ⎝ α( j , m ))α(i , i+1 )η £c (0 , 1 ⎠
i

i=n+1 j=n+1


m−1
+ α(k , m )ηm−1 £c (0 , 1 )
k=n+1
≤ α(n , n+1 )ηn £c (0 , 1 )
⎛ ⎞
m−2  i
+ ⎝ α( j , m ))α(i , i+1 )ηi £c (0 , 1 ⎠
i=n+1 j=n+1


m−1
+ α(k , m )α(m−1 , m )Lm−1 £c (0 , 1 )
k=n+1
= α(n , n+1 )ηn £c (0 , 1 )
⎛ ⎞
m−1  i
+ ⎝ α( j , m ))α(i , i+1 )ηi £c (0 , 1 ⎠
i=n+1 j=n+1
≤ α(n , n+1 )ηn £c (0 , 1 )
⎛ ⎞
m−1 
i
+ ⎝ α( j , m ))α(i , i+1 )ηi £c (0 , 1 ⎠ .
i=n+1 j=0

Assume that
p 
i
Sp = ( α( j , m ))α(i , i+1 )ηi .
i=0 j=0

£c (n , m ) ≤ £c (0 , 1 )[ηn α(n , n+1 ) + (Sm−1 − Sn )]. (13)

123
44 Page 14 of 19 M. Younis, D. Bahuguna

Using ratio test, we deduce


i
ai+1 1
ai = α( j , m )α(i , i+1 )ηi , where < ,
ai k
j=0

taking limm,n→∞ , in (13), we obtain

lim £c (n , m ) = 0, (14)
n→∞

which implies that {n } is a Cauchy sequence. Since (, £c ) is a £−complete controlled
graphical metric type space, the sequence {n } converges in  and by using (Γ ) property
there exists some   ∈ , n 0 ∈ N such that (n ,   ) ∈ (£) or (  , n ) ∈ (£) for all
n > n 0 and
lim £c (n ,   ) = 0,
n→∞

which confirms that {n } converges to   .

If (n ,   ) ∈ (£), by using (12), we have
£c (n+1 ,   ) = £c (νn ,   ) ≤ η£c (n ,   ),
for all n > n 0 . In light of this, it is clear that
lim £c (n+1 ,   ) = 0.
n→∞

Now, assume that (  , n ) ∈ (£), we can conclude using the same method as in the
previous section that
lim £c (  , n+1 ) = 0.
n→∞

This confirms that {n } converges to both   and   . 



Theorem 4 If the assumptions in Theorem 3 are upheld, and further assuming that the triplet
(, £c , ) follows the condition (M), then  has a fixed point.

Proof Theorem 3 ensures that the −Picards sequence {n } with first value 0 converges to
both   and   . Since   ∈  and   ∈ (), therefore by the hypothesis, we conclude
that   =   . Hence,  has a fixed point. 


Example 6 Let  = {3, 5, 7, 9}. Define α :  ×  → [1, ∞) to be symmetric and defined as

α(,  ) = 16 + 43 ; ,  ∈ .
Consider the function £c given as £c (, ) = 0 and £c (,  ) = £c (, ), where

£c 3 5 7 9

3 0 1 1 1
11 5 6

5 1 0 1 1
11 7 8

7 1 1 0 1
5 7 9

9 1 1 1 0
6 8 9

123
A unique approach to graph-based metric spaces Page 15 of 19 44

Fig. 7 Graph ∨(£) with weight of

edge (, ν) = b£ (, ν)

We can clearly see that (, £c ) is a graphical controlled metric type space with  = ∨(£)
and
(£) = Δ∪{(3, 5), (3, 7), (3, 9), (5, 7), (5, 9), (7, 9)}, then (, £c ) is a controlled graphical
metric type space with α(,  ) = 16 + 43, enclosing the graph £ as shown in Fig. 7,
where G c (, ν)= weight of edge (, ν)
Now, we define a mapping  :  →  as given below

3, when  ∈ {3, 5},
 =
5, when  ∈ {7, 9}.
Case (i): If we choose  = 5 and ν = 7, then
£c (5, 7) ≤ β[£c (5, 5) + £c (7, 7)],
1 18
≤β .
11 77
Case (ii): If we choose  = 5 and ν = 9, then
£c (5, 9) ≤ β[£c (5, 5) + £c (9, 9)],
1 19
≤β .
11 88
Case (iii): If we choose  = 7 and ν = 9, then
£c (7, 9) ≤ β[£c (7, 7) + £c (9, 9)],
15
0≤β ,
56
 
Now it is clear that condition (8) is satisfied in all the cases if we we take β = 11
24 ∈ 0, 21
and if we take 0 = 3 and k = 680 1
, then
α(i+1 , i+2 ) 177927 1
sup lim α(i+1 , m ) = < 680 = ,
m≥1 i→∞ α(i , i+1 ) 263 k
since condition (9) is satisfied for every  ∈ . In addition for each  ∈ , we can see that
lim α(, n ) < ∞ and lim α(n ,  ) < ∞.
n→∞ n→∞
As a result, all of the requirements of Theorem 3 are satisfied, and 3 is the required fixed
point of .

123
44 Page 16 of 19 M. Younis, D. Bahuguna

6 An application to rocket ascension

This section applies the existing findings to investigate the existence of a solution to the BVP
guiding the rising motion of a rocket.
Consider C (D = [0, 1], R), the set of all real–valued continuous functions defined on D.
Examine

W = {τ ∈  : inf τ (z) > 0 & 1 ≥ (z), z ∈ D}.

z∈D

Consider the graph £ with the vertex set and edge set given as follows:

(£) = Δ ∪ {(τ, τ ∗ ) ∈ 2 : τ, τ ∗ ∈ W , τ (z) ≤ τ ∗ (z), for all z ∈ D},

and ∨(£) = .
Consider a rocket possessing an initial mass m0 (comprising propellant and shell) operat-
ing in an ascending motion. The rocket ingests the fuel at a constant rate r = −dm dt . Relative
to the motion of the rocket, fuel is expelled at a constant speed . The mass of the rocket at
any instant time t is m(t) = m0 − rt. During the driving stage, the equation of motion of the
underlying rocket with aerodynamic drag force Fd = ζ z2 (ζ being the damping coefficient
and z is the velocity at time t) governing the upward motion at an excessive speed is given
by the following first-order nonlinear differential equation with variable coefficients (see Xie
2010).
dz(t)
m(t) + ζ  2 (t) + m(t)g − qu = 0, (15)
dt
where g is the force of gravity acting on the system.
If we set the velocity z(t) = m(t)Θ(t)
ζ Θ(t) , where Θ is the converted velocity, and substitute
the derived equation into the equation of motion while altering the time to the dimensionless
variable η, then the Eq. (15) reduces to the following Bessel type differential equation
 2
Θ(s)
s2 d ds2 + s dΘ(s)
ds − B (s, Θ(s)) = 0; (16)
Θ(0) = Θ(1) = 0,

where B : [0, 1] × R+ → R a function which is continuous.

In order to make our fixed point results applicable, we reduce the Eq. (16) via Green’s
function to its equivalent integral equation stated below:
 1
Θ(s) = P (s, c) B (c, Θ(c))dc, s ∈ [0, 1], (17)
0

where the associated Green’s function P (s, c) is the following


s
(1 − c2 ), 0 ≤ s < c ≤ 1;
P (s, c) = c2 (18)
2 (1 − s 2 ), 0 ≤ c < s ≤ 1.

Let the controlled type graphical metric £c :  ×  → [0, ∞) be defined by the following

£c (ω1 , ω2 ) = sup |ω1 (t) − ω2 (t)|2 . (19)

t∈[0,1]

Then (, £c ) is a complete controlled graphical metric space with α : W × W → [1, ∞)
defined as α(ω1 , ω2 ) = 3|ω1 (t)| + 2|ω2 (t)| + 5.

123
A unique approach to graph-based metric spaces Page 17 of 19 44

Consider the operator  :  →  given by the following

 1
Θ(s) = P (s, c) B (c, Θ(c))dc, ∀ s ∈ . (20)
0
Then Θ is a fixed point of  if and only if Θ is a solution of the integral equation (17).
Succeeding theorem establishes the sufficient conditions for the existence of solution of
the equation constituting the ascending motion of a rocket.
Theorem 5 We suppose that the following assumptions take place:
(1)
 1
δ(s) ≤ P (s, c) B (c, δ(c))dc, δ ∈ C ([0, 1], R);
0
that is, δ(s) is a lower solution of (17).
(2)
inf P (s, c) > 0, and B (c, 1) ≤ 1;
0≤s≤1

(3) For each c, s ∈ [0, 1], Θ ∗ , Θ ∈ , and B : [0, 1] × R+ → R, we have

 
|B (c, Θ ∗ (s)) − B (c, Θ(s))| ≤ Θ ∗ (s) − Θ(s).
Then the integral equation (17) possesses a solution, and consequently the first-order non-
linear differential equation (15) depicting the ascending motion of the rocket has a solution.

Proof For (Θ ∗ , Θ) ∈ (£) with Θ ∗ , Θ ∈ , we have

|Θ ∗ (s) − Θ(s)|
 1  
 1 
= ∗
P (s, c) B (c, Θ (c))dc − P (s, c) B (c, Θ(c))dc
0 0
 1  
 
≤ P (s, c)B (c, Θ ∗ (c)) − B (c, Θ(c))dc
0
  1
 
≤ sup B (c, Θ ∗ (s)) − B (c, Θ(s)) P (s, c)dc
s∈[0,1] 0
  1
 
≤ sup Θ ∗ (s) − Θ(s) P (s, c)dc
s∈[0,1] 0
sc(−2c2 + 3c + 6) 1 − c − s  
 
= + sup Θ ∗ (s) − Θ(s).
12 4 s∈[0,1]

 By routine  utilizing the values of s and c, we can see that the value of
calculations,
sc(−2c2 +3c+6)
12 + 4
1−c−s
lies between 0 and 1. Let this value be L ∈ (0, 1), we obtain
 2  2
   
sup Θ ∗ (s) − Θ(s) ≤ L sup Θ ∗ (s) − Θ(s) .
s∈[0,1] s∈[0,1]

Therefore, we have
   
£c Θ ∗ (s), Θ(s) ≤ L £c Θ ∗ (s), Θ(s) .
Consequently the contraction condition of Theorem 2 is established.

123
44 Page 18 of 19 M. Younis, D. Bahuguna

Next, consider (Θ ∗ , Θ) ∈ (£) with Θ ∗ , Θ ∈ . We notice that Θ ∗ , Θ ∈ W and

Θ ∗ (s) ≤ Θ(s) for all s ∈ [0, 1]; and by condition (2), we obtain inf 0≤s≤1 (Θ ∗ )(s) > 0,
 1  1
(Θ ∗ )(s) = P (s, c) B (c, Θ ∗ (c))dc ≤ P (s, c)B (c, 1)dc ≤ 1,
0 0

and
 1  1
(Θ ∗ )(s) = P (s, c)B (c, Θ ∗ (c))dc ≤ P (s, c)B (c, Θ(c))dc = B (c)(s).
0 0
 
This adds up to state that Θ ∗ (s) ∈ W and (Θ ∗ )(s), (Θ)(s) ∈ (£). In compliance
with the assertion (1), there exists a solution say δ ∈ W such that B (δ) ∈ [δ]1£ , thus another
condition of Theorem 2 is verified. Subsequently, by elementary calculations, one can see
easily that the rest of the assertions of Theorem 2 are satisfied. Consequently,  has a unique
fixed point, and as a result, the first-order nonlinear differential equation (15) illustrating the
rocket’s ascending motion possesses a solution in . 


7 Conclusions

In order to expand on the ideas of various metric space variants, we introduced a new idea
for a more broadly defined abstract space termed as controlled graphical metric space. A
link between the metric fixed point theory and graph theory is provided by the underlying
spaces filled by graph structure. This method uses a very different definition of distance
between two or more items. Furthermore, a method is provided for addressing a real-world
problem, namely, the rising motion of a rocket, based on graphic contraction. For the scenario
in which the mass-variation law is a linear function of time, we offered an evaluation of an
ascending vertical motion of a rocket subject to a quadratic drag using the graph-contractions.
To illustrate the importance of our study, various illustrative situations are examined and the
offered findings generalize and expand some prior research.
Acknowledgements The authors appreciate the knowledgeable editors’ and referees’ insightful remarks and
suggestions, which boosted the paper’s quality. The Indian Institute of Technology Kanpur is also acknowl-
edged by the first author for funding his postdoctoral research.

Author Contributions All authors read and endorsed the paper.

Declarations
Conflict of interest The authors proclaim that they have no known contending budgetary interests or individual
connections that might have seemed to impact the work announced in this paper.

References
Chuensupantharat N, Kumam P, Chauhan V, Singh D, Menon R (2019) Graphic contraction mappings via
graphical b-metric spaces with applications. Bull Malays Math Sci Soc 42:3149–3165
Ciric LB (1974) A generalization of Banach’s contraction principle. Proc Am Math Soc 45:267–273
Cortelazzo G, Mian G, Vezzi G, Zamperoni P (1994) Trademark shapes description by string matching tech-
niques. Pattern Recognit 27:1005–1018
de Hierro AF, Shahzad N (2017) From graphical metric spaces to fixed point theory in binary related distance
spaces. Filomat 31(11):3209–3231

123
A unique approach to graph-based metric spaces Page 19 of 19 44

Dubey AK, Mishra U, Lim WH (2019) Some new fixed point theorems for generalized contraction involving
rational expressions in complex valued b-metric spaces. Nonlinear Funct Anal Appl 24(3):477–483
Edelstein M (1961) An extension of Banach contraction principle. Proc Am Math Soc 12:7–10
Fagin R, Stockmeyer L (1998) Relaxing the triangle inequality in pattern matching. Int J Comput Vis 30:219–
231
George R, Radenovic S, Reshma KP, Shukla S (2015) Rectangular b-metric spaces and contraction principle.
J Nonlinear Sci Appl 8(6):1005–1013
Hardy GE, Rogers DE, A generalization of a fixed point theorem of Reich. Can Math Bull 16:201–206
Hussain N, Arshad M, Shoaib A (2014) Common fixed point results for α-ψ-contractions on a metric space
endowed with graph. J Inequal Appl 1(2014):1–14
Hussain N, Ahmad J, Kutbi MA (2016) Fixed point theorems for generalized Mizoguchi–Takahashi graphic
contractions. J Funct Spaces 2016:6514920
Jachymski J (2008) The contraction principle for mappings on a metric space with a graph. Proc Am Math
Soc 136:1359–1373
Kamran T, Samreen M, Ul Ain Q (2017) A generalization of b-metric space and some fixed point theorems.
Mathematics 5(2):19
Kannan R (1968) Some results on fixed points. Bull Calc Math Soc 60:71–76
McConnell R, Kwok R, Curlander J, Kober W, Pang S (1991) -S correlation and dynamic time warping:
two methods for tracking ice floes. IEEE Trans Geosci Remote Sens 29:1004–1012
Meir A, Keeler E (1969) A theorem on contraction mappings. J Math Anal Appl 28:326–329
Mostefaoui Z, Bousselsal M, Kim JK (2019) Some results in fixed point theory concerning rectangular b-metric
spaces. Nonlinear Funct Anal Appl 24(1):49–59
Radenović S, Došenović T, Lampert TA, Golubović Z (2016) A note on some recent fixed point results
for cyclic contractions in b-metric spaces and an application to integral equations. Appl Math Comput
273:155–164
Radenović S, Zoto K, Dedović N, Š ešum-Cavic V, Ansari AH (2019) Bhaskar–Guo–Lakshmikantam–Ćirić
type results via new functions with applications to integral equations. Appl Math Comput 357:75–87
Reich S (1971) Some remarks concerning contraction mappings. Canad Math Bull 14:121–124
Samreen M, Kamran T, Postolache M (2018) Extended b-metric space, Extended b-comparison function and
nonlinear contractions. UPB Sci Bull Ser A 80(4):21–28
Shukla S, Radenović S, Vetro C (2017) Graphical metric space: a generalized setting in fixed point theory.
Rev R Acad Cienc Exactas Fís Nat Ser A Mat RACSAM 111(3):641–655
Singh D, Chauhan V, Altun I (2017) Common fixed point of a power graphic (F, ψ)-contraction pair on partial
b-metric spaces with application. Nonlinear Anal Model Control 22(5):662–678
Singh D, Joshi V, Kim JK (2018) Existence of solution to Bessel-type boundary value problem Via G-l cyclic
F-contractive mapping with graphical verification. Nonlinear Funct Anal Appl 23(2):205–224
Suantai S, Chaipornjareansri S (2019) Best proximity points of α-β-ψ-proximal contractive mappings in
complete metric spaces endowed with graphs. Nonlinear Funct Anal Appl 24(4):759–773
Xie WC (2010) Differential equations for engineers. Cambridge University Press, Cambridge
Younis M, Singh D, Goyal A (2019) A novel approach of graphical rectangular b-metric spaces with an
application to the vibrations of a vertical heavy hanging cable. J Fixed Point Theory Appl 21:33
Younis M, Singh D Petruşel A (2019) Applications of graph Kannan mappings to the damped spring-mass
system and deformation of an elastic beam. Discrete Dyn Nat Soc 2019:1315387. https://doi.org/10.
1155/2019/1315387
Younis M, Singh D, Altun I, Chauhan V (2021) Graphical structure of extended b-metric spaces: an application
to the transverse oscillations of a homogeneous bar. Int J Nonlinear Sci Numer Simul. https://doi.org/
10.1515/ijnsns-2020-0126
Younis M, Singh D, Abdou A (2022) A fixed point approach for tuning circuit problem in dislocated b-metric
spaces. Math Meth Appl Sci 45:2234–2253. https://doi.org/10.1002/mma.7922
Younis M, Singh D, Chen L, Metwali M (2022) A study on the solutions of notable engineering models. Math
Model Anal 27(3):492–509. https://doi.org/10.3846/mma.2022.15276

Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and
institutional affiliations.

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under
a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted
manuscript version of this article is solely governed by the terms of such publishing agreement and applicable
law.

123