A characterization of the set of all shortest paths in a connected graph

Nebeský, Ladislav. "A characterization of the set of all shortest paths in a connected graph." Mathematica Bohemica 119.1 (1994): 15-20. <http://eudml.org/doc/29362>.

@article{Nebeský1994,
abstract = {Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\mathcal \{L\}$ of all shortest paths in $G$ is defined as the set of all paths $\xi $, then the lenght of $\xi $ does not exceed the length of $\varsigma $. While the definition of $\mathcal \{L\}$ is based on determining the length of a path. Theorem 1 gives - metaphorically speaking - an “almost non-metric” characterization of $\mathcal \{L\}$: a characterization in which the length of a path greater than one is not considered. Two other theorems are derived from Theorem 1. One of them (Theorem 3) gives a characterization of geodetic graphs.},
author = {Nebeský, Ladislav},
journal = {Mathematica Bohemica},
keywords = {geodetic graphs; connected graph; shortest paths; geodetic graphs; connected graph; shortest paths},
language = {eng},
number = {1},
pages = {15-20},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A characterization of the set of all shortest paths in a connected graph},
url = {http://eudml.org/doc/29362},
volume = {119},
year = {1994},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - A characterization of the set of all shortest paths in a connected graph
JO - Mathematica Bohemica
PY - 1994
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 119
IS - 1
SP - 15
EP - 20
AB - Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\mathcal {L}$ of all shortest paths in $G$ is defined as the set of all paths $\xi $, then the lenght of $\xi $ does not exceed the length of $\varsigma $. While the definition of $\mathcal {L}$ is based on determining the length of a path. Theorem 1 gives - metaphorically speaking - an “almost non-metric” characterization of $\mathcal {L}$: a characterization in which the length of a path greater than one is not considered. Two other theorems are derived from Theorem 1. One of them (Theorem 3) gives a characterization of geodetic graphs.
LA - eng
KW - geodetic graphs; connected graph; shortest paths; geodetic graphs; connected graph; shortest paths
UR - http://eudml.org/doc/29362
ER -