Abstract
A problem proposed by G. Birkhoff concerns the relation between finite lattices and unoriented graphs. In the present paper we investigate an analogous problem concerning the relations between monounary algebras and unoriented graphs. To each monounary algebra A we assign in a natural way an unoriented graph G(A) without loops and multiple edges. We describe all monounary algebras B such that G(A) and G(B) are isomorphic. Further, we characterize all monounary algebras A having the property that whenever A 1 is a monounary algebra whose unoriented graph G(A 1) is isomorphic to G(A), then A 1 is isomorphic to A.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
