Optimally pebbling hypercubes and powers

DOI10.1016/S0012-365X(98)00154-XzbMath0957.05102OpenAlexW2066149379MaRDI QIDQ1584396

David Moews

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00154-x

zbMATH Keywords

optimal pebbling numberdistribution of pebbles

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (15)

Optimal pebbling on grids ⋮ \(t\)-pebbling and extensions ⋮ General graph pebbling ⋮ Distance restricted optimal pebbling in cycles ⋮ Strict optimal rubbling of graphs ⋮ A note on optimal pebbling of hypercubes ⋮ The pebbling threshold of the square of cliques ⋮ Capacity restricted optimal pebbling in graphs ⋮ Using error-correcting codes to construct solvable pebbling distributions ⋮ Restricted optimal pebbling and domination in graphs ⋮ Graph pegging numbers ⋮ Rubbling and optimal rubbling of graphs ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree ⋮ A new lower bound on the optimal pebbling number of the grid ⋮ The optimal pebbling of spindle graphs

Cites Work

• Unnamed Item
• An addition theorem on the integers modulo \(n\)
• A nonconstructive upper bound on covering radius
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths

This page was built for publication: Optimally pebbling hypercubes and powers