Abstract
SummaryA criterion is developed that decides in a finite number of steps whether a finite digraph is a Cayley digraph of some group. In the process, a class of algebraic structure more general than groups are considered that arise naturally from digraphs that are “almost” Cayley.
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.
