An axiomatic approach to metric properties of connected graphs

Ladislav Nebeský

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “An axiomatic approach to metric properties of connected graphs”

A theorem for an axiomatic approach to metric properties of graphs

Ladislav Nebeský (2000)

Czechoslovak Mathematical Journal

Similarity:

New proof of a characterization of geodetic graphs

Ladislav Nebeský (2002)

Czechoslovak Mathematical Journal

Similarity:

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.

On the distance function of a connected graph

Ladislav Nebeský (2008)

Czechoslovak Mathematical Journal

Similarity:

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.