Ultrametrics and Complete Multipartite 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)\...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Georgia Southern University
2022-06-01
|
| Edice: | Theory and Applications of Graphs |
| Témata: | |
| On-line přístup: | https://digitalcommons.georgiasouthern.edu/tag/vol9/iss1/8/ |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|