On monoids of endomorphisms of a cycle graph

Ilinka Dimitrova, Vitor H. Fernandes, Jörg Koppitz, Teresa M. Quinteiro

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)1071-1088
Number of pages18
JournalMATHEMATICA SLOVACA
Volume74
Issue number5
DOIs
Publication statusPublished - 1 Oct 2024

Keywords

  • cycle graphs
  • generators
  • Graph endomorphisms
  • rank

Cite this