Open AccessMore on linear and metric tree maps
Author(s) -
Sergiy Kozerenko
Publication year - 2021
Publication title -
rocznik akademii górniczo-hutniczej im. stanisława staszica. opuscula mathematica/opuscula mathematica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.481
H-Index - 16
eISSN - 2300-6919
pISSN - 1232-9274
DOI - 10.7494/opmath.2021.41.1.55
Subject(s) - mathematics , combinatorics , converse , vertex (graph theory) , metric (unit) , markov chain , digraph , tree (set theory) , discrete mathematics , graph , operations management , geometry , economics , statistics
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.