摘要
本文给出一个搜索满足G^3=G的循环图的算法,并搜索到满足G^3=G的2度循环图只有C_9<1>一个图,而满足G^3=G的4度循环图共有三个图:C_(27)<1,5>,C_(27)<1,11>和C_(18)<1,8>。
In this paper,we give the algorithm to search the circulant graphs which satisfy G^3 =G^-. The circulant graphs of 2 degrees and satisfying G^3=G is C_9<1>. The circulant graphs of 4 degrees and satisfying G^3 = G are C_(27)<1.5> .C_(27)<1.11>and C_(18)<1, 8>.
