Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Journal of Combinatorial Mathematics and Combinatorial Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
