The Pancyclicity of m-ary n-cube Networks
Liu Hongmei · 2007
m-ary n-cube (denoted by Qn(m)) is an important network topology for parallel processing computer systems. Some methods of forming big cycle from small cycles and links have been developed. Basing on which, we has proved that in m-ary n-cube, there exists a cycle of every length from 3 to |V(G)| inclusive and all kinds of length cycles have been constructed in. This important Hamilton property of m-ary n-cube can be applied in the topology design of computer networks to improve the network performance.