Optimal pebbling of complete binary trees and a meta-Fibonacci sequence

DOI10.7151/DMGT.2556MaRDI QIDQ6950212zbMATH OpenFDO

Authors Thomas M. Lewis, Fabian Salinas

Publication date 31 July 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2556

zbMATH Keywords

complete binary treemeta-Fibonacci sequenceoptimal pebbling

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Games involving graphs (91A43)

Cites work

• 1-restricted optimal rubbling on graphs
• Capacity restricted optimal pebbling in graphs
• Distance restricted optimal pebbling in cycles
• Domination cover rubbling
• Doppelgangers and Lemke graphs
• General graph pebbling
• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• Introduction to algorithms.
• Optimal pebbling and rubbling of graphs with given diameter
• Optimal pebbling in products of graphs
• Optimal pebbling number of graphs with given minimum degree
• Optimal pebbling number of the square grid
• Optimal pebbling on grids
• Pebbling in Hypercubes
• Restricted optimal pebbling and domination in graphs
• Rubbling and optimal rubbling of graphs
• The 2-pebbling property of squares of paths and Graham's conjecture
• The domination cover pebbling number for some cyclic graphs and path graphs.
• The optimal t-pebbling number of a certain complete m-ary tree
• The optimal pebbling number of square of paths and cycles.
• The optimal pebbling number of staircase graphs
• The optimal pebbling number of the caterpillar
• The optimal pebbling number of the complete \(m\)-ary tree
• The optimal pebbling of spindle graphs
• Total domination cover rubbling
• Two-pebbling and odd-two-pebbling are not equivalent

This page was built for publication: Optimal pebbling of complete binary trees and a meta-Fibonacci sequence

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