Uniqueness of best proximity pairs and rigidity of semimetric spaces

From MaRDI portal
Publication:2680372




Abstract: For arbitrary semimetric space (X,d) and disjoint proximinal subsets A, B of X we define the proximinal graph as a bipartite graph with parts A and B whose edges a,b satisfy the equality d(a,b)=operatornamedist(A,B). 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 1 only. This allows us to describe the necessary and sufficient conditions for uniqueness of the best proximity pairs and best approximations.



Cites work









This page was built for publication: Uniqueness of best proximity pairs and rigidity of semimetric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680372)