A remark on Jleli–Samet’s best proximity point theorems for α-ψ-contraction mappings
نویسندگان
چکیده
Abstract Inspired by the work of Jachymski, we slightly extend some fixed point theorems with a graph and show that best proximity for α - ψ -contraction mappings Jleli Samet can be deduced our results.
منابع مشابه
On best proximity points for multivalued cyclic $F$-contraction mappings
In this paper, we establish and prove the existence of best proximity points for multivalued cyclic $F$- contraction mappings in complete metric spaces. Our results improve and extend various results in literature.
متن کاملFixed point theorems for α-ψ-ϕ-contractive integral type mappings
In this paper, we introduce a new concept of α-ψ-ϕ-contractive integral type mappings and establish some new fixed point theorems in complete metric spaces.
متن کاملBest Proximity Point Theorems for F -contractive Non-self Mappings
In this article, we prove the existence of a best proximity point for F contractive nonself mappings and state some results in the complete metric spaces. Also we define two kinds of F proximal contraction and extend some best proximity theorems and improve the recent results. 2010 Mathematics Subject Classification: 46N40; 47H10; 54H25; 46T99
متن کاملBest Proximity Point Theorems for Some New Cyclic Mappings
Let A and B be nonempty subsets of a metric space X, d . Consider a mapping T : A ∪ B → A ∪ B, T is called a cyclic map if T A ⊆ B and T B ⊆ A. x ∈ A is called a best proximity point of T in A if d x, Tx d A,B is satisfied, where d A,B inf{d x, y : x ∈ A, y ∈ B}. In 2005, Eldred et al. 1 proved the existence of a best proximity point for relatively nonexpansive mappings using the notion of prox...
متن کاملBest Proximity Point Theorems for Non-self Mappings
Let us consider a pair (A, B) of nonempty subsets of a metric space X and a mapping T : A → B. In this article, we introduced a notion called P−property and used it to prove sufficient conditions for the existence of a point x0 ∈ A, called best proximity point, satisfying d(x0, Tx0) = dist(A, B) := inf{d(a, b) : a ∈ A, b ∈ B}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Algorithms for Sciences and Engineering
سال: 2023
ISSN: ['2730-5422']
DOI: https://doi.org/10.1186/s13663-023-00745-y