论文标题
在安全的顶点盖卵石号码上
On the Secure Vertex Cover Pebbling Number
论文作者
论文摘要
本文介绍了一个称为“安全顶点盖”卵石编号的新图，称为安全顶点盖卵石编号，这是两个图形不变式的组合，即安全的顶点盖和盖卵石编号。图G的安全顶点盖卵石数是最小数字m，因此M卵石的每个分布都可以通过一系列卵石移动到达G的某些安全顶点盖。在本文中，讨论了安全顶点覆盖问题和安全顶点覆盖卵石问题的复杂性。另外，我们获得了一些基本结果，并获得了完整的R部分图形，路径，友谊图和车轮图的安全顶点盖卵石编号。
A new graph invariant called the secure vertex cover pebbling number, which is a combination of two graph invariants, namely secure vertex cover and cover pebbling number, is introduced in this paper. The secure vertex cover pebbling number of a graph G is the minimum number m so that every distribution of m pebbles can reach some secure vertex cover of G by a sequence of pebbling moves. In this paper, the complexity of the secure vertex cover problem and secure vertex cover pebbling problem are discussed. Also, we obtain some basic results and the secure vertex cover pebbling number for complete r- partite graphs, paths, Friendship graphs, and wheel graphs.
