Abstract
Given a set S, and any selfmap f:S→S, the functional graph associated with f can be described as a graph with vertex set S and directed edge set E={(u,v)∈S2:f(u)=v}. A classification of all functional graphs induced by lattice endomorphisms has been done by Szigeti ([3]). In this paper, we aim to achieve a similar type of classification with respect to functional graphs induced by endomorphisms of certain abelian groups.
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.
