Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov
Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov
Theory and Applications of Graphs
Let (X, d) be a semimetric space and let G be a graph. We say that G is the diametrical graph of (X, d) if X is the vertex set of G and the adjacency of vertices x and y is equivalent to the equality diam X = d(x, y). It is shown that a semimetric space (X, d) with diameter d* is ultrametric if the diametrical graph of (X, d ε) with d ε (x, y) = min{d(x, y), ε} is complete multipartite for every ε ∈ (0, d* …