On Binary DCP Labeling

A graph labeling is an assignment of integers to the vertices or edges or both, which satisfies certain conditions. The domination cover pebbling number of a graph G is ψ ( G ) , which is the minimum number of pebbles required such that any initial configuration of ψ ( G ) pebbles can be transformed through a number of pebbling moves so that the set of vertices with pebbles after the pebbling operation forms a dominating set of G . In this paper, we explore the relationship between two graph parameters, namely graph labeling and domination cover pebbling.