INDEPENDENT DOMINATION IN HYPERCUBES

被引：20

作者：

HARARY, F ^{[1
]}

LIVINGSTON, M ^{[1
]}

机构：

[1] SO ILLINOIS UNIV,DEPT COMP SCI,EDWARDSVILLE,IL 62026

来源：

APPLIED MATHEMATICS LETTERS | 1993年 / 6卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0893-9659(93)90027-K

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The use of hypercube graphs as the underlying architecture in many commercial parallel computers has stimulated interest in this family of graphs. We hope to further stimulate this interest by introducing a tantalizing unsolved problem that is based on dominating sets for this very regularly structured family

引用

页码：27 / 28

页数：2

共 8 条

[1]

BAREFOOT C, IN PRESS GRAPHS COMB

[2]

BERLEKAMP ER, 1984, ALGEBRAIC CODING THE

[3]

HARARY F, 1991, GRAPH THEORY COMBINA, V2, P621

[4]

Harary F., 1994, GRAPH THEORY, P11, DOI [DOI 10.21236/AD0705364, 10.1201/9780429493768, DOI 10.1201/9780429493768]

[5] INTERSECTION INEQUALITIES FOR COVERING PROBLEM [J].

STANTON, RG ;

KALBFLEI.JG .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (06) :1311-&

[6]

STANTON RG, 1968, AEQUATIONES MATH, V1, P94

[7]

Thompson T. M., 1983, ERROR CORRECTING COD

[8] IMPROVED SPHERE BOUNDS ON THE COVERING RADIUS OF CODES [J].

VANWEE, GJM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) :237-245

← 1 →