Combinatorial properties of generalized hypercube graphs

被引：37

作者：

Duh, DR ^{[1
]}

Chen, GH ^{[1
]}

Hsu, DF ^{[1
]}

机构：

[1] FORDHAM UNIV,DEPT COMP & INFORMAT SCI,BRONX,NY 10458

来源：

INFORMATION PROCESSING LETTERS | 1996年 / 57卷 / 01期

关键词：

algorithms; graph theory;

D O I：

10.1016/0020-0190(95)00173-5

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper investigates combinatorial properties of generalized hypercube graphs including best containers, wide diameter, and fault diameter. These properties have received much attention recently in the study of interconnection networks.

引用

页码：41 / 45

页数：5

共 8 条

[1]

BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437

[2]

Buckley F., 1990, Distance in Graphs

[3] TOPOLOGICAL PROPERTIES, COMMUNICATION, AND COMPUTATION ON WK-RECURSIVE NETWORKS [J].

CHEN, GH ;

DUH, DR .

NETWORKS, 1994, 24 (06) :303-317

[4] PERFORMANCE ANALYSIS OF K-ARY N-CUBE INTERCONNECTION NETWORKS [J].

DALLY, WJ .

IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (06) :775-785

[5]

HSU DF, 1994, IEICE T FUND ELECTR, VE77A, P668

[6] FAULT DIAMETER OF INTERCONNECTION NETWORKS [J].

KRISHNAMOORTHY, MS ;

KRISHNAMURTHY, B .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1987, 13 (5-6) :577-582

[7] TOPOLOGICAL PROPERTIES OF HYPERCUBES [J].

SAAD, Y ;

SCHULTZ, MH .

IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (07) :867-872

[8] ALGORITHMS AND BOUNDS FOR SHORTEST PATHS AND DIAMETER IN FAULTY HYPERCUBES [J].

TIEN, SB ;

RAGHAVENDRA, CS .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (06) :713-718

← 1 →