所謂連通圖G的傳遞數rt(G)，是指能使頂點的每一個置換，在r步通過交換不相交的邊的兩端點被傳遞的最小整數r值。在這篇研究報告中，我們將證明環狀完全圖K_(p/q)的傳遞數rt(K_(p/q) )≤ 2q, 對於所有的p≥3q，其中p, q為正整數。 The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In this paper, we study and prove the routing number of circular complete graph K_(p/q) is rt(K_(p/q) )≤2q， "for all" p≥3q，p, q∈Z^+.
