Common best proximity point theorems in JS-metric spaces endowed with graphs (Q2037313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Common best proximity point theorems in JS-metric spaces endowed with graphs |
scientific article; zbMATH DE number 7365471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Common best proximity point theorems in JS-metric spaces endowed with graphs |
scientific article; zbMATH DE number 7365471 |
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
0 references
0 references
0 references
0.8826919198036194
0 references
0.8329614400863647
0 references
0.8213037848472595
0 references
0.8198457956314087
0 references
