Abstract
In this paper, we give a number of illuminating examples of transformation semigroups of degree 2 acting on graphs by functions that preserve vertices and edges by inverse image. It is known that the complexity of such a transformation semigroup is at most 2. We give examples that use sophisticated lower bounds to complexity to distinguish between complexity 1 and complexity 2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
