This Article 
 Bibliographic References 
 Add to: 
Embedding of Cycles in Arrangement Graphs
August 1993 (vol. 42 no. 8)
pp. 1002-1006

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.

[1] S. B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to then-cube," inProc. Int. Conf. Parallel Processing, 1987, pp. 393-400.
[2] S. B. Akers and B. Krishnamurthy, "A group theoretical model for symmetric interconnection networks," inProc. Int. Conf. Parallel Processing, 1986, pp. 216-233.
[3] N. Biggs, "Some odd graph theory,"Ann. NY Acad. Sci., vol. 319, pp. 71-81, 1979.
[4] K. Day and A. Tripathi, "Arrangement graphs: A class of generalized star graphs,"Inform. Processing Lett., no. 42, pp. 235-241, 1992.
[5] A. Ghafoor and T. R. Bashkow, "A study of odd graphs as fault-tolerant interconnection networks,"IEEE Trans. Comput., vol. 40, no. 2, pp. 225-232, Feb. 1991.
[6] J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall, "Embedding of cycles and grids in star graphs,"J. Circuits, Syst., Comput., vol. 1, no. 1, pp. 43-74, 1991.
[7] K. Qiu, H. Meijer, and S. Akl, "Decomposing a star graph into disjoint cycles,"Inform. Processing Lett., no. 39, pp. 125-129, 1991.

Index Terms:
cycles embeddings; arrangement graphs; interconnection topology; large multiprocessor systems; Hamiltonian cycles; node disjoint cycles; multiprocessor interconnection networks.
K. Day, A. Tripathi, "Embedding of Cycles in Arrangement Graphs," IEEE Transactions on Computers, vol. 42, no. 8, pp. 1002-1006, Aug. 1993, doi:10.1109/12.238494
Usage of this product signifies your acceptance of the Terms of Use.