通过对简单图中水晶覆盖数的研究,给出了几类图的水晶覆盖数,部分解决了文献[2]中提出的一个开放问题,得到了连通图的水晶覆盖数的紧的界。
In this paper, we determine γ(G) of several partly an open problem proposed in Literature [2]. We classes graphs. At the same time, we settle have obtained the bound of the cover pebbling number of connected graph of order n , which is the best possible.