Skip to main content
SpringerLink
Log in

On the distance function of a connected graph

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. C. Kay and G. Chartrand: A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342–346.

    MATH  MathSciNet  Google Scholar 

  2. H. M. Mulder: The interval function of a graph. Math. Centre Tracts 132, Math. Centre, Amsterdam, 1980.

    MATH  Google Scholar 

  3. L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15–20.

    MATH  MathSciNet  Google Scholar 

  4. L. Nebeský: A characterization of the interval function of a connected graph. Czech. Math. J. 44 (1994), 173–178.

    MATH  Google Scholar 

  5. L. Nebeský: Geodesics and steps in a connected graph. Czech. Math. J. 47 (1997), 149–161.

    Article  MATH  Google Scholar 

  6. L. Nebeský: A characterization of the interval function of a (finite or infinite) connected graph. Czech. Math. J. 51 (2001), 635–642.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univerzita Karlova v Praze, Filozofická fakulta, nám. J. Palacha 2, 116 38, Praha 1, Czech Republic

    Ladislav Nebeský

Authors
  1. Ladislav Nebeský
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nebeský, L. On the distance function of a connected graph. Czech Math J 58, 1101–1106 (2008). https://doi.org/10.1007/s10587-008-0072-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-008-0072-1

Keywords

Search

Navigation