Papers
Topics
Authors
Recent
Search
2000 character limit reached

New constructions for the $n$-queens problem

Published 29 Mar 2017 in math.CO | (1703.09942v4)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.