On the distance function of a connected graph
Czechoslovak Mathematical Journal, Tome 58 (2008) no. 4, pp. 1101-1106
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
An axiomatic characterization of the distance function of a connected graph is given in this note. The triangle inequality is not contained in this characterization.
An axiomatic characterization of the distance function of a connected graph is given in this note. The triangle inequality is not contained in this characterization.
@article{CMJ_2008_58_4_a16,
author = {Nebesk\'y, Ladislav},
title = {On the distance function of a connected graph},
journal = {Czechoslovak Mathematical Journal},
pages = {1101--1106},
year = {2008},
volume = {58},
number = {4},
mrnumber = {2471169},
zbl = {1174.05039},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2008_58_4_a16/}
}
Nebeský, Ladislav. On the distance function of a connected graph. Czechoslovak Mathematical Journal, Tome 58 (2008) no. 4, pp. 1101-1106. http://geodesic.mathdoc.fr/item/CMJ_2008_58_4_a16/