Abstract
Graph comparison is a certain type of condition on the metric space encoded by a finite graph.We show that each nontrivial graph comparison implies one of Alexandrov’s comparisons.The proof gives a complete description of graphs with trivial graph comparisons.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 624-628 |
| Number of pages | 5 |
| Journal | Siberian Mathematical Journal |
| Volume | 64 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 2023 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Fingerprint
Dive into the research topics of 'Graph Comparison Meets Alexandrov'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver