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)\ne l(u')+l(v')\) and (ii) \(l(v)-l(u)\ne 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ólya.
Similar content being viewed by others
References
Acharya, B.D., Hegde, S.M.: Strongly indexable graphs. Discrete Math. 93, 123–129 (1991)
Bača, M., Miller, M.: Super Edge-Antimagic Graphs. BrownWalker Press, Boca Raton (2008)
Bell, J., Stevens, B.: A survey of known results and research areas for \(n\)-queens. Discrete Math. 309, 1–31 (2009)
Bloom, G., Lampis, M., Muntaner-Batle, F.A., Rius-Font, M.: Queen labelings. AKCE Int. J. Graphs Comb. 8(1), 13–22 (2011)
Chartrand, G., Lesniak, L.: Graphs and Digraphs, 2nd edn. Wadsworth & Brooks/Cole Advanced Books and Software, Monterey (1986)
Enomoto, H., Lladó, A., Nakamigawa, T., Ringel, G.: Super edge-magic graphs. SUT J. Math. 34, 105–109 (1998)
Figueroa-Centeno, R.M., Ichishima, R., Muntaner-Batle, F.A.: The place of super edge-magic labelings among other classes of labelings. Discrete Math. 231(1–3), 153–168 (2001)
Figueroa-Centeno, R.M., Ichishima, R., Muntaner-Batle, F.A., Rius-Font, M.: Labeling generating matrices. J. Comb. Math. Comb. Comput. 67, 189–216 (2008)
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 19, DS6 (2016)
Hammarck, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Raton (2011)
Ichishima, R., López, S.C., Muntaner-Batle, F.A., Rius-Font, M.: The power of digraph products applied to labelings. Discrete Math. 312, 221–228 (2012)
Kotzig, A., Rosa, A.: Magic valuations of finite graphs. Can. Math. Bull. 13, 451–461 (1970)
López, S.C., Muntaner-Batle, F.A., Rius-Font, M.: Bi-magic and other generalizations of super edge-magic labelings. Bull. Aust. Math. Soc. 84, 137–152 (2011)
López, S.C., Muntaner-Batle, F.A., Rius-Font, M.: Labeling constructions using digraph products. Discrete Appl. Math. 161, 3005–3016 (2013)
López, S.C., Muntaner-Batle, F.A., Rius-Font, M.: A problem on edge-magic labelings of cycles. Can. Math. Bull. 57(2), 375–380 (2014)
López, S.C., Muntaner-Batle, F.A., Rius-Font, M.: The jumping knight and other (super) edge-magic constructions. M. Mediterr. J. Math. 11, 217–235 (2014)
López, S.C., Muntaner-Batle, F.A.: Graceful, Harmonious and Magic Type Labelings: Relations and Techniques. Springer, New York (2017)
López, S.C., Muntaner-Batle, F.A., Prabu, M.: Perfect (super) edge-magic crowns. Results Math. 71, 1459–1471 (2017)
Park, H., Park, J., Kim, D.: A criterion on primitive roots modulo \(p\). J. KSIAM 4(1), 29–38 (2000)
Pauls, E.: Das Maximalproblem der Damen auf dem Schachbrete, Deutsche Schachzeitung. Organ für das Gesammte Schachleben 29(5), 129–134 (1874)
Pauls, E.: Das Maximalproblem der Damen auf dem Schachbrete, II, Deutsche Schachzeitung. Organ für das Gesammte Schachleben 29(9), 257–267 (1874)
Pólya, G.: Über die “doppelt-periodischen” Losüngen des \(n\)-Damen-Problems. In: Ahrens, W. (ed.) Mathematische Unterhaltungen und Spiele, vol. 2, 2nd edn, pp. 364–374. B.G. Teubner, Leipzig (1918)
Rivin, I., Vardi, I., Zimmerman, P.: The \(n\)-queens problem. Am. Math. Mon. 101(7), 629–639 (1994)
Sloane, N.J.A.: On-Line Encyclopedia of Integer Sequences (2010). http://oeis.org/Seis.html. Accessed 6 Feb 2017
Wallis, W.D.: Magic Graphs. Birkhaüser, Boston (2001)
Acknowledgements
The research conducted in this document by the first and the fourth authors has been supported by APVV-15-0116 and VEGA 1/0233/18. The research conducted by second author has been supported by MTM2014-60127-P. Funding was provided by Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR (Grant No. APVV-15-0116) and Ministerio de Educación, Cultura y Deporte (Grant No. MTM2014-60127-P), respectively.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research conducted in this document by the first and the fourth authors has been supported by APVV-15-0116 and VEGA 1/0233/18. The research conducted by second author has been supported by the Spanish Research Council under project MTM2014-60127-P. This work was developed while the second author was visiting the Department of Applied Mathematics and Informatics of the Technical University in Košice.
Rights and permissions
About this article
Cite this article
Bača, M., López, S.C., Muntaner-Batle, F.A. et al. New Constructions for the n-Queens Problem. Results Math 75, 41 (2020). https://doi.org/10.1007/s00025-020-1166-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00025-020-1166-9