On the distance function of a connected graph

Ladislav Nebeský

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

Displaying similar documents to “On the distance function of a connected graph”

A theorem for an axiomatic approach to metric properties of graphs

Ladislav Nebeský (2000)

Czechoslovak Mathematical Journal

Similarity:

Route systems and bipartite graphs

Ladislav Nebeský (1991)

Czechoslovak Mathematical Journal

Similarity:

Route systems of a connected graph

Ladislav Nebeský (1994)

Mathematica Bohemica

Similarity:

The concept of a route system was introduced by the present author in [3].Route systems of a connected graph $G$ generalize the set of all shortest paths in $G$ . In this paper some properties of route systems are studied.

An axiomatic approach to metric properties of connected graphs

Ladislav Nebeský (2000)

Czechoslovak Mathematical Journal

Similarity:

A Note on the Interval Function of a Disconnected Graph

Manoj Changat, Ferdoos Hossein Nezhad, Henry Martyn Mulder, N. Narayanan (2018)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.