On the set of all shortest paths of a given length in a connected graph
Ladislav Nebeský (1996)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
Displaying similar documents to “Visibilities and sets of shortest paths in a connected graph”
On the set of all shortest paths of a given length in a connected graph
Attempts at axiomatic description of conditional independence
Milan Studený (1989)
Kybernetika
Similarity:
General exchange economy
Tran Quoc Chien (1983)
Kybernetika
Similarity:
A characterization of the set of all shortest paths in a connected graph
Ladislav Nebeský (1994)
Mathematica Bohemica
Similarity:
Let be a (finite undirected) connected graph (with no loop or multiple edge). The set of all shortest paths in is defined as the set of all paths , then the lenght of does not exceed the length of . While the definition of is based on determining the length of a path. Theorem 1 gives - metaphorically speaking - an “almost non-metric” characterization of : a characterization in which the length of a path greater than one is not considered. Two other theorems are derived from...