Bipartite graphs and best proximity pairs
From MaRDI portal
Publication:2683534
DOI10.1007/s10958-022-06005-5OpenAlexW4288056584MaRDI QIDQ2683534
Samih Lazaiz, Karim Chaira, Aleksey A. Dovgoshey
Publication date: 13 February 2023
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07289
bipartite graphcomplete bipartite graphbest proximity pairultrametric spaceproximinal setsemimetric space
Metric spaces, metrizability (54E35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Saturation in approximation theory (41A40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trees, ultrametrics, and noncommutative geometry
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
- On the Gomory-Hu inequality
- On spaces extremal for the Gomory-Hu inequality
- An embedding, an extension, and an interpolation of ultrametrics
- Indivisible ultrametric spaces
- Best approximation in ultrametric spaces
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Weak similarities of finite ultrametric and semimetric spaces
- Trees and ultrametric Möbius structures
- Diameter and diametrical pairs of points in ultrametric spaces
- Trees and ultrametric spaces: A categorical equivalence
- Combinatorial properties of ultrametrics and generalized ultrametrics
- The range of ultrametrics, compactness, and separability
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- Best proximity pairs in ultrametric spaces
- On best proximity point theorems in locally convex spaces endowed with a graph
- Finite ultrametric balls
- On some extremal properties of finite ultrametric spaces
- From isomorphic rooted trees to isometric ultrametric spaces
- Properties and morphisms of finite ultrametric spaces and their representing trees
- How rigid the finite ultrametric spaces can be?
- The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
- Subdominant pseudoultrametric on graphs
- Best proximity points of contractive mappings on a metric space with a graph and applications
- On Cartesian Trees and Range Minimum Queries
- Ultrametric sets in Euclidean point spaces
- BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION IN ULTRAMETRIC SPACES
- Pictures of Ultrametric Spaces, the p-Adic Numbers, and Valued Fields
- Proximinal Retracts and Best Proximity Pair Theorems
- Isomorphism of Trees and Isometry of Ultrametric Spaces
- Proximal normal structure and relatively nonexpansive mappings
This page was built for publication: Bipartite graphs and best proximity pairs
