Cover pebbling hypercubes

MaRDI QIDQ5477386zbMATH OpenFDO

Authors Benjamin Munyan, Glenn H. Hurlbert

Publication date 3 July 2006

Full work available at URL https://arxiv.org/abs/math/0409368

zbMATH Keywords

cover pebblinggraph pebblinghypercube

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• Covering cover pebbling number of a hyperbube \& diameter d graphs
• The cover pebbling number of graphs
• Cover pebbling number for square of a path
• Cover pebbling numbers and bounds for certain families of graphs
• The cover pebbling theorem

Cited in

(14)

• Threshold and complexity results for the cover pebbling game
• Optimally pebbling hypercubes and powers
• Pebble sets in convex polygons
• The cover pebbling number of graphs
• The cover pebbling theorem
• Pebbling in Hypercubes
• Covering cover pebbling number of a hyperbube \& diameter d graphs
• Cover pebbling numbers and bounds for certain families of graphs
• scientific article; zbMATH DE number 4112541 (Why is no real title available?)
• General graph pebbling
• Cover pebbling number for square of a path
• Maximal matching cover pebbling number for variants of hypercube
• Hub cover pebbling number.
• Monophonic cover pebbling number (MCPN) of network graphs

This page was built for publication: Cover pebbling hypercubes

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