Optimal pebbling in products of graphs
From MaRDI portal
Publication:3100997
zbMATH Open1236.05169arXiv0907.5577MaRDI QIDQ3100997FDOQ3100997
Authors: David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert Error creating thumbnail:
Publication date: 22 November 2011
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.
Full work available at URL: https://arxiv.org/abs/0907.5577
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
- Title not available (Why is that?)
- Optimal t-rubbling on complete graphs and paths
- Using error-correcting codes to construct solvable pebbling distributions
- 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)