>
Fa   |   Ar   |   En
   ON THE SYMMETRIES OF SOME CLASSES OF RECURSIVE CIRCULANT GRAPHS  
   
نویسنده میرافضل سید مرتضی
منبع transactions on combinatorics - 2014 - دوره : 3 - شماره : 1 - صفحه:1 -6
چکیده    A recursive-circulant g(n; d) is defined to be a circulant graph with n vertices and jumpsof powers of d. g(n; d) is vertex-transitive, and has some strong hamiltonian properties. g(n; d)has a recursive structure when n = cdm, 1 ? c < d [theoret. comput. sci. 244 (2000) 35-62]. inthis paper, we will find the automorphism group of some classes of recursive-circulant graphs. inparticular, we will find that the automorphism group of g(2m; 4) is isomorphic with the group d2·2m,the dihedral group of order 2m+1.
کلیدواژه Cayley graph ,recursive-circulant ,automorphism group ,dihedral group
آدرس lorestan university, Department of Mathematics, Lorestan University, Khoramabad, Iran, ایران
پست الکترونیکی morteza mirafzal@yahoo.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved