Abstract
In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler.
Similar content being viewed by others
References
G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition. Chapman & Hall, London, 1996.
H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam, 1980.
L. Nebeský: An algebraic characterization of geodetic graphs. Czechoslovak Math. J. 48 (123) (1998), 701–710.
L. Nebeský: A tree as a finite nonempty set with a binary operation. Math. Bohem. 125 (2000), 455–458.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nebeský, L. New proof of a characterization of geodetic graphs. Czechoslovak Mathematical Journal 52, 33–39 (2002). https://doi.org/10.1023/A:1021715219620
Issue Date:
DOI: https://doi.org/10.1023/A:1021715219620