Timeline for Is there any relationship between a tree(graph theory) and semi-metric?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2012 at 18:23 | comment | added | Andrew D. King | Let the distance between $x$ and $y$ be the square of the sum of the weights on the path between them. Then, as you can see with a path on three vertices where both edges have weight 1, the triangle inequality does not hold. Think of any semi-metric you can form on a subset of $\mathbb R^1$. Then you can form that on an edge-weighted path. | |
| Jun 27, 2012 at 10:09 | comment | added | K A Khan | what about semi-metric structure where the triangle inequality doesnt hold! | |
| Jun 27, 2012 at 8:35 | history | answered | baronbrixius | CC BY-SA 3.0 |