On the arrangement graph

被引：50

作者：

Chiang, WK

Chen, RJ

机构：

[1] Ind Technol Res Inst, Comp & Commun Res Labs, Comp Telephony Applicat Dept, Hsinchu 310, Taiwan

[2] Natl Chiao Tung Univ, Dept Comp Sci & Informat Engn, Hsinchu 300, Taiwan

来源：

INFORMATION PROCESSING LETTERS | 1998年 / 66卷 / 04期

关键词：

interconnection networks; graph isomorphism; average distance;

D O I：

10.1016/S0020-0190(98)00052-0

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 A(n.k). It has been shown that the (n, n - 2)-arrangement graph A(n,n-2) is isomorphic to the n-alternating group graph AG,. In addition, the exact value of average distance of A(n,k) has been derived. (C) 1998 Published by Elsevier Science B.V. All rights reserved.

引用

页码：215 / 219

页数：5

共 9 条

[1]

Akers S. B., 1986, Proceedings of the 1986 International Conference on Parallel Processing (Cat. No.86CH2355-6), P216

[2]

Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393

[3]

BERGE C, 1971, PRINCIPLES COMBINATO, pCH4

[4] EMBEDDING OF CYCLES IN ARRANGEMENT GRAPHS [J].