More on linear and metric tree maps

Autor: Sergiy Kozerenko
Jazyk: angličtina
Rok vydání: 2021
Předmět:
Zdroj: Opuscula Mathematica, Vol 41, Iss 1, Pp 55-70 (2021)
Druh dokumentu: article
ISSN: 1232-9274
DOI: 10.7494/OpMath.2021.41.1.55
Popis: 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.
Databáze: Directory of Open Access Journals