For connected graphs $G$ and $H$, Graham conjectured that $\pi(G\square H)\leq\pi(G)\pi(H)$ where $\pi(G), \pi(H)$, and $\pi(G\square H)$ are the pebbling numbers of $G$, $H$, and the Cartesian product $G\square H$, respectively. In this paper, we show that the inequality holds when $H$ is a complete graph of sufficiently large order in terms of graph parameters of $G$.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

ref_tag_2020070101.pdf (135 kB)
Supplemental file with DOI