Graph Comparison Meets Alexandrov

N. D. Lebedeva, A. M. Petrunin

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)624-628
Number of pages5
JournalSiberian Mathematical Journal
Issue number3
StatePublished - May 2023

All Science Journal Classification (ASJC) codes

  • General Mathematics


Dive into the research topics of 'Graph Comparison Meets Alexandrov'. Together they form a unique fingerprint.

Cite this