arXiv:2109.07328 Abstract | arXiv Analytics

arXiv:2109.07328 [math.CO]Abstract References Reviews Resources

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

Published 2021-09-15Version 1

In this paper, we present a new method for determining the optimal pebbling number of a complete binary tree. This method reveals a curious connection between the optimal pebbling numbers of complete binary trees and the Conolly-Fox sequence, a type of meta-Fibonacci sequence.

Categories: math.CO

Subjects: 05C05

Keywords: complete binary tree, meta-fibonacci sequence, optimal pebbling number, conolly-fox sequence, curious connection

Related articles: Most relevant | Search more

arXiv:1810.05266 [math.CO] (Published 2018-10-11)

Optimal pebbling number of the square grid

Ervin Győri, Gyula Y. Katona, László F. Papp

arXiv:1804.03717 [math.CO] (Published 2018-04-10)

Optimal pebbling number of graphs with given minimum degree

Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp

arXiv:math/0506076 [math.CO] (Published 2005-06-03)

Optimal pebbling of paths and cycles