Answers are grounded in this paper and cite their sources.
In this paper, we investigate the structural properties of Cayley graphs of monogenic semigroups and present a complete characterization of their weakly connected components. Several essential properties of these components are rigorously proven. Building upon these structural results, we introduce the notion of labelled colour-permuting isomorphisms between Cayley graphs. Using this new isomorphism framework, we address the Cayley graph isomorphism problem for monogenic semigroups, commonly known as the CI problem. In particular, we establish the necessary and sufficient conditions under which two Cayley graphs over monogenic semigroups are labelled colour-permuting isomorphic.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: