More on linear and metric tree maps
We consider linear and metric self-maps on vertex sets of finite combinatorial trees.Linear maps are maps which preserve intervals between pairs of vertices whereas metric maps are maps which do not increase distances between pairs of 30" Gas Range vertices.We obtain criteria for a given linear or a metric map to be a positive (negative) under some