论文信息 - On the Arrangement Graph

On the Arrangement Graph

Abstract The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph An,k. It has been shown that the (n, n − 2)-arrangement graph An,n − 2 is isomorphic to the n-alternating group graph AGn. In addition, the exact value of average distance of An,k has been derived.

Wei-Kuo Chiang | Rong-Jaye Chen

[1] S. Lakshmivarahan,et al. A new class of interconnection networks based on the alternating group , 1993, Networks.

[2] Khaled Day,et al. Embedding Grids, Hypercubes, and Trees in Arrangement Graphs , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[3] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[4] Khaled Day,et al. Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.

[5] Khaled Day,et al. Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[6] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.