Common Best Proximity Point Theorems in JS-Metric Spaces Endowed with Graphs | Zendy

Chaiporn Thangthong | Zendy; Phakdi Charoensawan | Zendy; Supreedee Dangskul | Zendy; Narawadee Phudolsitthiphat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Common Best Proximity Point Theorems in JS-Metric Spaces Endowed with Graphs

Author(s) -

Chaiporn Thangthong,

Phakdi Charoensawan,

Supreedee Dangskul,

Narawadee Phudolsitthiphat

Publication year - 2021

Publication title -

journal of function spaces

Language(s) - English

Resource type - Journals

eISSN - 2314-8896

pISSN - 2314-8888

DOI - 10.1155/2021/5524494

Subject(s) - metric space , mathematics , metric (unit) , point (geometry) , discrete mathematics , combinatorics , computer science , economics , geometry , operations management

In this paper, we introduce a notion of G -proximal edge preserving and dominating G -proximal Geraghty for a pair of mappings, which will be used to present some existence and uniqueness results for common best proximity points. Here, the mappings are defined on subsets of a JS-metric space endowed with a directed graph. An example is also provided to support the results. Moreover, we apply our result to a similar setting, where the JS-metric space is endowed with a binary relation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research