The optimal pebbling number of the complete m-ary tree

被引：21

作者：

Fu, HL ^{[1
]}

Shiue, CL ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu 30050, Taiwan

来源：

关键词：

optimal pebbling; complete m-ary tree; integer linear programming;

D O I：

10.1016/S0012-365X(00)00008-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：89 / 100

页数：12

共 8 条

[1]

Chung F. R. K., 1989, SIAM J DISCRETE MATH, V2, P467, DOI [10.1137/0402041, 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]

FU H, UNPUB

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

LEMKE, P ;

KLEITMAN, D .

[6] PEBBLING GRAPHS [J].

MOEWS, D .

[7] Optimally pebbling hypercubes and powers [J].

Moews, D .

[8]

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