A note on optimal pebbling of hypercubes

DOI10.1007/s10878-012-9492-9zbMath1273.90225OpenAlexW2037894069MaRDI QIDQ1956255

Chin-Lin Shiue, Kuo-Ching Huang, Hung-Lin Fu

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9492-9

zbMATH Keywords

hypercubesoptimal pebbling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Distance restricted optimal pebbling in cycles ⋮ Capacity restricted optimal pebbling in graphs ⋮ Using error-correcting codes to construct solvable pebbling distributions ⋮ Restricted optimal pebbling and domination in graphs ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree ⋮ Large hypertree width for sparse random hypergraphs

Cites Work

• The optimal pebbling number of the caterpillar
• An addition theorem on the integers modulo \(n\)
• Pebbling graphs
• The optimal pebbling number of the complete \(m\)-ary tree
• The pebbling number of \(C_5\times C_5\)
• Optimally pebbling hypercubes and powers
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on optimal pebbling of hypercubes