一些乘积图的覆盖数(英文)  

Cover pebbling number of some product graphs

作　　者：孔伟[1] 潘永亮[1] 杨超[1] 

机构地区：[1]中国科学技术大学数学系,安徽合肥230026

出　　处：《中国科学技术大学学报》2008年第9期1030-1035,共6页JUSTC

基　　金：NNSF of China(10301031,10670091)

摘　　要：在图上进行小石块的移动的步骤为从一个点上取走两个小石块,并在它的某个邻点上放一个小石块.显然存在某个自然数,当图的所有点上的小石块的总数大于或等于它时,无论小石块在图上是如何初始分布的,都可以经过一系列的上述步骤,使得每个点上都至少有一个小石块.对一个图而言,满足此条件的最小的自然数即为此图的覆盖数.解决了字典乘积图和一些强乘积图的覆盖数问题,并给出了任意一个图的关键点与直径的两个端点之间的关系.A pebbling move on a graph G consists of taking two pebbles off from a vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph, 7（G）, is the minimum number of pebbles such that through a sequence of pebbling moves, a pebble can eventually be placed on every vertex simultaneously, no matter how the pebbles are initially distributed. The cover pebbling number for lexicographic product graphs and some strong product graphs were determined. The relationship between key vertices and ends of diameters for an arbitrary graph with a fixed diameter was obtained.

关 键 词：覆盖数 字典乘积 强乘积 关键点 

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