More on linear and metric tree maps

dc.contributor.authorKozerenko, Sergiy
dc.date.accessioned2021-04-15T08:30:26Z
dc.date.available2021-04-15T08:30:26Z
dc.date.issued2021
dc.description.abstractWe 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.en_US
dc.identifier.citationKozerenko S. More on linear and metric tree maps [electronic resource] / Sergiy Kozerenko // Opuscula Mathematica. - 2021. - Vol. 41, no. 1.- P. 55-70.en_US
dc.identifier.urihttps://doi.org/10.7494/OPMATH.2021.41.1.55
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/19797
dc.language.isoenuk_UA
dc.relation.sourceOpuscula Mathematica.en_US
dc.statusfirst publisheduk_UA
dc.subjecttreeen_US
dc.subjectMarkov graphen_US
dc.subjectmetric mapen_US
dc.subjectnon-expanding mapen_US
dc.subjectlinear mapen_US
dc.subjectgraph homomorphismen_US
dc.subjectarticleen_US
dc.titleMore on linear and metric tree mapsen_US
dc.typeArticleuk_UA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Kozerenko_More_on_linear_and_metric_tree_maps.pdf
Size:
465.19 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description: