Abstract
For arbitrary semimetric space and disjoint proximinal subsets , of we define the proximinal graph as a bipartite graph with parts and whose edges satisfy the equality . We characterize the semimetric spaces whose proximinal graphs have at most one edge and the semimetric spaces whose proximinal graphs have the vertices with degree at most only. This allows us to describe the necessary and sufficient conditions for uniqueness of the best proximity pairs and best approximations.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.