| 轮图中间图的pebbling数 |
| |
| 引用本文： | 史彩霞,叶永升,高洁,程芳.轮图中间图的pebbling数[J].淮北煤炭师范学院学报(自然科学版),2014(1):1-4. |
| |
| 作者姓名： | 史彩霞 叶永升 高洁 程芳 |
| |
| 作者单位： | 淮北师范大学 数学科学学院,安徽淮北235000 |
| |
| 基金项目： | 国家自然科学基金项目（6130048,11371243）;安徽省自然科学基金项目（1408085MA08）;安徽省教育厅自然科学基金项目（KJ20132279,1208085QF119） |
| |
| 摘 要： | 图G的一个pebbling移动是从一个顶点移走2个pebble,而把其中的一个移到与其相邻的一个顶点上.图G的pebbling数f(G)是最小的正整数n,使得不管n个pebble如何放置在G的顶点上,总可以通过一系列的pebbling移动把一个pebble移到图G的任意一个顶点上.文章研究轮图中间图的pebbling数.
|
| 关 键 词： | 轮图 中间图 pebbling数 |
Pebbling Number of the Middle Graph of Wheel Graphs |
| |
| SHI Cai-xia,YE Yong-sheng,GAO Jie,CHENG Fang.Pebbling Number of the Middle Graph of Wheel Graphs[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),2014(1):1-4. |
| |
| Authors: | SHI Cai-xia YE Yong-sheng GAO Jie CHENG Fang |
| |
| Institution: | (School of Mathematical Sciences, Huaibei Normal University, 235000, Huaibei ,Anhui , China ) |
| |
| Abstract: | A pebbling move on a graph G consists of taking two pebbles off one vertex and then placing one on an adjacent vertex. The pebbling number of a connected graph G,denoted by f（G）,is the least positive in-teger n such that any distribution of n pebbles on G allows one pebble to be moved to any specified,but arbi-trary vertex by a sequence of pebbling moves. This paper determines the pebbling number of the middle graph of wheel graphs. |
| |
| Keywords: | wheel graph middle graph pebbling number |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
