Visibilities and sets of shortest paths in a connected graph
Ladislav Nebeský (1995)
Czechoslovak Mathematical Journal
Similarity:
Ladislav Nebeský (1995)
Czechoslovak Mathematical Journal
Similarity:
Ladislav Nebeský (1998)
Mathematica Bohemica
Similarity:
As was shown in the book of Mulder [4], the interval function is an important tool for studying metric properties of connected graphs. An axiomatic characterization of the interval function of a connected graph was given by the present author in [5]. (Using the terminology of Bandelt, van de Vel and Verheul [1] and Bandelt and Chepoi [2], we may say that [5] gave a necessary and sufficient condition for a finite geometric interval space to be graphic). In the present paper, the result...
Bohdan Zelinka (1997)
Mathematica Bohemica
Similarity:
Circular distance between two vertices , of a strongly connected directed graph is the sum , where is the usual distance in digraphs. Its basic properties are studied.
Ladislav Nebeský (1995)
Czechoslovak Mathematical Journal
Similarity:
Sandi Klavžar, Uroš Milutinović (1997)
Czechoslovak Mathematical Journal
Similarity:
For any and any , a graph is introduced. Vertices of are -tuples over and two -tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest paths between any two vertices of . Together with a formula for the distance, this result is used to compute the distance between two...