On the Secure Vertex Cover Pebbling Number

TL;DR

This paper introduces the secure vertex cover pebbling number, a new graph invariant combining secure vertex cover and cover pebbling concepts, and explores its properties, complexity, and specific values for various graph classes.

Contribution

It defines the secure vertex cover pebbling number, analyzes its computational complexity, and calculates it for several important classes of graphs.

Findings

Secure vertex cover pebbling number defined and analyzed.

Complexity results for related pebbling problems.

Exact values obtained for complete r-partite, paths, Friendship, and wheel graphs.

Abstract

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.