Abstract
We consider all the binary relations on a k-element set which, when viewed as directed graphs, consist of a k-cycle and some loops. If k ≥ 3 and the relation has at least two loops, we show that it is only preserved by essentially unary operations. In all other cases, the relation is preserved by operations that depend on a greater number of variables.
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.
