Search Results

You are looking at 1 - 3 of 3 items for

  • Author: Andreas M. Hinz x
Clear All Modify Search
Open access

Albrecht Heeffer and Andreas M. Hinz

Abstract

The Chinese rings puzzle is one of those recreational mathematical problems known for several centuries in the West as well as in Asia. Its origin is diffcult to ascertain but is most likely not Chinese. In this paper we provide an English translation, based on a mathematical analysis of the puzzle, of two sixteenth-century witness accounts. The first is by Luca Pacioli and was previously unpublished. The second is by Girolamo Cardano for which we provide an interpretation considerably different from existing translations. Finally, both treatments of the puzzle are compared, pointing out the presence of an implicit idea of non-numerical recursive algorithms.

Open access

Seethu Varghese, A. Vijayakumar and Andreas M. Hinz

Abstract

In this paper, we study the power domination problem in Knödel graphs W Δ,2ν and Hanoi graphs Hpn . We determine the power domination number of W 3,2ν and provide an upper bound for the power domination number of W r+1,2r+1 for r ≥ 3. We also compute the k-power domination number and the k-propagation radius of Hp2 .

Open access

Seethu Varghese, A. Vijayakumar and Andreas M. Hinz

Abstract

In this paper, we study the power domination problem in Knödel graphs W Δ,2ν and Hanoi graphs Hpn . We determine the power domination number of W 3,2ν and provide an upper bound for the power domination number of W r+1,2r+1 for r ≥ 3. We also compute the k-power domination number and the k-propagation radius of Hp2 .