On the distance function of a connected graph
Czechoslovak Mathematical Journal (2008)
- Volume: 58, Issue: 4, page 1101-1106
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topReferences
top- Kay, D. C., Chartrand, G., 10.4153/CJM-1965-034-0, Canad. J. Math. 17 (1965), 342-346. (1965) Zbl0139.17301MR0175113DOI10.4153/CJM-1965-034-0
- Mulder, H. M., The interval function of a graph, Math. Centre Tracts 132, Math. Centre, Amsterdam (1980). (1980) Zbl0446.05039MR0605838
- Nebeský, L., A characterization of the set of all shortest paths in a connected graph, Math. Bohem. 119 (1994), 15-20. (1994) MR1303548
- Nebeský, L., A characterization of the interval function of a connected graph, Czech. Math. J. 44 (1994), 173-178. (1994) MR1257943
- Nebeský, L., 10.1023/A:1022404624515, Czech. Math. J. 47 (1997), 149-161. (1997) MR1435613DOI10.1023/A:1022404624515
- Nebeský, L., 10.1023/A:1013744324808, Czech. Math. J. 51 (2001), 635-642. (2001) Zbl1079.05505MR1851552DOI10.1023/A:1013744324808