A note on optimal pebbling of hypercubes

檔案

日期

2013-05-01

類型

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

卷期與頁次

第 25 卷第 4 期,頁 597–601

ISSN

1382-6905

語言

英文

摘要

A pebbling move consists of removing two pebbles from one vertex and then placing one pebble at an adjacent vertex. If a distribution delta of pebbles lets us move at least one pebble to each vertex by applying pebbling moves repeatedly(if necessary), then delta is called a pebbling of G. The optimal pebbling number f'(G) of G is the minimum number of pebbles used in a pebbling of G. In this paper, we improve the known upper bound for the optimal pebbling number of the hypercubes Q (n) . Mainly, we prove for large n, by a probabilistic argument.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Fu, H.-L., Huang, K.-C., & Shiue, C.-L. (2013). A note on optimal pebbling of hypercubes. JOURNAL OF COMBINATORIAL OPTIMIZATION, 25(4), 597–601. https://doi.org/10.1007/s10878-012-9492-9

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/21649