Embedding of cycles in arrangement graphs
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (8) , 1002-1006
- https://doi.org/10.1109/12.238494
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
This publication has 6 references indexed in Scilit:
- Embedding of cycles and grids in star graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Arrangement graphs: a class of generalized star graphsInformation Processing Letters, 1992
- Decomposing a star graph into disjoint cyclesInformation Processing Letters, 1991
- A study of odd graphs as fault-tolerant interconnection networksIEEE Transactions on Computers, 1991
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- SOME ODD GRAPH THEORYAnnals of the New York Academy of Sciences, 1979