Title :
The Pancyclicity of m-ary n-cube Networks
Author_Institution :
Three Gorges Univ., Hubei
Abstract :
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.
Keywords :
graph theory; hypercube networks; parallel processing; telecommunication network topology; Hamilton property; Pancyclic graph; computer network topology design; m-ary n-cube networks; network performance; pancyclicity; parallel processing computer system; Computer network reliability; Computer networks; Concurrent computing; Control systems; Distributed computing; Educational institutions; Joining processes; Network topology; Parallel processing; Telecommunication network reliability;
Conference_Titel :
Networking, Sensing and Control, 2007 IEEE International Conference on
Conference_Location :
London
Print_ISBN :
1-4244-1076-2
Electronic_ISBN :
1-4244-1076-2
DOI :
10.1109/ICNSC.2007.372849
