Skip to main content
Log in

New proof of a characterization of geodetic graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition. Chapman & Hall, London, 1996.

    Google Scholar 

  2. H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam, 1980.

    Google Scholar 

  3. L. Nebeský: An algebraic characterization of geodetic graphs. Czechoslovak Math. J. 48 (123) (1998), 701–710.

    Google Scholar 

  4. L. Nebeský: A tree as a finite nonempty set with a binary operation. Math. Bohem. 125 (2000), 455–458.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021715219620

Navigation