Optimally pebbling hypercubes and powers

被引：22

作者：

Moews, D ^{[1
]}

机构：

[1] Ctr Commun Res, San Diego, CA 92121 USA

来源：

DISCRETE MATHEMATICS | 1998年 / 190卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(98)00154-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We point out that the optimal pebbling number of the n-cube is (4/3)(n+O(log n)), and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：271 / 276

页数：6

共 6 条

[1]

Chung F. R. K., 1989, SIAM J DISCRETE MATH, V2, P467, DOI DOI 10.1137/0402041

[2]

Clarke TA, 1997, J GRAPH THEOR, V25, P119, DOI 10.1002/(SICI)1097-0118(199706)25:2<119::AID-JGT3>3.0.CO

[3]

2-P

[4] A NONCONSTRUCTIVE UPPER BOUND ON COVERING RADIUS [J].

COHEN, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :352-353

[5] AN ADDITION THEOREM ON THE INTEGERS MODULO N [J].

LEMKE, P ;

KLEITMAN, D .

JOURNAL OF NUMBER THEORY, 1989, 31 (03) :335-345

[6]

Pachter L., 1995, CONGR NUMER CONF J N, V107, P65

← 1 →