A configuration of queens on an m X m chessboard is said to dominate the board if every square either contains a queen or is attacked by a queen. The configuration is said to be non-attacking if no queen attacks another queen. Let f(m) and g(m) equal the minimum number of queens and the minimum numb
โฆ LIBER โฆ
On the diagonal queens domination problem
โ Scribed by E.J Cockayne; S.T Hedetniemi
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 135 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the queen domination problem
โ
Charles M. Grinstead; Bruce Hahne; David Van Stone
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 393 KB
Domination and irredundance in the queen
โ
A.P Burger; E.J Cockayne; C.M Mynhardt
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 1020 KB
The vertices of the queem;' graph {~, are the squares of an n ร n chessboard and two squares are adjacent ifa queen placed on one covers the other. It is shown that the domination num;~'r of Q. is at most 31n/54 + O(1), that Q. possesses minimal dominating sets of cardina~tty 5n/2 -O(l) and that the
On diagonal dominance in linear compleme
โ
Muhamed Aganagic
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 476 KB
A general theorem on dominant-diagonal m
โ
P.J. Erdelsky
๐
Article
๐
1968
๐
Elsevier Science
๐
English
โ 546 KB
On the positivity of determinants with d
โ
Richard Bellman
๐
Article
๐
1977
๐
Elsevier Science
๐
English
โ 45 KB
The weighted perfect domination problem
โ
Chain-Chin Yen; R.C.T. Lee
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 393 KB