| C5的刺图的Pebbling数和2-Pebbling性质 |
| |
| 引用本文： | 郝冬林,尹建华.C5的刺图的Pebbling数和2-Pebbling性质[J].海南大学学报(自然科学版),2011,29(3):209-212. |
| |
| 作者姓名： | 郝冬林 尹建华 |
| |
| 作者单位： | 海南大学信息科学技术学院,海南 海口,570228 |
| |
| 基金项目： | 国家自然科学基金项目(10861006); 海南大学科研基金项目(hd09xm87) |
| |
| 摘 要： | 连通图G的Pebbling数f(G)是最小的整数n,使得不论n个Pebble如何放置在G的顶点上,总可以通过一系列的Pebbling移动把1个Pebble移到图G任意一个目标顶点上.其中,1个Pebbling移动是从一个顶点上移走2个Pebble,而把其中一个移到与其相邻的一个顶点上,获得了C5的刺图的Pebbling...
|
| 关 键 词： | 刺图 Pebbling数 2-Pebbling性质 |
Pebbling Number and the 2-pebbling Property of the Thorn Graph of C_5 |
| |
| HAO Dong-lin,YIN Jian-hua.Pebbling Number and the 2-pebbling Property of the Thorn Graph of C_5[J].Natural Science Journal of Hainan University,2011,29(3):209-212. |
| |
| Authors: | HAO Dong-lin YIN Jian-hua |
| |
| Institution: | HAO Dong-lin,YIN Jian-hua(College of Information Science and Technology,Hainan University,Haikou 570228,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | thorn graph the pebbling number the 2-pebbling property |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
