1-restricted optimal rubbling on graphs

Abstract

Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing a pebble on v. We seek an initial placement of a minimum total number of pebbles on the vertices in V , so that no vertex receives more than one pebble and for any given vertex v ∈ V , it is possible, by a sequence of pebbling and rubbling moves, to move at least one pebble to v. This minimum number of pebbles is the 1-restricted optimal rubbling number. We determine the 1-restricted optimal rubbling numbers for Cartesian products. We also present bounds on the 1-restricted optimal rubbling number.

Optimal pebbling of complete binary trees and a meta-Fibonacci sequence

“…For example, the optimal pebbling number of a graph has been extended in a variety of ways by restricting the capacity of the pebbling configuration or by placing additional requirements on the pebbling configuration; see, for example, [5,21,19,20]. Graph rubbling is a cognate of pebbling; readers who are interested in graph rubbling should consult [2,3,4,1].…”