摘要
图G的pebbling数f(G)是指在一个图G的顶点上以任意方式放置若干个pebble数目的最小值,满足通过一系列的pebbling移动使得任一指定目标顶点能得到一个pebble,而pebbling移动是从一个顶点处移走两个pebble并把其中的一个移到与其相邻的一个顶点上.文章定义了将两个图的直径端点之一粘接生成的一类粘接图,主要计算了一些粘接图的pebbling数,发现了两类满足pebbling数直径下界的图.
The pebbling number f（G） of a graph G is the smallest integer t such that, for any distribution of t pebbles onto the vertices of G ,one pebble can be moved to any specified root vertex by a sequence of pebbling moves.A pebbling move consists of removing two pebbles from one vertex and then placing one pebble at an its adjacent vertex.In this paper,we define the glued graph based on the common pole vertex of two graphs, calculate some pebbling numbers of glued graphs and find two kinds of Jzraohs with one of lower hounds on pebbling number.
出处
《泉州师范学院学报》
2013年第2期1-7,共7页
Journal of Quanzhou Normal University
