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 -pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle . Finally, we present explicit distributions which provide asymptotic bounds on optimal pebbling numbers of hypercubes.
Recommendations
Cited in
(15)- Optimal pebbling and rubbling of graphs with given diameter
- A note on optimal pebbling of hypercubes
- The optimal pebbling of spindle graphs
- Capacity restricted optimal pebbling in graphs
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Pebbling and optimal pebbling in graphs
- Optimally \(t\)-pebbling graphs
- On the target pebbling conjecture
- Optimally pebbling hypercubes and powers
- scientific article; zbMATH DE number 7709890 (Why is no real title available?)
- Using error-correcting codes to construct solvable pebbling distributions
- Optimal t-rubbling on complete graphs and paths
- Restricted optimal pebbling and domination in graphs
- Graph pebbling: a blend of graph theory, number theory, and optimization
- General graph pebbling
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)