C_5的刺图的Pebbling数和2-Pebbling性质  

Pebbling Number and the 2-pebbling Property of the Thorn Graph of C_5

作　　者：郝冬林[1] 尹建华[1] 

机构地区：[1]海南大学信息科学技术学院,海南海口570228

出　　处：《海南大学学报（自然科学版）》2011年第3期209-212,共4页Natural Science Journal of Hainan University

基　　金：国家自然科学基金项目(10861006);海南大学科研基金项目(hd09xm87)

摘　　要：连通图G的Pebbling数f(G)是最小的整数n,使得不论n个Pebble如何放置在G的顶点上,总可以通过一系列的Pebbling移动把1个Pebble移到图G任意一个目标顶点上.其中,1个Pebbling移动是从一个顶点上移走2个Pebble,而把其中一个移到与其相邻的一个顶点上,获得了C5的刺图的Pebbling数,并证明其满足2-Pebbling性质.The pebbling number of a connected graph G is the smallest number f（G）,and that any distribution of f（G） pebbles on G allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves.A pebbling move on a graph G is to be removal of two pebbles from one vertex and then the addition of one pebble to some adjacent vertex.In our report,the pebbling number of the thorn graph of C5 was determined,and the property that the thorn graph of C5 has the 2-pebbling was testified.

关 键 词：刺图 PEBBLING数 2-Pebbling性质 

分 类 号：O157.5[理学—数学]