{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T22:05:53Z","timestamp":1783116353726,"version":"3.54.6"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T00:00:00Z","timestamp":1500249600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Project of China","award":["2016YFB0800700"],"award-info":[{"award-number":["2016YFB0800700"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672050"],"award-info":[{"award-number":["61672050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61632002"],"award-info":[{"award-number":["61632002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61309015"],"award-info":[{"award-number":["61309015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572046"],"award-info":[{"award-number":["61572046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Applied Basic Research (Key Project) of Sichuan Province","award":["2017JY0096"],"award-info":[{"award-number":["2017JY0096"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0157-6","type":"journal-article","created":{"date-parts":[[2017,7,16]],"date-time":"2017-07-16T22:49:32Z","timestamp":1500245372000},"page":"75-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Weak {2}-domination number of Cartesian products of cycles"],"prefix":"10.1007","volume":"35","author":[{"given":"Zepeng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zehui","family":"Shao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,17]]},"reference":[{"issue":"17","key":"157_CR1","doi-asserted-by":"crossref","first-page":"2394","DOI":"10.1016\/j.dam.2007.07.018","volume":"155","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar B, \u0160umenjak TK (2007) On the \n                        $$2$$\n                        \n                            \n                                \n                                    2\n                                \n                            \n                        \n                    -rainbow domination in graphs. Discrete Appl Math 155(17):2394\u20132400","journal-title":"Discrete Appl Math"},{"issue":"1","key":"157_CR2","doi-asserted-by":"crossref","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","journal-title":"Taiwan J Math"},{"issue":"2","key":"157_CR3","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00373-015-1585-7","volume":"32","author":"C Bujt\u00e1s","year":"2016","unstructured":"Bujt\u00e1s C, Klav\u017ear S (2016) Improved upper bounds on the domination number of graphs with minimum degree at least five. Graphs Combin 32(2):511\u2013519","journal-title":"Graphs Combin"},{"issue":"3","key":"157_CR4","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1137\/070699688","volume":"23","author":"EW Chambers","year":"2009","unstructured":"Chambers EW, Kinnersley B, Prince N et al (2009) Extremal problems for Roman domination. SIAM J Discrete Math 23(3):1575\u20131586","journal-title":"SIAM J Discrete Math"},{"key":"157_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.dam.2015.11.013","volume":"204","author":"M Chellali","year":"2016","unstructured":"Chellali M, Haynes TW, Hedetniemi ST et al (2016) Roman 2-domination. Discrete Appl Math 204:22\u201328","journal-title":"Discrete Appl Math"},{"key":"157_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne EJ, Dreyer PM Jr, Hedetniemi SM, Hedetniemi ST (2004) Roman domination in graphs. Discrete Math 278:11\u201322","journal-title":"Discrete Math"},{"issue":"10","key":"157_CR7","doi-asserted-by":"crossref","first-page":"3447","DOI":"10.1016\/j.disc.2008.09.043","volume":"309","author":"O Favaron","year":"2009","unstructured":"Favaron O, Karami H, Khoeilar R et al (2009) On the Roman domination number of a graph. Discrete Math 309(10):3447\u20133451","journal-title":"Discrete Math"},{"issue":"1","key":"157_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10027","volume":"40","author":"W Goddard","year":"2002","unstructured":"Goddard W, Henning MA (2002) Domination in planar graphs with small diameter. J Graph Theory 40(1):1\u201325","journal-title":"J Graph Theory"},{"key":"157_CR9","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"157_CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.dam.2015.06.024","volume":"198","author":"ZP Li","year":"2016","unstructured":"Li ZP, Zhu EQ, Shao ZH, Xu J (2016) On dominating sets of maximal outerplanar and planar graphs. Discrete Appl Math 198:164\u2013169","journal-title":"Discrete Appl Math"},{"issue":"18","key":"157_CR11","doi-asserted-by":"crossref","first-page":"3400","DOI":"10.1016\/j.dam.2008.01.011","volume":"156","author":"M Liedloff","year":"2008","unstructured":"Liedloff M, Kloks T, Liu J et al (2008) Efficient algorithms for Roman domination on some classes of graphs. Discrete Appl Math 156(18):3400\u20133415","journal-title":"Discrete Appl Math"},{"key":"157_CR12","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1006\/eujc.1996.0048","volume":"17","author":"LR Matheson","year":"1996","unstructured":"Matheson LR, Tarjan RE (1996) Dominating sets in planar graphs. Eur J Combin 17:565\u2013568","journal-title":"Eur J Combin"},{"key":"157_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.ins.2013.07.020","volume":"254","author":"ZH Shao","year":"2014","unstructured":"Shao ZH, Liang MN, Yin C et al (2014) On rainbow domination numbers of graphs. Inf Sci 254:225\u2013234","journal-title":"Inf Sci"},{"key":"157_CR14","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/s10878-012-9582-8","volume":"28","author":"Z St\u0229pie\u0144","year":"2014","unstructured":"St\u0229pie\u0144 Z, Zwierzchowski M (2014) 2-Rainbow domination number of Cartesian products: \n                        $$C_n\\Box C_3$$\n                        \n                            \n                                \n                                    \n                                        C\n                                        n\n                                    \n                                    \u25a1\n                                    \n                                        C\n                                        3\n                                    \n                                \n                            \n                        \n                     and \n                        $$C_n\\Box C_5$$\n                        \n                            \n                                \n                                    \n                                        C\n                                        n\n                                    \n                                    \u25a1\n                                    \n                                        C\n                                        5\n                                    \n                                \n                            \n                        \n                    . J Combin Optim 28:748\u2013755","journal-title":"J Combin Optim"},{"key":"157_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.dam.2014.01.027","volume":"170","author":"Z St\u0229pie\u0144","year":"2014","unstructured":"St\u0229pie\u0144 Z, Szymaszkiewicz A, Szymaszkiewicz L, Zwierzchowski M (2014) 2-Rainbow domination number of \n                        $$C_n\\Box C_5$$\n                        \n                            \n                                \n                                    \n                                        C\n                                        n\n                                    \n                                    \u25a1\n                                    \n                                        C\n                                        5\n                                    \n                                \n                            \n                        \n                    . Discrete Appl Math 170:113\u2013116","journal-title":"Discrete Appl Math"},{"issue":"3","key":"157_CR16","doi-asserted-by":"crossref","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 \n                        $$2$$\n                        \n                            \n                                \n                                    2\n                                \n                            \n                        \n                    -rainbow domination number. J Combin Optim 30(3):668\u2013674","journal-title":"J Combin Optim"},{"key":"157_CR17","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2013.02.031","volume":"161","author":"YL Wang","year":"2013","unstructured":"Wang YL, Wu KH (2013) A tight upper bound for \n                        $$2$$\n                        \n                            \n                                \n                                    2\n                                \n                            \n                        \n                    -rainbow domination in generalized Petersen graphs. Discrete Appl Math 161:2178\u20132188","journal-title":"Discrete Appl Math"},{"issue":"4","key":"157_CR18","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s00373-012-1158-y","volume":"29","author":"Y Wu","year":"2010","unstructured":"Wu Y, Rad NJ (2010) Bounds on the \n                        $$2$$\n                        \n                            \n                                \n                                    2\n                                \n                            \n                        \n                    -rainbow domination number of graphs. Graphs Combin 29(4):1125\u20131133","journal-title":"Graphs Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0157-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0157-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0157-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T10:33:39Z","timestamp":1515407619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0157-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,17]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["157"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0157-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,17]]}}}