Abstract
The cyclic graph $$\Gamma (S)$$ of a semigroup S is the simple graph whose vertex set is S, two element being adjacent if the subsemigroup generated by these two elements is monogenic. The purpose of this note is to prove that the chromatic number of $$\Gamma (S)$$ is at most countable. The present paper generalizes the results of Shitov (Graphs Comb 33(2):485–487, 2017) and the corresponding results on power graph and enhanced power graph of groups obtained by Aalipour et al. (Electron J Comb 24(3):#P3.16, 2017).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
