Cayley Graphs of Transformation Semigroups with Restriction on the Fixed Set is Bijective

Authors

  • Ekkachai Laysirikul
  • Natthawarun Pinin
  • Yanisa Chaiya

DOI:

https://doi.org/10.29020/nybg.ejpam.v19i2.7605

Keywords:

transformation semigroup, Cayley graph, connectedness, domination parameters

Abstract

Let $PG_Y(X)=\{\alpha \in T(X) : \alpha|_Y \in G(Y)\}$ be a subsemigroup of the full transformation semigroup $T(X)$, where the restriction of each transformation to $Y$ is a permutation of $Y$. 
This structure can be viewed as an extension of the symmetric group to a transformation semigroup.
In this paper, we study the Cayley digraphs $\operatorname{Cay}(PG_Y(X),A)$ generated by a nonempty set $A$ of minimal idempotents. We describe basic structural properties of these digraphs, including initial and terminal vertices. We also examine their degrees, connectedness, and completeness. In addition, domination parameters of these digraphs are determined.

References

Downloads

Published

2026-07-28

Issue

Section

Algebra

How to Cite

Cayley Graphs of Transformation Semigroups with Restriction on the Fixed Set is Bijective. (2026). European Journal of Pure and Applied Mathematics, 19(2), 7605. https://doi.org/10.29020/nybg.ejpam.v19i2.7605