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.
|Number of pages||10|
|Journal||Asian-European Journal of Mathematics|
|Early online date||2022|
|Publication status||Published - 2023|
- Graph endomorphisms