The bases of weighted graphs (Q1377737)

A new kind of weighted graphs is studied when the weights of the edges belong to a partially ordered set \(L\). For such \(L\), the weight of a path is equal to the product of the weights of its edges. The distance between two vertices is defined as the lower bound of the weights of all paths joining those two vertices. Graphs with the same set of vertices and equal distance for every pair of vertices form an equivalent class. A partial order can be defined in each equivalent class in a natural way. It is proved that each equivalent class has a smallest element and a non-empty set of maximal elements.