2 research outputs found
Graham\u27s Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph
For connected graphs and , Graham conjectured that where , and are the pebbling numbers of , , and the Cartesian product , respectively. In this paper, we show that the inequality holds when is a complete graph of sufficiently large order in terms of graph parameters of