Article
Keywords:
graphs; distance; interval function; geodetic graphs
Summary:
The interval function (in the sense of H. M. Mulder) is an important tool for studying those properties of a connected graph that depend on the distance between vertices. An axiomatic characterization of the interval function of a connected graph was published by Nebeský in 1994. In Section 2 of the present paper, a simpler and shorter proof of that characterization will be given. In Section 3, a characterization of geodetic graphs will be established; this characterization will utilize properties of the interval function.
References:
[2] H.-J. Bandelt, H. M. Mulder:
Three interval conditions for graphs. Ars Combin. 29B (1990), 213–223.
MR 1412877
[4] H. M. Mulder:
The Interval Function of a Graph. Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
MR 0605838 |
Zbl 0446.05039
[5] L. Nebeský:
A characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15–20.
MR 1303548
[6] L. Nebeský:
A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44 (1994), 173–178.
MR 1257943
[7] L. Nebeský:
A characterization of geodetic graphs. Czechoslovak Math. J. 45 (1995), 491–493.
MR 1344515
[8] L. Nebeský:
Characterizing the interval function of a connected graph. Math. Bohem. 123 (1998), 137–144.
MR 1673965