More on linear and metric tree maps
Loading...
Date
2021
Authors
Kozerenko, Sergiy
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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 vertices. We obtain criteria for a given linear or a metric map to be a positive (negative)
under some orientation of the edges in a tree, we characterize trees which admit maps with
Markov graphs being paths and prove that the converse of any partial functional digraph is
isomorphic to a Markov graph for some suitable map on a tree.
Description
Keywords
tree, Markov graph, metric map, non-expanding map, linear map, graph homomorphism, article
Citation
Kozerenko S. More on linear and metric tree maps [electronic resource] / Sergiy Kozerenko // Opuscula Mathematica. - 2021. - Vol. 41, no. 1.- P. 55-70.