Optimal pebbling in products of graphs

From MaRDI portal
Publication:3100997




Abstract: We prove a generalization of Graham's Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal t-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5. Finally, we present explicit distributions which provide asymptotic bounds on optimal pebbling numbers of hypercubes.









This page was built for publication: Optimal pebbling in products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100997)