Article
Full entry |
PDF
(0.2 MB)
Feedback
PDF
(0.2 MB)
Feedback
Keywords:
connected graph; distance function
connected graph; distance function
Summary:
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.
References:
[1] Kay, D. C., Chartrand, G.: A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342-346. DOI 10.4153/CJM-1965-034-0 | MR 0175113 | Zbl 0139.17301
[2] Mulder, H. M.: The interval function of a graph. Math. Centre Tracts 132, Math. Centre, Amsterdam (1980). MR 0605838 | Zbl 0446.05039
[3] Nebeský, L.: A characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15-20. MR 1303548
[4] Nebeský, L.: A characterization of the interval function of a connected graph. Czech. Math. J. 44 (1994), 173-178. MR 1257943
[5] Nebeský, L.: Geodesics and steps in a connected graph. Czech. Math. J. 47 (1997), 149-161. DOI 10.1023/A:1022404624515 | MR 1435613
[6] Nebeský, L.: A characterization of the interval function of a (finite or infinite) connected graph. Czech. Math. J. 51 (2001), 635-642. DOI 10.1023/A:1013744324808 | MR 1851552 | Zbl 1079.05505
Search
Partner of
