Abstract
Let [Formula: see text] be an odd prime, and [Formula: see text] the dihedral group of order [Formula: see text]. In this paper, we provide the number of (connected) Cayley (di-)graphs on [Formula: see text] up to isomorphism by using the Pólya enumeration theorem. In the process, we also enumerate (connected) Cayley digraphs on [Formula: see text] of out-degree [Formula: see text] up to isomorphism for each [Formula: see text].
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.
