Rooks on Fibonacci Boards

Heiko Harborth and Lothar Piepmeyer

A chapter in Applications of Fibonacci Numbers, 1996, pp 155-163 from Springer

Abstract: Abstract Plane q-regular graphs with p-gons as cells are called (p,q)-mosaic graphs [3]. In [4] we called appropriate finite parts of (p,q)-mosaic graphs game boards B n (p,q). These start with a p-gon C1 for odd n, and a vertex point C0 for even n, and then are surrounded by [n/2] complete coronas C i of neighbor cells. The boards Bn(p,q) and Bn(q, p) are dual. The self dual boards B n (4,4) are the well known n x n-square boards or chessboards.

Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-0223-7_14

Ordering information: This item can be ordered from
http://www.springer.com/9789400902237

DOI: 10.1007/978-94-009-0223-7_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().