2 papers
math.CO2021
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence
Thomas M. Lewis, Fabian Salinas
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…
math.CO2015
On the Hamiltonian Number of a Planar Graph
Thomas M. Lewis
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed, spanning walks in the graph. In 1968, Grinberg published a necessary condition for the exis…