More on the $2$-restricted optimal pebbling number

Saeid Alikhani, Fatemeh Aghaei

Let $G=(V,E)$ be a simple graph. A function $f:V\to \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the weight of $f$ is $w(f)=\sum_{u…