New constructions for the n-queens problem
From MaRDI portal
Publication:2302227
Abstract: Let be a digraph, possibly with loops. A queen labeling of is a bijective function such that, for every pair of arcs in , namely and we have (i) and (ii) . Similarly, if the two conditions are satisfied modulo , we define a modular queen labeling. There is a bijection between (modular) queen labelings of -regular digraphs and the solutions of the (modular) -queens problem. The -product was introduced in 2008 as a generalization of the Kronecker product and since then, many relations among labelings have been established using the -product and some particular families of graphs. In this paper, we study some families of -regular digraphs that admit (modular) queen labelings and present a new construction concerning to the (modular) -queens problem in terms of the -product, which in some sense complements a previous result due to P'olya.
Recommendations
Cites work
- A dynamic survey of graph labeling
- A problem on edge-magic labelings of cycles
- A survey of known results and research areas for \(n\)-queens
- Bi-magic and other generalizations of super edge-magic labelings
- Graceful, harmonious and magic type labelings. Relations and techniques
- Handbook of product graphs
- scientific article; zbMATH DE number 1614340 (Why is no real title available?)
- scientific article; zbMATH DE number 5360700 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 1269934 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Labeling constructions using digraph products
- Labeling generating matrices
- Magic Valuations of Finite Graphs
- Perfect (super) edge-magic crowns
- Queen labelings
- Strongly indexable graphs
- The jumping knight and other (super) edge-magic constructions
- The n-Queens Problem
- The place of super edge-magic labelings among other classes of labelings
- The power of digraph products applied to labelings
Cited in
(3)
This page was built for publication: New constructions for the \(n\)-queens problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302227)