A formula for the number of weak endomorphisms on paths
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths.
Saved in:
| Date: | 2019 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2019
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |