Proximinal sets and connectedness in graphs

DOI10.1007/s10958-023-06502-1arXiv2303.02739OpenAlexW4380606737MaRDI QIDQ6113259

Karim Chaira, Aleksey A. Dovgoshey

Publication date: 8 August 2023

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.02739

zbMATH Keywords

bipartite graphpathbest proximity pairultrametric spaceproximinal setsemimetric spaceconnected component of graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate selections, best approximations, fixed points, and invariant sets
• Best proximity pairs in ultrametric spaces
• Uniqueness of best proximity pairs and rigidity of semimetric spaces
• Bipartite graphs and best proximity pairs
• Convex Sets and Nearest Points
• A theorem on best approximations
• BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION IN ULTRAMETRIC SPACES
• Ultrametrics and Complete Multipartite Graphs

This page was built for publication: Proximinal sets and connectedness in graphs