Geodesic Geometry on Graphs

Daniel Cizma; Nati Linial

doi:10.1007/s00454-021-00345-w

Geodesic Geometry on Graphs

Daniel Cizma^*
, Nati Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

8 Scopus citations

Abstract

We investigate a graph theoretic analog of geodesic geometry. In a graph G= (V, E) we consider a system of paths P= { P_u_,_v: u, v∈ V} where P_u_,_v connects vertices u and v. This system is consistent in that if vertices y, z are in P_u_,_v, then the subpath of P_u_,_v between them coincides with P_y_,_z. A map w: E→ (0 , ∞) is said to induceP if for every u, v∈ V the path P_u_,_v is w-geodesic. We say that G is metrizable if every consistent path system is induced by some such w. As we show, metrizable graphs are very rare, whereas there exist infinitely many 2-connected metrizable graphs.

Original language	English
Pages (from-to)	298-347
Number of pages	50
Journal	Discrete and Computational Geometry
Volume	68
Issue number	1
DOIs	https://doi.org/10.1007/s00454-021-00345-w
State	Published - Jul 2022

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Graph metrizability
Path systems
Shortest paths

Access to Document

10.1007/s00454-021-00345-w

Cite this

@article{9a44d012acf341e7bf599180f721d5ca,

title = "Geodesic Geometry on Graphs",

abstract = "We investigate a graph theoretic analog of geodesic geometry. In a graph G= (V, E) we consider a system of paths P= \{ Pu,v: u, v∈ V\} where Pu,v connects vertices u and v. This system is consistent in that if vertices y, z are in Pu,v, then the subpath of Pu,v between them coincides with Py,z. A map w: E→ (0 , ∞) is said to induceP if for every u, v∈ V the path Pu,v is w-geodesic. We say that G is metrizable if every consistent path system is induced by some such w. As we show, metrizable graphs are very rare, whereas there exist infinitely many 2-connected metrizable graphs.",

keywords = "Graph metrizability, Path systems, Shortest paths",

author = "Daniel Cizma and Nati Linial",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2022",

month = jul,

doi = "10.1007/s00454-021-00345-w",

language = "אנגלית",

volume = "68",

pages = "298--347",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Geodesic Geometry on Graphs

AU - Cizma, Daniel

AU - Linial, Nati

PY - 2022/7

Y1 - 2022/7

N2 - We investigate a graph theoretic analog of geodesic geometry. In a graph G= (V, E) we consider a system of paths P= { Pu,v: u, v∈ V} where Pu,v connects vertices u and v. This system is consistent in that if vertices y, z are in Pu,v, then the subpath of Pu,v between them coincides with Py,z. A map w: E→ (0 , ∞) is said to induceP if for every u, v∈ V the path Pu,v is w-geodesic. We say that G is metrizable if every consistent path system is induced by some such w. As we show, metrizable graphs are very rare, whereas there exist infinitely many 2-connected metrizable graphs.

AB - We investigate a graph theoretic analog of geodesic geometry. In a graph G= (V, E) we consider a system of paths P= { Pu,v: u, v∈ V} where Pu,v connects vertices u and v. This system is consistent in that if vertices y, z are in Pu,v, then the subpath of Pu,v between them coincides with Py,z. A map w: E→ (0 , ∞) is said to induceP if for every u, v∈ V the path Pu,v is w-geodesic. We say that G is metrizable if every consistent path system is induced by some such w. As we show, metrizable graphs are very rare, whereas there exist infinitely many 2-connected metrizable graphs.

KW - Graph metrizability

KW - Path systems

KW - Shortest paths

UR - https://www.scopus.com/pages/publications/85123628076

U2 - 10.1007/s00454-021-00345-w

DO - 10.1007/s00454-021-00345-w

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85123628076

SN - 0179-5376

VL - 68

SP - 298

EP - 347

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

Geodesic Geometry on Graphs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this