|
This article is cited in 15 scientific papers (total in 15 papers)
Subdominant pseudoultrametric on graphs
A. A. Dovgoshey, E. A. Petrov Institute of Applied Mathematics and Mechanics, Ukraine National Academy of Sciences, Donetsk
Abstract:
Let $(G,w)$ be a weighted graph. We find necessary and sufficient conditions under which the weight $w\colon E(G)\to \mathbb{R}^+$ can be extended to a pseudoultrametric on $V(G)$, and establish a criterion for the uniqueness of such an extension. We demonstrate that $(G,w)$ is a complete $k$-partite graph, for $k\geqslant 2$, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with $w$. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric.
Bibliography: 14 titles.
Keywords:
weighted graph, infinite graph, ultrametric space, shortest path metric, complete $k$-partite graph.
Received: 19.08.2011 and 27.02.2013
Citation:
A. A. Dovgoshey, E. A. Petrov, “Subdominant pseudoultrametric on graphs”, Sb. Math., 204:8 (2013), 1131–1151
Linking options:
https://www.mathnet.ru/eng/sm7925https://doi.org/10.1070/SM2013v204n08ABEH004333 https://www.mathnet.ru/eng/sm/v204/i8/p51
|
Statistics & downloads: |
Abstract page: | 420 | Russian version PDF: | 176 | English version PDF: | 13 | References: | 60 | First page: | 33 |
|