Graph Comparison Meets Alexandrov

N. D. Lebedeva; A. M. Petrunin

doi:10.1134/S0037446623030102

Graph Comparison Meets Alexandrov

N. D. Lebedeva, A. M. Petrunin

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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	https://doi.org/10.1134/S0037446623030102
State	Published - May 2023

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1134/S0037446623030102

Cite this

@article{19608d8d950148b79f349262f0ce3a38,

title = "Graph Comparison Meets Alexandrov",

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{\textquoteright}s comparisons.The proof gives a complete description of graphs with trivial graph comparisons.",

author = "Lebedeva, {N. D.} and Petrunin, {A. M.}",

note = "Publisher Copyright: {\textcopyright} 2023, Pleiades Publishing, Ltd.",

year = "2023",

month = may,

doi = "10.1134/S0037446623030102",

language = "English (US)",

volume = "64",

pages = "624--628",

journal = "Siberian Mathematical Journal",

issn = "0037-4466",

publisher = "Pleiades Publishing",

number = "3",

}

TY - JOUR

T1 - Graph Comparison Meets Alexandrov

AU - Lebedeva, N. D.

AU - Petrunin, A. M.

PY - 2023/5

Y1 - 2023/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85160242534&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85160242534&partnerID=8YFLogxK

U2 - 10.1134/S0037446623030102

DO - 10.1134/S0037446623030102

M3 - Article

AN - SCOPUS:85160242534

SN - 0037-4466

VL - 64

SP - 624

EP - 628

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

IS - 3

ER -

Graph Comparison Meets Alexandrov

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this