Based On Hypercube And Cycles Cell-breeding Network And Its Properties

Interconnection network is an important part of super computers.Its topo-logical structure refers to the very large scale in the computer system components(processor)connection mode.the structure and properties of interconnection net-work are important research projects of the super computer.When you design and select a topological structure for an interconnection network,some indicators such as Hamiltonian,ring embedded,connectivity and diameter play an important role in analyzing the performance of interconnection network.In this paper,we discussed the cube-connected cycles network,the general cube-connected cycles networks,CCC(n,?)and the cube-connected cycles n-tuples Carte-sian product network CCC(d1,d2,…,dn),which obtains the following results:1.The main results of cube-connected cycles networks and general cube-connected cycles networks:In 1981,cube-conneetd cyeles networks was first proposedand s-tudied by F.P.Preparata and J.Vuillemin.In this paper,(1)we proved that when n=3,cube-connected cycles network is Hamilton-connected and cube-connected cycles network is Hamiltotn-laceabled for n is 4.(2)we design a new network-the general cube-connected cycles network GCCC(n).(3)we give an arithmetic that is the general cube-connected cycles network can be decomposed into union edge-disjoint a Hamiltonian cycle and a perfect matching.2.The main results of the new network CC(n,?):Haizhong Shi designed an interconnection network-CCC(n,?).In this paper,(1)we discussed the number of vertex and edge in CCC(n,k)and proved CCC(n,k)is Hamilton graph;(2)we proved that when 3 ? n ? 7,CCC(n,1)is not vertex-transitive graph and Cayley graph;(3)when k ? 2,CCC(n,?)is not vertex-transitive graph and Cayley graph.3.The main results of the cube-connected cycles n-tuples Cartesian product net-work CCC(d1,d2,…,dn).Haizhong Shi designed an interconnection network-the cube-connected cycles n-tuples Cartesian product network CCC(d1,d2,…,dn).In this paper,(1)we studied the number of vertex and edge and studied the regular and vertex-connectivity of CCC(d1,d2,…,dn);(2)we proved that CCC(3,3,…,3)is Hamilton—connected;(3)we give others properties of CCC(3,3,…,3).