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: | 2018 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2018
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/188413 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | A formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of UkraineSimilar Items
A formula for the number of weak endomorphisms on paths
by: Knauer, Ulrich, et al.
Published: (2019)
by: Knauer, Ulrich, et al.
Published: (2019)