首页 | 本学科首页   官方微博 | 高级检索  
     检索      

几类图的pebbling数
引用本文:王艳秋,叶永升.几类图的pebbling数[J].淮北煤炭师范学院学报(自然科学版),2014(4):1-4.
作者姓名:王艳秋  叶永升
作者单位:淮北师范大学 数学科学学院,安徽 淮北,235000
基金项目:安徽省自然科学基金项目(1408085MA08);安徽省教育厅自然科学基金项目
摘    要:图G的pebbling数 f (G )是最小的整数n ,使得不论n个pebbles如何放置在图G的顶点上,总可以通过一系列的pebbling移动把一个pebble移到任意一个顶点上,其中一个pebbling移动是从一个顶点处移走两个pebbles,而把其中的一个移到与其相邻的一个顶点上。文章给出图Fn?Pk、Wn?Pk和双轮图Wm?Pk-1?Wn的peb?bling数。

关 键 词:pebbling移动  pebbling数  双轮图

The Pebbling Number of Some Graphs
WANG Yan-qiu,YE Yong-sheng.The Pebbling Number of Some Graphs[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),2014(4):1-4.
Authors:WANG Yan-qiu  YE Yong-sheng
Institution:(School of Mathematical Science, Huaibei Normal University, 235000, Huaibei ,Anhui , China)
Abstract:The pebbling number of a graph G ,f (G ) ,is the least n . No matter how n pebbles are placed on the vertices of G ,a pebble can be moved to any vertex by a sequence of pebbling moves. A pebbling move consists of the removal of two pebbles vertex and the placement of one of those two pebbles on an adja?cent vertex. This paper shows that the pebbling number of two graphs Fn?Pk ,Wn?Pk and the double-wheel graph.
Keywords:pebbling move  pebbling number  double-wheel graph
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号