Abstract
We say that a binary operation * is associated with a (finite undirected) graph G (without loops and multiple edges) if * is defined on V(G) and uv ∈ E(G) if and only if u ≠ v, u * v = v and v * u = u for any u, v ∈ V(G). In the paper it is proved that a connected graph G is geodetic if and only if there exists a binary operation associated with G which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).
Similar content being viewed by others
References
M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979.
F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.), 1969.
H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum. Amsterdam, 1980.
L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Mathematica Bohemica 119 (1994), 15–20.
L. Nebeský: A characterization of geodetic graphs. Czechoslovak Math. Journal 45(120) (1995), 491–493.
L. Nebeský: Geodesics and steps in a connected graph. Czechoslovak Math. Journal 47(122) (1997), 149–161.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nebeský, L. An algebraic characterization of geodetic graphs. Czechoslovak Mathematical Journal 48, 701–710 (1998). https://doi.org/10.1023/A:1022435605919
Issue Date:
DOI: https://doi.org/10.1023/A:1022435605919