English

New constructions for the $n$-queens problem

Combinatorics 2019-09-04 v4

Abstract

Let DD be a digraph, possibly with loops. A queen labeling of DD is a bijective function l:V(G){1,2,,V(G)}l:V(G)\longrightarrow \{1,2,\ldots,|V(G)|\} such that, for every pair of arcs in E(D)E(D), namely (u,v)(u,v) and (u,v)(u',v') we have (i) l(u)+l(v)l(u)+l(v)l(u)+l(v)\neq l(u')+l(v') and (ii) l(v)l(u)l(v)l(u)l(v)-l(u)\neq l(v')-l(u'). Similarly, if the two conditions are satisfied modulo n=V(G)n=|V(G)|, we define a modular queen labeling. There is a bijection between (modular) queen labelings of 11-regular digraphs and the solutions of the (modular) nn-queens problem. The h\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 h\otimes_h-product and some particular families of graphs. In this paper, we study some families of 11-regular digraphs that admit (modular) queen labelings and present a new construction concerning to the (modular) nn-queens problem in terms of the h\otimes_h-product, which in some sense complements a previous result due to P\'olya.

Cite

@article{arxiv.1703.09942,
  title  = {New constructions for the $n$-queens problem},
  author = {Martin Bača and Susana-Clara López and Francesc-Antoni Muntaner-Batle and Andrea Semaničová-Feňovčíková},
  journal= {arXiv preprint arXiv:1703.09942},
  year   = {2019}
}

Comments

11 pages, 3 figures

R2 v1 2026-06-22T19:00:34.624Z