Abstract
In this paper, we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid wEndP→n of all weak endomorphisms of a directed path with n vertices, which is a submonoid of the widely studied monoid n of all order-preserving transformations of an n-chain. Also, we describe the regular elements of wEndP→n and calculate its size and number of idempotents.
Original language | English |
---|---|
Article number | 2350069 |
Number of pages | 10 |
Journal | Asian-European Journal of Mathematics |
Volume | 16 |
Issue number | 4 |
Early online date | 2022 |
DOIs | |
Publication status | Published - 2023 |
Keywords
- generators
- Graph endomorphisms
- paths
- rank