New proof of a characterization of geodetic graphs
Czechoslovak Mathematical Journal, Tome 52 (2002) no. 1, pp. 33-39
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler.
Classification :
05C12, 05C75, 20N02
Keywords: geodetic graphs; shortest paths; binary operations
Keywords: geodetic graphs; shortest paths; binary operations
@article{CMJ_2002__52_1_a4,
author = {Nebesk\'y, Ladislav},
title = {New proof of a characterization of geodetic graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {33--39},
publisher = {mathdoc},
volume = {52},
number = {1},
year = {2002},
mrnumber = {1885455},
zbl = {0995.05124},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2002__52_1_a4/}
}
Nebeský, Ladislav. New proof of a characterization of geodetic graphs. Czechoslovak Mathematical Journal, Tome 52 (2002) no. 1, pp. 33-39. http://geodesic.mathdoc.fr/item/CMJ_2002__52_1_a4/