{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T14:40:04Z","timestamp":1747665604102,"version":"3.40.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T00:00:00Z","timestamp":1744761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T00:00:00Z","timestamp":1744761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P2-0248","J1-4031"],"award-info":[{"award-number":["P2-0248","J1-4031"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Cylindrical graphs and torus grid graphs are naturally constructed from subgraphs of the infinite grid by certain identifications of boundary vertices. Considering various domination type problems, it is usually possible to find an optimal solution on the infinite grid. To the contrary, exact values of invariants for the cylindrical and torus grid graphs are typically only known for special subfamilies, and are in general hard to compute. The 2-domination and 2-rainbow domination of cylindrical graphs is studied, and some new formulae and improved bounds are reported. We also consider weak 2-domination and singleton rainbow domination.<\/jats:p>","DOI":"10.1007\/s40314-025-03201-2","type":"journal-article","created":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T05:46:32Z","timestamp":1744782392000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On 2-domination and 2-rainbow domination of cylindrical graphs"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6041-1106","authenticated-orcid":false,"given":"Janez","family":"\u017derovnik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,16]]},"reference":[{"key":"3201_CR1","doi-asserted-by":"publisher","unstructured":"Bre\u0161ar B (2020) Rainbow domination in graphs. In: Haynes TW, Hedetniemi ST, Henning MA (eds) Topics in Domination in Graphs, pp. 411\u2013443. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-51117-3_12","DOI":"10.1007\/978-3-030-51117-3_12"},{"issue":"1","key":"3201_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.11650\/twjm\/1500602498","volume":"12","author":"B Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B, Henning MA, Rall DF (2008) Rainbow domination in graphs. Taiwan J Math 12(1):213\u2013225. https:\/\/doi.org\/10.11650\/twjm\/1500602498","journal-title":"Taiwan J Math"},{"key":"3201_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-024-00949-6","author":"S Brezovnik","year":"2024","unstructured":"Brezovnik S, Rupnik Poklukar D, \u017derovnik J (2024) The 2-rainbow domination number of cartesian bundles over cycles. Cent Eur J Oper Res Print. https:\/\/doi.org\/10.1007\/s10100-024-00949-6","journal-title":"Cent Eur J Oper Res Print"},{"key":"3201_CR4","doi-asserted-by":"publisher","unstructured":"Brezovnik S, Rupnik\u00a0Poklukar D, \u017derovnik J (2024) The 2-rainbow domination number of cartesian product of cycles. ARS Math Contemp. https:\/\/doi.org\/10.26493\/1855-3974.3168.74d","DOI":"10.26493\/1855-3974.3168.74d"},{"key":"3201_CR5","doi-asserted-by":"publisher","unstructured":"Erve\u0161 R, \u017derovnik J (2021) On 3-rainbow domination number of generalized Petersen graphs $${P}(6k, k)$$. Symmetry 13(10) https:\/\/doi.org\/10.3390\/sym13101860","DOI":"10.3390\/sym13101860"},{"key":"3201_CR6","unstructured":"Fink JF, Jacobson MS (1985) n-domination in graphs. https:\/\/api.semanticscholar.org\/CorpusID:118533627"},{"issue":"2","key":"3201_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.3233\/FI-222107","volume":"185","author":"EM Garz\u00f3n","year":"2022","unstructured":"Garz\u00f3n EM, Mart\u00ednez JA, Moreno JJ, Puertas ML (2022) On the 2-domination number of cylinders with small cycles. Fund Inform 185(2):185\u2013199. https:\/\/doi.org\/10.3233\/FI-222107","journal-title":"Fund Inform"},{"issue":"16","key":"3201_CR8","doi-asserted-by":"publisher","first-page":"17826","DOI":"10.1007\/s11227-022-04574-5","volume":"78","author":"EM Garz\u00f3n","year":"2022","unstructured":"Garz\u00f3n EM, Mart\u00ednez JA, Moreno JJ, Puertas ML (2022) Hpc acceleration of large (min, +) matrix products to compute domination-type parameters in graphs. J Supercomput 78(16):17826\u201317843. https:\/\/doi.org\/10.1007\/s11227-022-04574-5","journal-title":"J Supercomput"},{"key":"3201_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.61091\/jcmcc120-38","volume":"120","author":"DR Guichard","year":"2024","unstructured":"Guichard DR (2024) A new lower bound for the domination number of complete cylindrical grid graphs. J Comb Math Comb Comput 120:411\u2013416. https:\/\/doi.org\/10.61091\/jcmcc120-38","journal-title":"J Comb Math Comb Comput"},{"key":"3201_CR10","doi-asserted-by":"crossref","unstructured":"Hammack R, Imrich W, Klav\u017ear S (2011) Handbook of Product Graphs, 2nd edn. Discrete Mathematics and its Applications (Boca Raton), p. 518. CRC Press, Boca Raton, FL. With a foreword by Peter Winkler","DOI":"10.1201\/b10959"},{"key":"3201_CR11","doi-asserted-by":"publisher","unstructured":"Haynes TW, Hedetniemi S, Slater P (1998) Fundamentals of Domination in Graphs, 1st ed. edn. CRC Press, New York. https:\/\/doi.org\/10.1201\/9781482246582","DOI":"10.1201\/9781482246582"},{"key":"3201_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","author":"TW Haynes","year":"2020","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (2020) Topics in Domination in Graphs. Springer, Cham"},{"key":"3201_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0166-218X(95)00058-Y","volume":"68","author":"S Klav\u017dar","year":"1996","unstructured":"Klav\u017dar S, \u017derovnik J (1996) Algebraic approach to fasciagraphs and rotagraphs. Discrete Appl Math 68:93\u2013100","journal-title":"Discrete Appl Math"},{"issue":"8","key":"3201_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s40314-022-02137-1","volume":"41","author":"JA Mart\u00ednez","year":"2022","unstructured":"Mart\u00ednez JA, Castano-Fernandez AB, Puertas ML (2022) The 2-domination number of cylindrical graphs. Comput Appl Math 41(8):424. https:\/\/doi.org\/10.1007\/s40314-022-02137-1","journal-title":"Comput Appl Math"},{"key":"3201_CR15","first-page":"275","volume":"37","author":"P Pavli\u010d","year":"2013","unstructured":"Pavli\u010d P, \u017derovnik J (2013) A note on the domination number of the Cartesian products of paths and cycles. Kragujevac J Math 37:275\u2013285","journal-title":"Kragujevac J Math"},{"key":"3201_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","volume":"35","author":"T Pisanski","year":"1983","unstructured":"Pisanski T, Shawe-Taylor J, Vrabec J (1983) Edge-colorability of graph bundles. J Comb Theory Ser B 35:12\u201319","journal-title":"J Comb Theory Ser B"},{"issue":"5","key":"3201_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s40009-018-0779-y","volume":"42","author":"Z Shao","year":"2019","unstructured":"Shao Z, Li Z, Erve\u0161 R, \u017derovnik J (2019) The 2-rainbow domination numbers of $${C_4} \\square {C_n}$$ and $$C_8 \\square C_n$$. Natl Acad Sci Lett 42(5):411\u2013418. https:\/\/doi.org\/10.1007\/s40009-018-0779-y","journal-title":"Natl Acad Sci Lett"},{"issue":"3","key":"3201_CR18","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s10878-013-9658-0","volume":"30","author":"Z St\u0229pie\u0144","year":"2015","unstructured":"St\u0229pie\u0144 Z, Szymaszkiewicz L, Zwierzchowski M (2015) The Cartesian product of cycles with small 2-rainbow domination number. J Comb Optim 30(3):668\u2013674. https:\/\/doi.org\/10.1007\/s10878-013-9658-0","journal-title":"J Comb Optim"},{"key":"3201_CR19","first-page":"197","volume":"36","author":"J \u017derovnik","year":"2006","unstructured":"\u017derovnik J (2006) New formulas for the pentomino exclusion problem. Aust J Combin 36:197\u2013212","journal-title":"Aust J Combin"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03201-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T14:10:50Z","timestamp":1747663850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03201-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,16]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["3201"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03201-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,4,16]]},"assertion":[{"value":"11 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares he has no interests in relation to contents of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"239"}}