on expansive and anti-expansive tree maps
Clicks: 135
ID: 168869
2018
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
30.0
/100
135 views
11 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #69 of 95 articles by views in zhonghua yi xue za zhi
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
With every self-map on the vertex set of a finite tree one can associate the directed graph of a special type which is called the Markov graph. Expansive and anti-expansive tree maps are two extremal classes of maps with respect to the number of loops in their Markov graphs. In this paper we prove that a tree with at least two vertices has a perfect matching if and only if it admits an expansive cyclic permutation of its vertices. Also, we show that for every tree with at least three vertices there exists an expansive map with a weakly connected (strongly connected provided the tree has a perfect matching) Markov graph as well as anti-expansive map with a strongly connected Markov graph.
| Reference Key |
kozerenko2018opusculaon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Sergiy Kozerenko |
| Journal | zhonghua yi xue za zhi |
| Year | 2018 |
| DOI |
https://doi.org/10.7494/OpMath.2018.38.3.379
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.