Abstract
A recursive-circulant G(n;d) is dened to be a circulant graph with n vertices and jumps of powers of d. G(n;d) is vertex-transitive, and has some strong hamiltonian properties. G(n;d) has a recursive structure when n = cd m , 1 c < d (Theoret. Comput. Sci. 244 (2000) 35-62). In this paper, we will nd the automorphism group of some classes of recursive-circulant graphs. In particular, we will nd that the automorphism group of G(2 m ;4) is isomorphic with the group D2 2m, the dihedral group of order 2 m+1 .
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.
