Ultrametrics and complete multipartite graphs

From MaRDI portal
Publication:6363045

DOI10.20429/TAG.2022.090108zbMATH Open1508.54014arXiv2103.09470MaRDI QIDQ6363045FDOQ6363045


Authors: V. V. Bilet, Aleksey A. Dovgoshey, Yu. N. Kononov Edit this on Wikidata


Publication date: 17 March 2021

Abstract: We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space (X,d) is ultrametric iff the diametrical graph of the metric dvarepsilon(x,y)=maxd(x,y),varepsilon is either empty or complete multipartite for every varepsilon>0. A refinement of the last result is obtained for totally bounded spaces. Moreover, using complete multipartite graphs we characterize the compact ultrametrizable topological spaces. The bounded ultrametric spaces, which are weakly similar to unbounded ones, are also characterized via complete multipartite graphs.













This page was built for publication: Ultrametrics and complete multipartite graphs

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