A new proof of a characterization of the set of all geodesics in a connected graph
Czechoslovak Mathematical Journal (1998)
- Volume: 48, Issue: 4, page 809-813
- ISSN: 0011-4642
Access Full Article
top
How to cite
topNebeský, Ladislav. "A new proof of a characterization of the set of all geodesics in a connected graph." Czechoslovak Mathematical Journal 48.4 (1998): 809-813. <http://eudml.org/doc/30456>.
@article{Nebeský1998,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {path; geodesic; distance; connected graph},
language = {eng},
number = {4},
pages = {809-813},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A new proof of a characterization of the set of all geodesics in a connected graph},
url = {http://eudml.org/doc/30456},
volume = {48},
year = {1998},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - A new proof of a characterization of the set of all geodesics in a connected graph
JO - Czechoslovak Mathematical Journal
PY - 1998
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 48
IS - 4
SP - 809
EP - 813
LA - eng
KW - path; geodesic; distance; connected graph
UR - http://eudml.org/doc/30456
ER -
References
top- Studying structures by counting geodesics, In: Combinatorial Designs and Applications, W. D. Wallis et al. (eds.), Marcel Dekker, New York and Basel, 1990, pp. 15–32. (1990) Zbl0741.05041MR1088485
- A characterization of the set of all shortest paths in a connected graph, Math. Bohemica 119 (1994), 15–20. (1994) MR1303548
- On the set of all shortest paths of a given length in a connected graph, Czechoslovak Math. Journal 46 (121) (1996), 155–160. (1996) MR1371697
- 10.1023/A:1022404624515, Czechoslovak Math. Journal 47 (122) (1997), 149–161. (1997) MR1435613DOI10.1023/A:1022404624515
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.