New constructions for the $n$-queens problem
Preprint
Abstract
Let $D$ be a digraph, possibly with loops. A queen labeling of $D$ is a bijective function $l:V(G)\longrightarrow \{1,2,\ldots,|V(G)|\}$ such that, for every pair of arcs in $E(D)$, namely $(u,v)$ and $(u',v')$ we have (i) $l(u)+l(v)\neq l(u')+l(v')$ and (ii) $l(v)-l(u)\neq l(v')-l(u')$. Similarly, if the two conditions are satisfied modulo $n=|V(G)|$, we define a modular queen labeling. There is a bijection between (modular) queen labelings of $1$-regular digraphs and the solutions of the (modular) $n$-queens problem. The $\otimes_h$-product was introduced in 2008 as a generalization of the Kronecker product and since then, many relations among labelings have been established using the $\otimes_h$-product and some particular families of graphs. In this paper, we study some families of $1$-regular digraphs that admit (modular) queen labelings and present a new construction concerning to the (modular) $n$-queens problem in terms of the $\otimes_h$-product, which in some sense complements a previous result due to P\'olya.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- The on-line encyclopedia of integer sequencesNotices of the American Mathematical Society, 2018
- Perfect (super) Edge-Magic CrownsResults in Mathematics, 2017
- Labeling constructions using digraph productsDiscrete Applied Mathematics, 2013
- The Jumping Knight and Other (Super) Edge-Magic ConstructionsMediterranean Journal of Mathematics, 2013
- The power of digraph products applied to labelingsDiscrete Mathematics, 2012
- BI-MAGIC AND OTHER GENERALIZATIONS OF SUPER EDGE-MAGIC LABELINGSBulletin of the Australian Mathematical Society, 2011
- Handbook of Product Graphs2011
- A survey of known results and research areas for-queensDiscrete Mathematics, 2009
- The place of super edge-magic labelings among other classes of labelingsDiscrete Mathematics, 2001
- Strongly indexable graphsDiscrete Mathematics, 1991