Title :
Embedding of cycles in arrangement graphs
Author :
Day, Khaled ; Tripathi, Anand
Author_Institution :
Dept. of Comput. Sci., Bahrain Univ., ISA Town, Bahrain
fDate :
8/1/1993 12:00:00 AM
Abstract :
Arrangement graphs have been proposed as an attractive interconnection topology for large multiprocessor systems. The authors study these graphs by proving the existence of Hamiltonian cycles in any arrangement graph. They also prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. They show that an arrangement graph can be decomposed into node disjoint cycles in many different ways
Keywords :
multiprocessor interconnection networks; Hamiltonian cycles; arrangement graphs; cycles embeddings; interconnection topology; large multiprocessor systems; node disjoint cycles; Algorithm design and analysis; Cities and towns; Computer science; Degradation; Fault tolerance; Instruction sets; Multiprocessing systems; Multiprocessor interconnection networks; Network topology; Routing;
Journal_Title :
Computers, IEEE Transactions on
