Common best proximity point theorems in JS-metric spaces endowed with graphs (Q2037313): Difference between revisions
From MaRDI portal
Latest revision as of 02:27, 26 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Common best proximity point theorems in JS-metric spaces endowed with graphs |
scientific article |
Statements
Common best proximity point theorems in JS-metric spaces endowed with graphs (English)
0 references
30 June 2021
0 references
Summary: 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.
0 references
\(G\)-proximal edge preserving
0 references
dominating \(G\)-proximal Geraghty
0 references
common best proximity point
0 references
JS-metric space
0 references
0 references
0 references
0 references
0 references
