Abstract
In this paper, we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids wEndCn and EndCn of all weak endomorphisms and all endomorphisms of an undirected cycle graph Cn with n vertices. We also describe Green's relations and regularity of these monoids and calculate their cardinalities.
Original language | English |
---|---|
Pages (from-to) | 1071-1088 |
Number of pages | 18 |
Journal | MATHEMATICA SLOVACA |
Volume | 74 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 Oct 2024 |
Keywords
- cycle graphs
- generators
- Graph endomorphisms
- rank