On the set of all shortest paths of a given length in a connected graph
Ladislav Nebeský · Czechoslovak Mathematical Journal · 1996
Let G be a connected graph (in the sense of the book [1], for example).Let V, E and d denote its vertex set, its edge set and its distance function, respectively.We denote by E^ the set of all finite nonempty sequences (0) u 0 ,...,u {