The optimal pebbling number of the complete \(m\)-ary tree

DOI10.1016/S0012-365X(00)00008-XzbMath0982.05037OpenAlexW1983834820MaRDI QIDQ1579551

Hung-Lin Fu, Chin-Lin Shiue

Publication date: 8 April 2002

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

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

zbMATH Keywords

configurationoptimal pebbling numbercomplete \(m\)-ary treepebblespebbling move

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Optimal pebbling number of the square grid, General graph pebbling, Distance restricted optimal pebbling in cycles, The optimal pebbling number of staircase graphs, A note on optimal pebbling of hypercubes, 1-restricted optimal rubbling on graphs, Optimal pebbling number of graphs with given minimum degree, Capacity restricted optimal pebbling in graphs, Restricted optimal pebbling and domination in graphs, Optimal pebbling and rubbling of graphs with given diameter, 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