𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the number of knight's tours

✍ Scribed by Olaf Kyek; Ian Parberry; Ingo Wegener

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
726 KB
Volume
74
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

Knight's tours are a fascinating subject. New lower bounds on the number of knight's tours and structured knight's tours on n x IZ chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.

πŸ“œ SIMILAR VOLUMES

An efficient algorithm for the Knight's
An efficient algorithm for the Knight's tour problem
✍ Ian Parberry πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 715 KB

It is easy to see that there is no closed knight's tour when n is odd since such a board has one more white square than black, or vice versa, and since the colours of the squares visited on a knight's tour must alternate.

Bounds on the number of complete subgrap
Bounds on the number of complete subgraphs
✍ David C. Fisher; Jennifer Ryan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

Bounds on the bondage number of a graph
Bounds on the bondage number of a graph
✍ Bert L. Hartnell; Douglas F. Rall πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 317 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G results in a graph with domination number larger than that of G. Several new sharp upper bounds for b(G) are established. In addition, we present an infinite class of graphs each of whose bond

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ Ermelinda DeLaViΓ±a; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part