Ranks of Monoids of Endomorphisms of a Finite Undirected Path

I. Dimitrova, V. H. Fernandes, J. Koppitz, T. M. Quinteiro

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)
40 Downloads (Pure)

Abstract

In this paper, we study the widely considered endomorphisms and weak endomorphisms of a finite undirected path from monoid generators perspective. Our main aim is to determine the ranks of the monoids wEnd Pn and End Pn of all weak endomorphisms and all endomorphisms of the undirected path Pn with n vertices. We also consider strong and strong weak endomorphisms of Pn.

Original languageEnglish
Pages (from-to)1623-1645
Number of pages23
JournalBulletin Of The Malaysian Mathematical Sciences Society
Volume43
Issue number2
DOIs
Publication statusPublished - 1 Mar 2020

Keywords

  • Generators
  • Graph endomorphisms
  • Paths
  • Rank

Fingerprint

Dive into the research topics of 'Ranks of Monoids of Endomorphisms of a Finite Undirected Path'. Together they form a unique fingerprint.

Cite this