$2$-Restricted Optimal Pebbling Number of Some Graphs

Juma Gul Dehqan, Saeid Alikhani, Ali Delavar Khalafi +1

Let $G=(V,E)$ be a simple graph. A pebbling configuration on $G$ is a function $f:V\to \mathbb{N}\cup \{0\}$ that assigns a non-negative integer number of pebbles to each v…