Restricted optimal pebbling is NP-hard

TL;DR

This paper proves that determining the 2-restricted optimal pebbling number is NP-hard and explores conditions under which restricted and unrestricted pebbling numbers are equal or differ.

Contribution

It establishes NP-completeness for the 2-restricted optimal pebbling problem and characterizes graph degree conditions affecting pebbling number equality.

Findings

Deciding if $ ext{pi}_2^*(G) \

Proves $ ext{pi}_t^*(G)= ext{pi}^*(G)$ for graphs with high minimum degree.

Provides examples of graphs where $ ext{pi}_t^*(H) eq ext{pi}^*(H)$ despite high minimum degree.

Abstract

Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence of pebbling moves. A pebble distribution is solvable if each vertex is reachable under it. The size of a pebble distribution is the total number of pebbles. The optimal pebbling number $\pi^*(G)$ is the size of the smallest solvable distribution. A $t$-restricted pebble distribution places at most $t$ pebbles at each vertex. The $t$-restricted optimal pebbling number $\pi_t^*(G)$ is the size of the smallest solvable $t$-restricted pebble distribution. We show that deciding whether $\pi^*_2(G)\leq k$ is NP-complete. We prove that $\pi_t^*(G)=\pi^*(G)$ if $\delta(G)\geq \frac{2|V(G)|}{3}-1$ and we show infinitely many graphs which satisfies $\delta(H)\approx \frac{1}{2}|V(H)|$ but $\pi_t^*(H)\neq\pi^*(H)$, where $\delta$ denotes the minimum degree.