Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949692 | Discrete Applied Mathematics | 2017 | 8 Pages |
Abstract
For a graph G=(V,E), we consider placing a variable number of pebbles on the vertices of V. A pebbling move consists of deleting two pebbles from a vertex uâV and placing one pebble on a vertex v adjacent to u. We seek an initial placement of a minimum total number of pebbles on the vertices in V, so that no vertex receives more than some positive integer t pebbles and for any given vertex vâV, it is possible, by a sequence of pebbling moves, to move at least one pebble to v. We relate this minimum number of pebbles to several other well-studied parameters of a graph G, including the domination number, the optimal pebbling number, and the Roman domination number of G.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis,