Next Article in Journal
A Study of an IBVP of Fractional Differential Equations in Banach Space via the Measure of Noncompactness
Next Article in Special Issue
A Numerical Scheme and Application to the Fractional Integro-Differential Equation Using Fixed-Point Techniques
Previous Article in Journal
Finiteness of One-Valued Function Classes in Many-Valued Logic
Previous Article in Special Issue
A Quicker Iteration Method for Approximating the Fixed Point of Generalized α-Reich-Suzuki Nonexpansive Mappings with Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Fuzzy Contractions and Applications to Engineering Science

by
Mudasir Younis
1,* and
Afrah Ahmad Noman Abdou
2,*
1
School of Mathematical Sciences, Zhejiang Normal University, Jinhua 321004, China
2
Department of Mathematics, University of Jeddah, P.O. Box 80327, Jeddah 21589, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2024, 8(1), 28; https://doi.org/10.3390/fractalfract8010028
Submission received: 28 November 2023 / Revised: 21 December 2023 / Accepted: 27 December 2023 / Published: 29 December 2023

Abstract

:
The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as “Kannan-graph-fuzzy contraction”. This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

1. Introduction

Fixed point ( FP ) theory is a powerful mathematical tool with numerous applications in various domains. It has played a crucial role in creating vital concepts and approaches, and is an active field of study and development. It is commonly used in pure and applied mathematics as a bridge between topology and analysis. FP theory is a burgeoning scientific field with significant applications in various sectors. It is concerned with research demonstrating that, under certain conditions, a self-map on a non-empty set, M, admits one or more FP s. FP theorems prove the existence and uniqueness of FP s. Because of its application in both pure and applied mathematics, the metric FP theorem has a considerable effect on academia. Banach made an unexpected discovery in 1922 that became known as the Banach contraction principle. One of the most adaptive conclusions in FP theory and approximation theory is the Banach contraction principle. It changed and generalized in a variety of ways over time. The Banach contraction concept is frequently used in the literature on FP theory. Numerous authors have generalized this conclusion by employing other contraction mappings in other metric spaces. The classical principle of contraction mapping states if ( , d ) is a complete metric space and : such that d ( ( ϖ ) , ( ς ) ) α d ( ϖ , ς ) for all ϖ ς , where α [ 0 , 1 ) , then admits a unique FP . Banach’s [1] FP hypothesis helps compute mathematics for examining the existence of solutions to nonlinear integral equations, systems of linear equations, and nonlinear differential equations, as well as manifesting algorithms related to convergence. Many variations on Banach’s FP theorem have been proposed; see [2].
In 1971, Ćirić [3], Reich [4], and Rus [5] established a FP theorem for mappings : , which has been around for decades, meets the following requirement:
d ( ϖ , ς ) a d ( ϖ , ς ) + b ( d ( ϖ , ϖ ) + d ( ς , ς ) ) , for all ϖ , ς ,
where a , b 0 , and a + 2 b < 1 . If b = 0 , Condition 1 reduces to Banach contraction.
d ( ϖ , ς ) a · d ( ϖ , ς ) , for all ϖ ς ,
where a [ 0 , 1 ) , whereas for a = 0 , Condition 1 reduces to Kannan’s contraction.
d ( ϖ , ς ) b ( d ( ϖ , ϖ ) + d ( ς , ς ) ) , for all ϖ ς
where b [ 0 , 1 2 ) . Kannan mappings are essential in mathematics and its applications because they provide a flexible framework for establishing the existence and uniqueness of FP s in metric spaces. They are an important instrument in the study of nonlinear analysis, numerical techniques, and various scientific and technical domains. Their significance stems from their capacity to determine the convergence of iterative algorithms and solve a wide range of mathematical and practical problems.
In fact, Kannan’s fixed-point theorem is a noteworthy finding in mathematics, especially regarding complete metric spaces. The theorem gives circumstances in which it is possible to derive a unique FP in such spaces without continuous mapping. This is important because continuity of the mapping is a necessary assumption in many traditional fixed-point theorems.
Kannan’s theorem has several applications.
  • Eliminating the continuity requirement: Kannan’s theorem is applicable in a wider range of scenarios, encompassing non-continuous maps, in contrast to several previous fixed-point theorems that need continuous mapping. It may, therefore, be used to solve an enormous variety of mathematical and real-world issues.
  • Metric completeness characterization: Kannan’s theorem is remarkable since it describes a space’s metric completeness in terms of the presence of a FP . That is to say, a metric space is complete if and only if there is only one FP for a certain kind of mapping. This offers a profound relationship between the existence of FP s and the notion of metric completeness.
  • Valuable and interesting mappings: Since it illuminates the characteristics of full metric spaces and their topological structure, studying mappings that meet Kannan’s theorem requirements is important. There are several practical applications for comprehending these mappings and the corresponding FP s in mathematics and its applications, such as functional analysis and engineering mathematics, see, e.g., [6,7]. In conclusion, Kannan’s fixed-point theorem is a key finding in mathematics that sheds light on the relationship between metric completeness and the presence of FP s, and provides a fresh viewpoint on fixed-point theory in complete metric spaces. It is extensively researched and used in many different mathematical fields, and it has had a long-lasting influence on mathematical study. Therefore, the FP results established in [3,4], under slightly different forms, are true generalizations of Banach’s contraction principle [1] and Kannan’s [8] FP  theorem.
On the other side, a significant expansion of classical metric spaces, the notion of fuzzy metric spaces (developed by Kramosil and Michalek [9]) for a more adaptable and comprehensive treatment of distances and continuity. There are uses for fuzzy metric spaces in many domains, such as fixed-point theory and topology. The concepts of fuzzy metric spaces and Hausdorff topology on fuzzy metric spaces were proposed by George and Veeramani [10]. It was demonstrated that this topology is metrizable when applied to specific fuzzy metric spaces, offering a more reliable framework for researching topological characteristics. It is observed that related fuzzy metric spaces may be generated from any classical metric space. This connection demonstrates how flexible fuzzy metric spaces represent various notions of distance. FP theorems in various mathematical spaces are now better understood because of the introduction of graphical structures and graph theory to FP theory. These advancements have applications in engineering sciences, functional analysis, and optimization. Fixed-point solutions for set-valued graphical contraction mappings were recently provided by Chen et al. [11,12]. This work extends the study of convexity to the context of graphical structures by introducing the idea of a graphical convex metric space. Younis et al. (2022) [13] discussed the graphical structure of extended b-metric spaces. Studying the graphic structure of such generalized graphical metric spaces might provide insights into fixed-point theory and allow for greater flexibility in the definition of distances. Applications for fuzzy graph FP s are found in many technical disciplines, where imprecision and uncertainty are typical. They make it possible to make the best decisions in situations like network design with erratic connections, environmental management with fluctuating parameters like weather and pollution levels, and transportation route optimization in the face of changing traffic circumstances. They also impact production scheduling in unpredictable events, power grid control in the face of variable renewable energy sources, and robotics motion planning in intricate, dynamic situations. They support the development and management of cities in the face of changing demographic and economic forces in urban planning and smart cities. Engineers may use fuzzy graph FP s as a flexible tool to address real-world issues with ambiguous data and make defensible choices in changing environments.
Motivated by the recent results discovered by Jabeen et al. [14], this article’s primary goal is to highlight and study many engineering applications of the current FP theory. To do this, the study offers a set of innovative fuzzy contraction mappings and uses them to construct fixed-point outcomes. Notably, in the setting of fuzzy metric spaces, these discoveries are the first of their kind. This study advances the practical use of advanced fixed-point theory in engineering applications and emphasizes its potential to handle complicated real-world challenges in various scientific domains.
This paper has two parts. Using Kannan-type contractions, we first derive FP and common FP theorems for single-valued mappings in the domain of fuzzy metric spaces. Conversely, we offer the £-Kannan-contractions as an extension of fuzzy £-contraction to show FP s. Our results include a generalization of well-known results of Gregori and Sapna [15] and an extension of Jachymski’s notable results [16] in fuzzy metric spaces. Our primary objective is to generate several applications of the defined fuzzy contractions to different nonlinear models originating from engineering science and technology.

2. Preliminary Concepts

To facilitate the reader, we will now review key concepts and properties that are relevant to this study. Throughout the paper, we will write fuzzy metric spaces as F M spaces, and the sets of natural numbers be denoted by N . The set of integers i.e., Z = N ( N ) { 0 } , and Z + : = N and N 0 = N { 0 } . The symbols R 0 + denotes the set of non-negative real numbers. Throughout the paper, all sets are assumed to be nonempty.
Definition 1 
([17]). The binary function : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is a continuous -norm if ( [ 0 , 1 ] , ) is topological monoid with unit 1 , and satisfies the condition a b c d , whenever a c , b d , and a , b , c , d [ 0 , 1 ] . Examples of -norm.
(i) 
Minimum -norm M : M ( ϖ , ς ) = min { ϖ , ς } ;
(ii) 
Product -norm P : P ( ϖ , ς ) = ϖ · ς ;
(iii) 
Lukasiewicz -norm L : L ( ϖ , ς ) = max { ϖ + ς 1 , 0 } .
Definition 2 
([10]). The 3-tuple ( , F M , ) is termed F M space if is an arbitrary set, * is a continuous -norm, and M is fuzzy set on 2 × 0 , ) satisfies the following conditions: for all ϖ , ς , ϰ , and , s > 0
  • ( F M 1 )   F M ( ϖ , ς , ) > 0 ;
  • ( F M 2 )   F M ( ϖ , ς , ) = 1 ϖ = ς ;
  • ( F M 3 )   F M ( ϖ , ς , ) = F M ( ς , ϖ , ) ;
  • ( F M 4 )   F M ( ϖ , ς , ) F M ( ς , ϰ , s ) F M ( ϖ , ϰ , + s ) ;
  • ( F M 5 )   F M ( ϖ , ς , . ) : [ 0 , ) [ 0 , 1 ] is continuous,
for all ϖ , ς , ϰ and s , > 0 .
Definition 3 
([10]). Let ϖ n is a F M space. The sequence ϖ n is called convergent in F M ϖ n , ϖ , 1 , whenever n .
Lemma 1 
([18]). A sequence ϖ m in a F M space ( , F M , ) is called a Cauchy-sequence if lim m F M ϖ m , ϖ m + 1 = 1 , for all > 0 .
For further synthesis and basic concepts like the convergence of the Cauchy sequence and completeness, and equivalent definitions of Cauchy sequences in fuzzy setup, we refer the readers to [10,18].
Definition 4 
([10]). Let ( , d ) be a metric space. The triplet , M d , is called standard fuzzy metric generated by metric d, where
M d ( ϖ , ς , ) = + d ( ϖ , ς ) .
It is worth noting that the topologies generated by the standard fuzzy metric and its corresponding measure are similar to one another.
Lemma 2 
([10]). Let ( , F M , ) is a F M space. Then, M is continuous function on × × ( 0 , + ) .
Lemma 3 
([19]). Let ( , F M , ) is a F M space. Then, F M ( ϖ , ς , · ) is nondecreasing for all ϖ , ς .
Definition 5 
([15]). A self-mapping : within the context of a F M space ( , F M , ) is called ℶ-uniformly continuous if q ( 0 , 1 ) , p ( 0 , 1 ) , such that
F M ( ϖ , ς , ) 1 p implies F M ( ϖ , ς , ) 1 q
for all ϖ , ς .
Definition 6 
([15]). A self-mapping : defined on ( , F M , ) is called fuzzy contractive mapping, if there exists l ] 0 , 1 [ such that
1 F M ( f ( ϖ ) , f ( ς ) , ) 1 k 1 F M ( ϖ , ς , ) 1
for every ς ϖ .
Proposition 1 
([15]). Let ( , F M , ) is a F M space. If : is fuzzy contractive mapping then ℶ is uniformly continuous.
Let £ be a directed graph with vertices ϖ and ς . In this context, a path in £ is a sequence of vertices { ϖ j } j = 0 M , where there are ( M + 1 ) vertices, and it satisfies the conditions: the first vertex is ϖ , the last vertex is ς , and for every j from 1 to M , there is a directed edge from ϖ j 1 to ϖ j in the graph.
A graph £ is considered linked or connected when a path exists connecting any pair of its vertices. This definition of connectivity applies to directed graphs. When the graph £ is undirected, we refer to it as weakly connected, meaning there is a path connecting every pair of vertices, and the direction of the edges is not considered in determining connectivity. Shukla et al. [20] are to be credited with the following annotations [20]:
a.
[ ϖ ] £ l = { ς : In the graph £, there is a directed path with length l that connects ϖ and ς .
b.
( v P w ) £ If there is a path leading from ϖ to ς in £, and ς ( v P w ) £ , then ς is on the path.
Unless otherwise stated, we consider all the graphs to be direct.
To review different fundamental ideas related to graph- FP s, we recommend the reader consult [7,13].
In a graph £, a path of length N ( N N ) from vertex ϖ directing to another vertex ς is represented by the sequence ϖ i i = 0 N of N + 1 vertices such that ϖ 0 = ϖ , ϖ n = ς , and ϖ n 1 , ϖ n E ( £ ) , 1 i N .
Definition 7 
([21]). A mapping : is called a £-fuzzy contraction in the context of F M space ( , F M , ) if the following assertions are contented:
  • (GF1) ℶ is edge-preserving, i.e., ϖ , ς ( ( ϖ , ς ) E ( £ ) ( ϖ , ς ) E ( £ ) ) ;
  • (GF2) γ ( 0 , 1 ) ϖ , ς > 0 ( ϖ , ς ) E ( £ ) 1 F M ( ϖ , ς , ) 1 γ 1 F M ( ϖ , ς , ) 1 .
Example 1 
([20]). Any constant function : , that is ϖ = ς , ϖ , where ς fixed is a £-fuzzy contraction with arbitrary value of γ ] 0 , 1 [ .
Definition 8 
([20]). Let ( , F M , ) is a F M space, and : be a self mapping. We denote the n t h iterate of ℶ on ϖ by n ϖ , and n ϖ = n 1 ϖ for all n N with 0 ϖ = ϖ . The mapping ℶ is called Picard operator, if ℶ has a unique FP u, and lim n F M n ϖ , u ϖ , = 1 for all ϖ , ς > 0 . The mapping ℶ is called a weak Picard operator, if for all ϖ ∃ a FP u ϖ (which may depend on ϖ) of ℶ such that lim n F M n ϖ , u ϖ , = 1 for all > 0 .
It is worth noting that each Picard operator is also a weak Picard operator. The FP of a weak Picard operator cannot be truly unique.
Definition 9 
([20]). A subset A is called ℶ-invariant if ( A ) A .
The next lemma will help with what comes next.
Lemma 4 
([21]). Let : is a £-fuzzy contraction, then given ϖ , and ς [ ϖ ] £ ˜ , we have lim n F M n ϖ , n ς , = 1 for all > 0 .
The component of £ that contains ϖ is made up of edges, vertices, and a path that starts at ϖ 0 . In this instance, the relation R is defined on V ( £ ) by the following rule:
ς R ϰ if there is a path in £ from ς to ϰ . In this scenario, V £ ϖ = [ ϖ ] £ , where, the equivalence class of this relation is [ ϖ ] £ . Thus, the relationship between £ ϖ is self-evident.
We will now talk about different sorts of mapping continuity. The first is well-known in metric FP theory and is frequently employed.
Definition 10. 
A mapping : is called orbitally continuous if for all ϖ , the sequence k n n N of positive integers, k n ϖ ς implies k n ϖ ς as n .
Definition 11. 
A mapping : is called orbitally £-continuous if given ϖ , and the sequence ϖ n n N ,
ϖ n ϖ and ϖ n , ϖ n + 1 E ( £ ) for n N imply ϖ n ϖ .
Recent findings provide the necessary conditions for mapping to a Picard Operator (PO) when the space ( , d ) has a graph structure. This discovery, first revealed by Jachymski [16], expands on its relationship with the Kelisky–Rivlin theorem about iterates of the Bernstein operators in the space C [ 0 , 1 ] .
Definition 12 
([16]). A self map f : is called a Banach £-contraction (£-contraction), if f preserves edges, i.e.,
ϖ , ς , ( ϖ , ς ) E ( £ ) ( f ( ϖ ) , f ( ς ) ) E ( £ )
and edge weights decrease as follows in £:
α ( 0 , 1 ) , ϖ , ς ( ϖ , ς ) E ( £ ) d ( f ( ϖ ) , f ( ς ) ) α d ( ϖ , ς )
The notion of £-Kannan operators is proposed in this study to evaluate the FP s for Kannan operators in F M spaces given a graph £. We assume that ( , d ) is a metric space and that £ is a directed graph with the criteria that V ( £ ) = , E ( £ ) Δ and that £ has no parallel edges. An instance of F i x is a collection of all FP s for a mapping .
The ensuing notion forms the basis for the recommended results throughout the course of the work.
Definition 13 
([22]). A mapping : in the framework of metric space ( , d ) is called £-Kannan operator if the following assumptions hold true:
(1) 
( ϖ , ς ) E ( £ ) ( ϖ , ς ) E ( £ ) , ϖ , ς ;
(2) 
For each ( ϖ , ς ) E ( £ ) , we have:
d ( ϖ , ς ) γ d ( ϖ , ϖ ) + d ( ς , ς ) ,
where γ [ 0 , 1 2 ) .
Lemma 5. 
Let £ is a graph endowing metric space ( , d ) , and : is a £-Kannan operator. If the assertion ( ϖ , ϖ ) E ( £ ) is satisfied by ϖ , then we have
d n ϖ , n + 1 ϖ γ n d ( ϖ , ϖ )
for all n N .
Proof. 
Let ϖ with ( ϖ , ϖ ) E ( £ ) . An easy induction shows n ϖ , n + 1 ϖ E ( £ ) for all n N ,
d n ϖ , n + 1 ϖ a d n 1 ϖ + n ϖ + d n ϖ , n + 1 ϖ , where a [ 0 , 1 2 ) ,
which implies
d n ϖ , n + 1 ϖ γ d n 1 ϖ , n ϖ
where, 1 > γ = 1 1 a .
A repetition of the above will result in the following
d n ϖ , n + 1 ϖ γ n d ( ϖ , ϖ ) , for all n N

3. Common FP for Fuzzy-Kannan Contractions

In the context of F M spaces, we generate fixed-point and common fixed solutions for single-valued fuzzy-Kannan-type contractions.
Definition 14. 
Let , F M , is complete F M space. A self-mapping : is called a fuzzy-Kannan-contraction of type-I, if
1 F M ( ϖ , ς , ) 1 a 1 F M ( ϖ , ( ϖ ) , ) 1 + b 1 F M ( ς , ( ς ) , ) 1
with a + b < 1 2 , for all ϖ , ς .
The primary outcome about common FP for two single-valued mappings S , within the context of F M spaces is as follows.
Theorem 1. 
Suppose , F M , is a complete F M space. Let S , : be self-mappings such that;
1 F M ( S ϖ , ς , ) 1 a 1 F M ( ϖ , S ( ϖ ) , ) 1 + b 1 F M ( ς , ( ς ) , ) 1 ,
for a , b [ 0 , 1 2 ) , for all ( ϖ , ς ) × . Then, S , and ℶ have at most one common FP in .
Proof. 
Suppose ϖ 0 is an arbitrary point, and define the sequence ϖ n by
S ϖ 2 j = ϖ 2 j + 1 and ϖ 2 j + 1 = ϖ 2 j + 2 ; j = 0 , 1 , 2 ,
Using (10), and (5), we can write
1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 = 1 F M S ϖ 2 j , ϖ 2 j + 1 , 1 a 1 F M ϖ 2 j , S ϖ 2 j , 1 + b 1 F M ϖ 2 j + 1 , ϖ 2 j + 1 , 1 = a 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 + b 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 .
This implies
( 1 b ) 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 a 1 F M ϖ 2 j , ϖ 2 j + 1 , 1
1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 < a 1 b 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 = γ 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 ,
where a 1 b = γ < 1 , since a , b [ 0 , 1 2 ) .
Similarly,
1 F M ϖ 2 j + 2 , ϖ 2 j + 3 , 1 < a 1 b 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 = γ 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 .
Continuing in this manner, we obtain
1 F M ϖ n , ϖ n + 1 , 1 < γ 1 F M ϖ n 1 , ϖ n , 1 , for all n N .
Repeating the above procedure, we infer
1 F M ϖ n , ϖ n + 1 , 1 < γ 1 F M ϖ n 1 , ϖ n , 1 < γ 2 1 F M ϖ n 2 , ϖ n 1 , 1 < γ n 1 F M ϖ 0 , ϖ 1 , 1 .
Hence,
1 F M ϖ n , ϖ n + 1 , 1 < γ n 1 F M ϖ 0 , ϖ 1 , 1 , n N .
Taking (6) into account, we deduce
k = n M 1 1 F M ϖ k , ϖ k + 1 , 1 = 1 F M ϖ n , ϖ n + 1 , 1 + 1 F M ϖ n + 1 , ϖ n + 2 , 1 + + 1 F M ϖ m 1 , ϖ M , 1 < γ n 1 F M ϖ 0 , ϖ 1 , 1 + γ n + 1 1 F M ϖ 0 , ϖ 1 , 1 + + γ M 1 1 F M ϖ 0 , ϖ 1 , 1 < γ n 1 + γ + γ 2 + + γ M n 1 1 F M ϖ 0 , ϖ 1 , 1 γ n 1 γ 1 F M ϖ 0 , ϖ 1 , 1 , m > n .
Since lim n γ n 1 γ = 0 , we must have
lim n k = n M 1 1 F M ϖ k , ϖ k + 1 , 1 = 0 .
This amounts to saying that
lim n F M ϖ k , ϖ k + 1 , = 1 , for all > 0 ,
which yields that ϖ n is a Cauchy sequence in . Since ( , F M , ) is complete, there exists v such that
lim n F M ϖ n , v , = 1 for 0 .
For proving v is a FP of S, Assume F M S v , v , > 0 . Then
1 F M S v , ϖ 2 j + 2 , 1 = 1 F M S v , ϖ 2 j + 1 , 1 a 1 F M v , S v , 1 + b 1 F M ϖ 2 j + 1 , ϖ 2 j + 1 , 1 = a 1 F M v , S v , 1 + b 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 a 1 F M ( v , S v , ) 1 as n .
We arrive at
lim sup n 1 F M S v , ϖ 2 j + 2 , 1 a 1 F M S v , v , 1 , 0 .
Which implies
( 1 a ) 1 F M v , S v , 1 < 0 , 0 .
Noting that a + b < 1 , F M ( v , S v , ) = 1 , i.e., S v = v . In the same way, we suppose 1 F M v , v , 1 > 0 , we have
1 F M v , ϖ 2 j + 1 , 1 = 1 F M v , S ϖ 2 j , 1 a 1 F M ϖ 2 j , S ϖ 2 j , 1 + b 1 F M v , v , 1 = a 1 F M v , S v , 1 + b 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 b 1 F M ( v , v , ) 1 as n .
This can be put as follows
( 1 b ) 1 F M v , v , 1 < 0 .
Then
lim sup n 1 F M v , ϖ 2 j + 1 , 1 b 1 F M v , v , 1 , 0 .
Which implies
( 1 b ) 1 F M v , v , 1 < 0 , 0 .
Noticing that b < 1 , F M ( v , v , ) = 1 , i.e., v = v .
Let u is any FP of and S in ∁, i.e., u v . Then
1 F M ( u , v , ) 1 = 1 F M ( S u , v , ) 1 a 1 F M ( u , S u , ) 1 + b 1 F M ( v , v , ) 1 = a 1 F M ( u , u , ) 1 + b 1 F M ( v , v , ) 1 = 0 .
This proves that F M ( u , v , ) = 1 , and u = v . That is yields a unique FP .   □
The following provides the convergence result for fuzzy-Kannan-contraction of type-I for a single-valued mapping .
Corollary 1. 
Suppose , F M , be a complete F M space. Let : is a self-mapping such that;
1 F M ( ϖ , ς , ) 1 a 1 F M ( ϖ , ϖ , ς ) 1 + b 1 F M ( ς , ς , ) 1 ,
for all ( ϖ , ς ) × and a + b < 1 2 , a , b > 0 . Then, there is only one FP in for the map ℶ.
The fuzzy-Kannan-contraction of type-II within the fuzzy-metric setup for two mappings S and forms the basis of the common FP result that follows.
Corollary 2. 
Suppose , F M , is complete F M space. Let S , : be self-mappings. Suppose that for γ [ 0 , 1 2 ) such that
1 F M ( S ϖ , ς , ) 1 γ 1 ( F M ( ϖ , S ϖ , ) 1 + 1 F M ( ς , ς , ) 1 ,
for all ( ϖ , ς ) × . Then, S and ℶ have at most one common FP in .
Proof. 
Assuming that ϖ 0 is an arbitrary point, define the sequence ϖ n as follows:
S ϖ 2 j = ϖ 2 j + 1 , and ϖ 2 j + 1 = ϖ 2 j + 2 ; j = 0 , 1 , 2 ,
Using (10), and (5), we can write
1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 = 1 F M S ϖ 2 j , ϖ 2 j + 1 , 1 γ 1 F M ϖ 2 j , S ϖ 2 j , 1 + 1 F M ϖ 2 j + 1 , ϖ 2 j + 1 , 1 = γ 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 + 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1
This implies
( 1 γ ) 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 γ 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 = 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 < γ 1 γ 1 F M ϖ 2 j , ϖ 2 j + 1 , 1 = γ 1 F M ϖ 2 j , ϖ 2 j + 1 , 1
where γ 1 γ = γ < 1 2 . Similarly,
1 F M ϖ 2 j + 2 , ϖ 2 j + 3 , 1 < γ 1 γ 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 = γ 1 F M ϖ 2 j + 1 , ϖ 2 j + 2 , 1 .
The procedure is the same as in Theorem 1 to derive the common FP of the maps S and . □
The convergence result of a single mapping for fuzzy-Kannan-contraction of type-II is as follows.
Theorem 2. 
Suppose , F M , is a complete F M space. Let : be self-mapping. Suppose that for γ [ 0 , 1 2 ) such that
1 F M ( ϖ , ς , ) 1 γ 1 F M ( ϖ , ϖ , ) 1 + 1 F M ( ς , ς , ) 1
for all ( ϖ , ς ) × . Then, mapping ℶ has at most one common FP in .

4. Convergence Results for Fuzzy-Graph-Kannan Contractions

Definition 15. 
Let ( , F M , ) is a F M space endowed with graph £, and the operator : is called fuzzy-graph-£-Kannan operator, if:
(1) 
( ϖ , ς ) E ( £ ) ( ϖ , ς ) E ( £ ) , ϖ , ς ;
(2) 
The values a , b are positive ( a + b < [ 0 , 1 2 ) ), and for every pair ( ϖ , ς ) E ( £ ) , we have:
1 F M ( ϖ , ς , ) 1 a 1 F M ( ϖ , ( ϖ ) , ) 1 + b 1 F M ( ς , ( ς ) , ) 1
Remark 1. 
Any Kannan contraction is a Kannan £ 0 -contraction, with £ 0 is defined by E £ 0 = × .
Theorem 3. 
Let ( , F M , ) is a complete metric space endowed with a directed graph £, and : is a £-Kannan contraction. Under the assumption that:
(1) 
For any sequence ϖ n in , if lim n ϖ n = ϖ and ϖ n , ϖ n + 1 , E ( £ ) for all n N , then there is a subsequence ϖ n k of ϖ n , such that ϖ n k , ϖ , E ( £ ) for all k N .
(2) 
If £ is ℶ-connected,
then ℶ is a P O .
Specifically, we consider ( , F M , ) as a F M -space with a graph indicated by £. In this case, £ represents a directed graph, with its vertex set V ( £ ) being ∁ and E ( £ ) Δ . We ensure that there are no parallel edges in £. Each edge corresponds to a different element from ( , F M , ) . The following findings are essential in demonstrating the upcoming FP theorems.
Definition 16. 
Let ( , F M , ) is a F M space endowed with a graph £, and : is a mapping. We say that the graph £ is ℶ-connected if for all vertices ϖ i , ς of £ with ( ϖ i , ς , ) E ( £ ) , there exists a path in £ , ϖ i i = 0 N from ϖ to ς such that ϖ 0 = ϖ , ϖ n = ς and ϖ i , ϖ i , E ( £ ) for all i = 1 , , N 1 . A graph £ is weak ℶ-connected, if £ ˜ is ℶ-connected.
Lemma 6. 
Let ( , F M , ) is a F M space endowed with a graph £, and : is a fuzzy-graph-£-Kannan operator such that the graph £ is ℶ-connected. For all ϖ the sequence n ϖ n N is a Cauchy sequence.
Proof. 
For a fixed value ϖ , two cases arise:
  • ( C 1 )  If ( ϖ , ϖ , ) E ( £ ) then by Lemma 5, we have
    1 F M n ϖ , n + 1 ϖ , 1 γ n 1 F M ( ϖ , ϖ , ) 1
    for all n N , where, γ = a 1 b . Because γ < 1 , we obtain
    n = 0 1 F M n ϖ , n + 1 ϖ , 1 = 1 1 γ 1 F M ( ϖ , ϖ , ) 1 < ,
    demonstrating that the Cauchy sequences have the form n ϖ n N .
  • ( C 2 )  If ( ϖ , ϖ , ) E ( £ ) . There is a path from ϖ to ϖ in £ , ϖ i i = 0 N , where ϖ 0 = ϖ , ϖ n = ϖ with ϖ i 1 , ϖ i , E ( £ ) all i = 1 , , N , and ϖ i , ϖ i , E ( £ ) for all i = 1 , , N 1 . As a result of employing the inequality of the fuzzy metric, we obtain
    1 F M n ϖ , n + 1 ϖ , 1 i = 1 N 1 F M n ϖ i 1 , n ϖ i , 1 a i = 1 N 1 F M n 1 ϖ i 1 , n ϖ i 1 , 1 + b i = 1 N 1 F M n 1 ϖ i , n ϖ i , 1 a 1 F M n 1 ϖ , n ϖ , 1 + a γ n 1 i = 2 N 1 F M ϖ i 1 , ϖ i 1 , 1 + b 1 F M n ϖ , n + 1 ϖ , 1 + b γ n 1 i = 1 N 1 1 F M ϖ i , ϖ i , 1 .
    Define
    ϖ n : = i = 1 N 1 F M n ϖ i 1 , n ϖ i , 1 , n N
    and
    r ( ϖ ) : = ( b + c ) i = 2 N 1 F M ϖ i 1 , ϖ i 1 , 1 .
    We infer,
    ϖ n a ϖ n 1 + ( a + b ) γ n 1 r ( ϖ ) + b ϖ n .
    We can put the above inequality as
    ϖ n γ ϖ n 1 + a + b 1 b γ n 1 r ( ϖ ) , where , γ = a 1 b .
    By elementary calculations, we have
    ϖ n n a + b 1 b γ n 1 r ( ϖ ) ,
    for all n N . Since γ [ 0 , 1 ] , we find that
    n = 0 1 F M n ϖ , n + 1 ϖ , 1 n = 0 ϖ n a + b 1 b r ( ϖ ) n = 0 n γ n 1 = a + b ( 1 b ) ( 1 γ ) 2 r ( ϖ ) < ,
    thereby showing that n ϖ n 0 is a Cauchy sequence.
The primary outcome of this section is expressed in the subsequent theorem. □
Theorem 4. 
Let ( , F M , ) be a complete F M space endowed with a graph £, and : be a fuzzy-graph-£-Kannan operator. We assume that:
(i) 
£ is ℶ-connected;
(ii) 
For any ϖ n n N in , if ϖ n ϖ , and ϖ n , ϖ n + 1 , E ( £ ) for n N then a subsequence ϖ k n n N with ϖ k n , ϖ , E ( £ ) for n N . Then, ℶ is a PO.
Proof. 
By Lemma 6, n ϖ n 0 is a Cauchy sequence for all ϖ , and from hypothesis, we have n ϖ n 0 is convergent. Let ϖ , ς then n ϖ n 0 ϖ , and n n 0 ς , as n .
(a)
If ( ϖ , ς , ) E ( £ ) , we have n ϖ , n ς , E ( £ ) for all n N , then
1 F M n ϖ , n ς , 1 a 1 F M n 1 ϖ , n ϖ , 1 + b 1 F M n 1 ς , n ς , 1
for all n N . Letting n we obtain 1 F M ϖ , ς , 1 a 1 F M ϖ , ς , 1 because a < 1 , we attain ϖ = ς .
(b)
If ( ϖ , ς , ) E ( £ ) , there is path in £ , ϖ i i = 0 N from ϖ to ς such that ϖ 0 = ϖ , ϖ n = ς with ϖ i 1 , ϖ i , E ( £ ) for all i = 1 , , N , and ϖ i , ϖ i , E ( £ ) for all i = 1 , , N 1 . Then, n ϖ i 1 , n ϖ i , E ( £ ) for all n N , and i = 1 , , N , and by the triangle inequality we obtain
1 F M n ϖ , n ς , 1 i = 1 N 1 F M n ϖ i 1 , n ϖ i , 1 a i = 1 N 1 F M n 1 ϖ i 1 , n ϖ i 1 , 1 + b i = 1 N 1 F M n 1 ϖ i , n ϖ i , 1 .
By Lemma 6 and by the given hypothesis, the series n ϖ i n 0 is convergent, as does the continuity, which states that the sequence 1 F M n ϖ i 1 , n ϖ i , 1 n N is convergent. Let lim n 1 F M n ϖ i 1 , n ϖ i , 1 : = i for all i = 1 , , N . Let n obtain i = 0 for all i = 1 , , N that is 1 F M ϖ , ς , 1 0 , hence ϖ = ς . Therefore, for all ϖ there exists a unique ϖ such that
lim n n ϖ = ϖ .
Now, we will prove that ϖ F i x . Because the graph £ is -connected, there is at least ϖ 0 such that ϖ 0 , ϖ 0 , E ( £ ) so n ϖ 0 , n + 1 ϖ 0 E ( £ ) for all n N . But lim n n ϖ 0 = ϖ , then there is a subsequence k n ϖ 0 n N with k n ϖ 0 , ϖ , E ( £ ) for all n N , we have the following
1 F M ϖ , ϖ , 1 1 F M ϖ , k n + 1 ϖ 0 , 1 + 1 F M k n + 1 ϖ 0 , ϖ , 1 1 F M ϖ , k n + 1 ϖ 0 , 1 + a 1 F M k n + 1 ϖ 0 , k n ϖ 0 , 1 + b 1 F M ϖ , ϖ , 1 .
Now, letting n , we obtain 1 F M ϖ , ϖ , 1 b 1 F M ϖ , ϖ , 1 ϖ = ϖ , that is, ϖ F i x . Furthermore, if we have, ς = ς for some ς , then from above, we must have n ς ϖ , so that ς = ϖ , and therefore, is a PO. □
Example 2. 
Let us consider a set , which is defined as the union of two subsets of the real numbers, R : Q and Q . F M is a fuzzy metric that is defined as follows: × × ( 0 , ) ( 0 , 1 ] . It can be expressed as follows: F M ( ϖ , ς , ) = ς ς + d ( ϖ , ς ) , where d denotes the standard metric on . Now, we define a transformation : R R by the following
ϖ = 1 , if ϖ Q 0 , if ϖ Q
Let η ( ς ) = ς 1 2 , for all ς ] 0 , 1 [ , and if ϖ , ς Q , then ϖ = ς = 1 and E ϖ = E ς = [ 0 , 3 ] . Also,
F M ( ϖ , ς , k ) = 1 γ F M E ϖ , E ς ,
when ϖ , ς Q . Then, ϖ = ς = 0 and E ϖ = E ς = [ 7 , 9 ] . In this case, we have
F M ( ϖ , ς , k t ) = 1 γ F M E ϖ , E ς ,
If ϖ Q and ς Q or ϖ Q , and ς Q , then E ϖ = [ 0 , 3 ] and E ς = [ 7 , 9 ] or E ϖ = [ 7 , 9 ] and E ς = [ 0 , 3 ] . For k 5 6 , we acquire
F M ϖ , ς , 5 6 = 5 6 ς 5 6 ς + 1 γ F M E ϖ , E ς ,
Figure 1 authenticates validating the fuzzy-graph-Kannan contraction introduced in Definition 15.
Note that ( ) = { 0 , 1 } E ϖ = [ 0 , 3 ] [ 7 , 9 ] . As a result, Theorem 4 meets all of the specified requirements.
Theorem 5. 
Let ( , F M , ) is a complete F M space, and : is a mapping satisfying the following
0 F M ( ϖ , ς , k ς ) ϖ ( ς ) d ς 0 γ ( ϖ , ς , ) ϖ ( ς ) d ς
where
F M ( ϖ , ς , ) = 1
and
γ ( ϖ , ς , ) = min F M ( ς , ς , ) [ 1 + F M ( ϖ , ϖ , ) ] [ 1 + F M ( ϖ , ς , ) ] , F M ( ϖ , ς , )
for all ϖ , ς , ϖ Ψ , and k ( 0 , 1 ) . Then, ℶ has a unique FP .
Proof. 
By taking ϖ ( ς ) = 1 , and applying Theorem 4, we obtain the result. □

5. Fractional-Differential Equations ( F . D . E ) and Fixed-Point Solution

Fractional differential equations ( F . D . E ) are practical tools for modeling and analyzing physical systems with continuous distributions or interactions. In engineering research, they are frequently used to derive correlations between numbers or to describe phenomena in greater detail than differential equations alone can. They offer a framework for comprehending complicated behaviors and interactions in various engineering systems. Differential equations of the implicit kind, particularly F . D . E s, have a wide range of applications in engineering research. In this section, we prove the existence of a unique solution of the F . D . E . These kinds of differential equations are frequently employed in engineering. Digital circuit evaluation, mechanical design strain and fluid circulation simulation, structural evaluation, control mechanisms, data processing operations, material scientific research, heat exchange, and magnetic field assessment for radars all depend on them. They also help with inverse problems associated with ophthalmology and acoustically for wave propagation and diffraction studies, as well as in geophysics, non-destructive testing, and medical imaging. These formulas offer an adaptable framework for comprehending and evaluating continuous distributions and interactions across a range of engineering specialties.
F . D . E s are essential in modeling real-world scientific, engineering, and decision-making events. They provide a nuanced viewpoint by including linearity, nonlinearity, determinism, and stochasticity in mathematical models. Khan et al. [23] investigated the presence, stability, and computational characteristics of F . D . E s in aquatic illness models. They used fractal-fractional derivatives and a modified Atangana–Baleanu derivative to prove the solution’s existence, demonstrating convergence approaches. Notably, their work demonstrated the power of fractal fractional operators, providing new insights into system dynamics. More synthesis on how F . D . E s have also been the center of research for the fixed point theorists; we recommend [24].
Let us start by going over the basic terminology of fractional calculus.
The Riemann–Liouville-fractional derivative of order p > 0 for a function ϰ C [ 0 , 1 ] is written as follows:
The expression
( Γ ( k p ) ) 1 d k d g k 0 g ϰ ( d ) d d ( g d ) p k + 1 = D p ϰ ( g ) ,
If the right side is point-wise defined on the interval [ 0 , 1 ] , then this is true. In this case, the Euler-gamma function is denoted by Γ , while the integer portion of p is represented as p .
Let us now consider the following F . D . E
d D μ ϰ ( g ) + f ( g , ϰ ( g ) ) = 0 , g [ 0 , 1 ] and μ ( 1 , 2 ] ; ϰ ( 0 ) = 0 = ϰ ( 1 ) ,
where f is a continuous function on [ 0 , 1 ] × R , and d D μ is the Caputo-fractional-derivative having order μ , defined by
c D μ = ( Γ ( k μ ) ) 1 0 g ϰ ( k ) ( d ) d d ( g d ) 1 + μ k .
Denote by Y , the space C ( [ 0 , 1 ] , R ) of all continuous functions taken on the interval [0,1]. Define a metric d on Y by
d ( ϰ , ϰ ) = sup g [ 0 , 1 ] | ϰ ( g ) ϰ ( g ) | 2 , ϰ , ϰ Y .
Then, ( Y , d ) is a complete metric-space. The binary operation * is defined by product -norm P : P ( ϖ , ς ) = ϖ · ς .
A standard fuzzy metric F M is given as
1 F M ( ϰ , ϰ , g ) 1 = d ( ϰ , ϰ ) g , for g > 0 , ϰ , ϰ .
Then, one can easily verify that F M is triangular and , f M , is a complete fuzzy metric space.
Theorem 6. 
Consider the nonlinear F . D . E (9). If the underlying conditions are met:
(i) 
For g [ 0 , 1 ] and ϰ , ϰ Y , the following is true
| f ( g , ϰ ) f ( g , ϰ ) | | ϰ ( g ) ϰ ( g ) | + | ϰ ( g ) ϰ ( g ) | ;
(ii) 
there exists r ; 3 < r with
1 r sup g [ 0 , 1 ] 0 1 Ω ( g , d ) d d .
Then, the F . D . E . (9) has necessarily at most one solution in Y .
Proof. 
The equivalent I . E . for F . D . E . (9) is the following
ϰ ( g ) = 0 1 Ω ( g , d ) f ( d , ϰ ( d ) ) d d ,
for all ϰ Y and g [ 0 , 1 ] , where
Ω ( g , d ) = [ g ( 1 d ) ] μ 1 ( g d ) μ 1 Γ ( μ ) , 0 d g 1 , [ g ( 1 d ) ] μ 1 Γ ( μ ) , 0 g d 1 .
If for the map : Y Y defined by
ϰ ( g ) = 0 1 Ω ( g , d ) f ( d , ϰ ( d ) ) d d ,
ϰ Y is a FP , then ϰ is a solution of the problem (9).
Taking into account the given conditions, for ϰ , ϰ Y , we infer
d ( ϰ , ϰ ) = sup 0 g 1 | ϰ ( g ) ϰ ( g ) | = sup 0 g 1 | 0 1 Ω ( g , d ) f ( d , ϰ ( d ) ) d d . 0 1 Ω ( g , d ) f ( d , ϰ ( d ) ) d d . | sup 0 g 1 0 1 | Ω ( g , d ) | d d . 0 1 | f ( d , ϰ ( d ) ) f ( d , ϰ ( d ) ) | d d 1 r sup 0 g 1 | f ( d , ϰ ( g ) ) f ( d , ϰ ( g ) ) | 1 r sup 0 g 1 | ϰ ( g ) ϰ ( g ) | 2 + | ϰ ( g ) ϰ ( g ) | .
This shows that
d ( ϰ , ϰ ) 1 r d ( ϰ , ϰ ) + d ( ϰ , ϰ )
Put 1 r = γ < 1 2 , we can write
d ( ϰ , ϰ ) γ d ( ϰ , ϰ ) + d ( ϰ , ϰ )
The above expression can be written as
1 F M ( ϰ , ϰ , g ) 1 γ 1 F M ( ϰ , ϰ , g ) 1 + 1 F M ( ϰ , ϰ , g ) 1 ,
for all ϰ , ϰ Y . This leads to the conclusion that satisfies the Fuzzy-contraction of Theorem 2. As a result, concedes a unique fixed-point in Y , implying that the F . D . E . (9) has a unique solution. □

6. An Application to the Equation of Motion

The equations of motion provide the mathematical foundation for comprehending the complex dynamics of particles and systems impacted by forces. These equations are crucial in kinematics, correctly portraying position, velocity, acceleration, and displacement connections. Furthermore, they lead to the development of differential equations, allowing for modeling and predicting system behaviors across time. This mathematical basis lies at the heart of numerical analytic techniques, enabling the creation of algorithms that imitate real-world dynamics.
These equations are common and vital in engineering across many fields. They are essential in mechanical engineering for assessing and optimizing the performance of machinery, engines, and vehicles. Civil engineers use these equations to examine the structural integrity and behavior of buildings, bridges, and infrastructure under various loads and environmental circumstances. They are critical in aeronautical engineering for forecasting trajectories, assuring stability, and building airplanes and spacecraft.
The applications also include control systems, where equations of motion are used to help develop strategies that govern how robots, automation, and manufacturing equipment behave. Electrical engineering also uses these equations to explain how electrical systems and parts, including motors and generators, behave. These formulas are fundamental to comprehending, assessing, and forecasting the behavior of physical systems and are used in a wide range of scientific and technical contexts.
Problem statement: A particle of mass m is at rest at = 0 , = 0 . A force L starts activity on it in a particular direction such that its velocity immediately jumps from 0 to 1 after = 0 . Find the position of the particle at time ⋏. The corresponding motion of the particle is governed by the following second-order differential equation.
m d 2 d 2 = L ( , ( ) ) , ( 0 ) = 0 , ( 0 ) = 1 ,
for all [ 0 , 1 ] and L : [ 0 , 1 ] × R R , is a continuous function. We are interested in finding the solution of Equation (11), which tells us the nature of the particle’s motion, i.e., how the particle moves.
The Green function of the problem defined in (11) is equivalent to
G ˙ ( , s ) = ; 1 s 0 , 2 s ; 1 s 0 .
We now prove the existence of a solution to the second-order differential Equation (11).
Theorem 7. 
Suppose for the mappings L : [ 0 , 1 ] × R R the following holds:
L ( , a ) L ( , b ) sup a , b [ 0 , 1 ] a b , for all [ 0 , 1 ] .
Then, the second order differential Equation (11) governing the equation of motion of a particle has a solution in Y .
Proof. 
We note that the solution of (11) is equivalent to finding the solution of the following integral equation
( ) = 0 1 G ˙ ( , s ) L ( s , ( s ) ) d s , [ 0 , 1 ] .
Integral Equation (12) is equivalent to the second order IVP (11), which is constructed with the help of Green’s function G ˙ ( , s ) .
If h b a r is a FP of the map : Y Y defined by
( ) = 0 1 G ˙ ( , s ) L ( s , ( s ) ) d s , [ 0 , 1 ] ,
then h b a r is a solution of the problem (11).
Taking the same metric defined in Section 5 with Y , the space C ( [ 0 , 1 ] , R ) of all continuous functions taken on the interval [0,1], and following the same procedure as processed in Theorem 6, we can easily see that Γ concedes a fixed point, endorsing that the second order differential Equation (11) governing the equation of motion has a solution. □

7. Conclusions and Future Scope

In the situation of F M spaces, we developed novel and suitable extensions of Kannan-contraction and discovered their applicability to the solution of integral equations. This is the first attempt to solve £-graph-Kannan contraction in F M spaces that we are aware of. A few non-trivial examples and an application confirm the solution’s uniqueness. Finally, we used the manuscript’s significant contents to offer a novel application in which we derived the existence of solutions of two nonlinear problems, namely F . D . E s and the differential equations corresponding to particle motion in very generic conditions.
On the one hand, additional research is needed into how to reformulate the contractivity condition so that FP theory can be developed in more general abstract metric spaces. Kannan mappings are essential in FP theory because of the “Metric Completeness Characterization” described in the introduction. An intriguing question arises: can the results established in this paper be used to acquire Fuzzy-metric completeness, and can the results be proven within the fuzzy-graphical metic setup?

Author Contributions

Conceptualization, M.Y.; methodology, M.Y. and A.A.N.A.; supervision, A.A.N.A.; software, M.Y.; validation, M.Y. and A.A.N.A.; formal analysis, M.Y.; investigation, M.Y.; writing—original draft preparation, M.Y; writing—review and editing, A.A.N.A.; visualization, M.Y.; project administration, A.A.N.A.; funding acquisition, A.A.N.A. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the University of Jeddah, Jeddah, Saudi Arabia, under grant No. (UJ-23-FR-72). The second author, therefore, thanks the University of Jeddah for its technical and financial support.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the referees for their insightful comments and valuable critiques, significantly enhancing our article. Their skill and attention to detail enhanced our work and study. We like their thorough assessment of our work and insightful suggestions that support our conclusions.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Banach, S. Sur les operations dans les ensembles abstraits et leur application aux equations integrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Tiammee, J.; Suantai, S. Coincidence point theorems for graph-preserving multi-valued mappings. Fixed Point Theory Appl. 2014, 2014, 70. [Google Scholar] [CrossRef]
  3. Ćirić, L.B. A generalization of Banach’s contraction principle. Proc. Amer. Math. Soc. 1974, 45, 267–273. [Google Scholar] [CrossRef]
  4. Reich, S. Fixed points of contractive functions. Boll. Unione Mat. Ital. 1972, 5, 26–42. [Google Scholar]
  5. Petrusel, A.; Rus, I.A. Fixed point theorems in ordered L-spaces. Proc. Amer. Math. Soc. 2006, 134, 411–418. [Google Scholar] [CrossRef]
  6. Younis, M.; Singh, D.; Abdou, A.N. A fixed point approach for tuning circuit problem in b-dislocated metric spaces. Math. Methods Appl. Sci. 2022, 45, 2234–2253. [Google Scholar] [CrossRef]
  7. Younis, M.; Bahuguna, D. A unique approach to graph-based metric spaces with an application to rocket ascension. Comput. Appl. Math. 2023, 42, 44. [Google Scholar] [CrossRef]
  8. Kannan, R. Some remarks on fixed points. Bull. Calcutta Math. Soc. 1960, 60, 71–76. [Google Scholar]
  9. Kramosil, I.; Michálek, J. Fuzzy metrics and statistical metric spaces. Kybernetika 1975, 11, 336–344. [Google Scholar]
  10. George, A.; Veeramani, P. On some results in fuzzy metric spaces. Fuzzy Sets Syst. 1994, 64, 395–399. [Google Scholar] [CrossRef]
  11. Chen, L.; Yang, N.; Zhao, Y. Fixed point theorems for set-valued G-contractions in a graphical convex metric space with applications. J. Fixed Point Theory Appl. 2020, 22, 88. [Google Scholar] [CrossRef]
  12. Chen, L.; Yang, N.; Zhao, Y. Fixed point theorems for the Mann’s iteration scheme in convex graphical rectangular b-metric spaces. Optimization 2022, 70, 1359–1373. [Google Scholar] [CrossRef]
  13. Younis, M.; Ahmad, H.; Chen, L.; Han, M. Computation and convergence of fixed points in graphical spaces with an application to elastic beam deformations. J. Geom. Phys. 2023, 192, 104955. [Google Scholar] [CrossRef]
  14. Jabeen, S.; Koksal, M.E.; Younis, M. Convergence results based on graph-Reich contraction in fuzzy metric spaces with application. In Nonlinear Analysis: Modelling and Control; Vilnius University Press: Vilnius, Lithuania; pp. 1–25. [CrossRef]
  15. Gregori, V.; Sapena, A. On fixed-point theorems in fuzzy metric spaces. Fuzzy Sets Syst. 2002, 125, 245–252. [Google Scholar] [CrossRef]
  16. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  17. Schweizer, B.; Sklar, A. Statistical metric spaces. Pacific J. Math. 1960, 10, 313–334. [Google Scholar] [CrossRef]
  18. Samreen, M.; Hussain, S.; Aydi, H.; Gaba, Y.U. κG-Contractive mappings in fuzzy metric spaces. J. Math. 2022, 2022, 5920124. [Google Scholar] [CrossRef]
  19. Choudhur, B.S.; Das, K.; Das, P. Extensions of Banach’s and Kannan’s Results in fuzzy metric spaces. Commun. Korean Math. Soc. 2012, 27, 265–277. [Google Scholar] [CrossRef]
  20. Shukla, S. Fixed point theorems of £-fuzzy contractions in fuzzy metric spaces endowed with a graph. Commun. Math. 2014, 22, 1–12. [Google Scholar]
  21. Jabeen, S.; Zheng, Z.; Rehman, M.U.; Wei, W.; Alzabut, J. Some Fixed Point Results of Weak-Fuzzy Graphical Contraction Mappings with Application to Integral Equation. Mathematics 2021, 9, 541. [Google Scholar] [CrossRef]
  22. Bojor, F. Fixed points of Kannan mappings in metric spaces endowed with a graph. An. Stiintifice Univ. Ovidius Constanta 2012, 20, 31–40. [Google Scholar] [CrossRef]
  23. Khan, H.; Alzabut, J.; Tunç, O. Kaabar M.K. A fractal–fractional COVID-19 model with a negative impact of quarantine on the diabetic patients. Results Control Optim. 2023, 10, 100199. [Google Scholar] [CrossRef]
  24. Abdou, A.A.N. Solving a Nonlinear Fractional Differential Equation Using Fixed Point Results in Orthogonal Metric Spaces. Fractal Fract. 2023, 7, 817. [Google Scholar] [CrossRef]
Figure 1. Validation of inequality fuzzy-graph-Kannan contraction.
Figure 1. Validation of inequality fuzzy-graph-Kannan contraction.
Fractalfract 08 00028 g001
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

Younis, M.; Abdou, A.A.N. Novel Fuzzy Contractions and Applications to Engineering Science. Fractal Fract. 2024, 8, 28. https://doi.org/10.3390/fractalfract8010028

AMA Style

Younis M, Abdou AAN. Novel Fuzzy Contractions and Applications to Engineering Science. Fractal and Fractional. 2024; 8(1):28. https://doi.org/10.3390/fractalfract8010028

Chicago/Turabian Style

Younis, Mudasir, and Afrah Ahmad Noman Abdou. 2024. "Novel Fuzzy Contractions and Applications to Engineering Science" Fractal and Fractional 8, no. 1: 28. https://doi.org/10.3390/fractalfract8010028

APA Style

Younis, M., & Abdou, A. A. N. (2024). Novel Fuzzy Contractions and Applications to Engineering Science. Fractal and Fractional, 8(1), 28. https://doi.org/10.3390/fractalfract8010028

Article Metrics

Back to TopTop