On binary DCP labeling
In this paper, the authors explore the relationship between two graph parameters, namely graph labeling and domination cover pebbling. A graph labeling is an assignment of integers to the vertices or edges or both, which will satisfy certain conditions. The domination cover pebbling number of a graph \(G\) is \(\psi(G)\) which is the minimum number of pebbles required in such a way that any initial configuration of \(\psi(G)\) pebbles should be transformed through a number of pebbling moves such that the set of vertices with pebbles after the pebbling operation form a dominating set of \(G\). The authors determine the binary DCP labeling of a few graphs like paths, cycle stars, wheels, fans, binary trees, lollipops, squares of the path, pseudo star graphs, and fuse graphs. Also, they give a Python program for binary DCP labeling of path and cycle graphs. The detailed references are appreciated. The paper seems to be a creative piece of work overall. The presentation of the results is also good. Researchers will benefit a lot from reading the paper.
This page was built for publication: On binary DCP labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625096)
