Distance restricted optimal pebbling in cycles (Q2181222)

When the distance between any start vertex and a target vertex is restricted in a pebbling game, we get a new variant called \((d,t)\)-pebbling game. The paper under review studies the optimal \((d,t)\)-pebbling number of a graph for small values of \(d\). Let \(G\) be a graph. A distribution \(\delta\) of \(G\) is a mapping of \(V(G)\) onto \(\mathcal{N} \cup \{0\}\). For each \(v \in V\), \(\delta(v)\) denotes the number of pebbles distributed to \(v\). A pebbling move consists of removing two pebbles from one vertex and placing one pebble at an adjacent vertex. A distribution of a graph \(G\) is \((d,t)\)-solvable if we can place \(t\) pebbles on any target vertex \(v\) of \(G\) using pebbling moves only from the vertices within distance \(d\) from \(v\) in \(G\). The optimal \((d,t)\)-pebbling number of \(G\) denoted by \(\Pi^{\ast}_{(d,t)}(G)\) and is the minimum number of pebbles needed so that there is a \((d,t)\)-solvable distribution of \(G\). When \(d\) is the diameter of \(G\), the \((d,t)\)-pebbling number is the optimal pebbling number of \(G\). The Roman domination number is \(\Pi^{\ast}_{(1,1)}(G)\). In this article, the author studies the optional \((d,t)\)-pebbling number in graphs for small values of \(d\). Lower bound of \(\Pi^{*}_{(d,t)}(G)\) for any \(r\)-regular graph when \(d=1,2\) are presented and the exact value of \(\Pi^{*}_{(1,t)}(G)\) for all cycles is determined.