arXiv subjects
Publications and source records attributed to Thomas M. Lewis.
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.
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 existence of a Hamiltonian cycle in a planar graph, formulated in terms of the lengths of its face cycles. We show how Grinberg's theorem can be adapted to provide a lower bound on the Hamiltonian number of a planar graph.