Abstract
Polygroups are a generalization of groups in which the composition of any two elements are a non-empty set. In this paper, first we recall the concept of polygroups and introduce a new construction for building a polygroup from a polygroup and a non-empty set. Then we study the concept of generalized Cayley graphs over polygroups, say GCP-graphs. Then we prove some properties of them in order to answer this question: which simple graphs are GCP-graphs? Finally, we prove that every simple graph of order at most five is a GCP-graph.
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.
