摘要
一个pebbling移动是从一个顶点移走两个pebbles,而把其中的一个移到与其相邻的一个顶点上.图G的最优pebbling数fopt(G)是最小的正整数n,使得把n个pebble恰当地放置在G的顶点上,总可以通过一系列的pebbling移动把一个pebble移到任何一个指定的顶点v上.文章给出了一个比较简单的P2×Pn的最优pebbling数的证明.
A pebbling move is taking two pebbles off one vertex and then placing one on an adjacent vertex. The opti- mal pebbling number tip,(G) is the least positive integer n such that n pebbles are placed suitably on vertices of G and for any specified vertex v of G, we can move one pebble to v by a sequence of pebbling moves. In this paper, we provide a simpler proof of the optimal pebbling number of P2 ×Pn.
出处
《淮北师范大学学报(自然科学版)》
CAS
2012年第2期1-4,共4页
Journal of Huaibei Normal University:Natural Sciences
基金
Anhui Provincial Natural Science Foundation(2010SQRL136ZD,1208085QF119)