Optimally pebbling hypercubes and powers

DOI10.1016/S0012-365X(98)00154-XMaRDI QIDQ1584396zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A note on optimal pebbling of hypercubes
• Optimal pebbling in products of graphs
• Optimally \(t\)-pebbling graphs
• Cover pebbling hypercubes
• Pebbling and optimal pebbling in graphs

Cites work

• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• A nonconstructive upper bound on covering radius
• An addition theorem on the integers modulo n
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths

Cited in

(17)

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

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

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