{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T04:40:59Z","timestamp":1771994459061,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071194"],"award-info":[{"award-number":["12071194"]}],"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":["11571155"],"award-info":[{"award-number":["11571155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10878-021-00735-z","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T07:03:09Z","timestamp":1619074989000},"page":"174-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Roman {k}-domination in trees and complexity results for some classes of graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Cai-Xia","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Juan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-3040","authenticated-orcid":false,"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"issue":"1","key":"735_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth KS, Johnson JH (1982) Dominating sets in chrodal graphs. SIAM J Comput 11(1):191\u2013199","journal-title":"SIAM J Comput"},{"key":"735_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:213\u2013225","journal-title":"Taiwan J Math"},{"key":"735_CR3","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1016\/j.dam.2013.01.024","volume":"161","author":"GJ Chang","year":"2013","unstructured":"Chang GJ, Li B-J, Wu J (2013) Rainbow domination and related problems on strongly chordal graphs. Discrete Appl Math 161:1395\u20131401","journal-title":"Discrete Appl Math"},{"key":"735_CR4","doi-asserted-by":"publisher","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, McRae AA (2016) Roman 2-domination. Discrete Appl Math 204:22\u201328","journal-title":"Discrete Appl Math"},{"issue":"1\u20133","key":"735_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86(1\u20133):165\u2013177","journal-title":"Discrete Math"},{"key":"735_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne EJ, Dreyer PA Jr, Hedetniemi SM, Hedetniemi ST (2004) Roman domination in graphs. Discrete Math 278:11\u201322","journal-title":"Discrete Math"},{"key":"735_CR7","first-page":"371","volume-title":"Proceedings of the sixth quadrennial conference on the theory and applications of graphs, Western Michigan University. Graph theory, combinatorics and applications","author":"GS Domke","year":"1991","unstructured":"Domke GS, Hedetniemi ST, Laskar RC, Fricke G (1991) Relationships between integer and fractional parameters of graphs. In: Alavi Y, Chartrand G, Oellermann O, Schwenk A (eds) Proceedings of the sixth quadrennial conference on the theory and applications of graphs, Western Michigan University. Graph theory, combinatorics and applications, vol 1. Wiley, New York, pp 371\u2013387"},{"key":"735_CR8","unstructured":"Fink JF, Jacobson MS (1985) $$n$$-domination in graphs. In: Graph theory with applications to algorithms and computer science (Kalamazoo, Michigan, 1984). Wiley, New York, pp 283\u2013300"},{"key":"735_CR9","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker Inc, New York"},{"key":"735_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.7151\/dmgt.1178","volume":"22","author":"MA Henning","year":"2002","unstructured":"Henning MA (2002) A charaterization of Roman trees. Discuss Math Graph Theory 22:325\u2013334","journal-title":"Discuss Math Graph Theory"},{"key":"735_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.dam.2016.09.035","volume":"217","author":"MA Henning","year":"2017","unstructured":"Henning MA, Klostermeyer WF (2017) Italian domination in trees. Discrete Appl Math 217:557\u2013564","journal-title":"Discrete Appl Math"},{"key":"735_CR12","first-page":"121","volume-title":"Topics in theoretical computer science-TTCS 2015. Lecture notes in computer science","author":"W-K Hon","year":"2016","unstructured":"Hon W-K, Kloks T, Liu H-H, Wang H-L (2016) Rainbow domination and related problems on some classes of perfect graphs. In: Hajiaghayi M, Mousavi M (eds) Topics in theoretical computer science-TTCS 2015. Lecture notes in computer science, vol 9541. Springer, Cham, pp 121\u2013134"},{"key":"735_CR13","first-page":"125","volume":"108","author":"WF Klostermeyer","year":"2019","unstructured":"Klostermeyer WF, MacGillivray G (2019) Roman, Italian, and 2-domination. J Combin Math Combin Comput 108:125\u2013146","journal-title":"J Combin Math Combin Comput"},{"key":"735_CR14","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"C-H Liu","year":"2013","unstructured":"Liu C-H, Chang GJ (2013) Roman domination on strongly chordal graphs. J Comb Optim 26:608\u2013619","journal-title":"J Comb Optim"},{"key":"735_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller H, Brandst\u00e4dt A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theor Comput Sci 53:257\u2013265","journal-title":"Theor Comput Sci"},{"key":"735_CR16","unstructured":"Schnupp M (2006) Broadcast domination with flexible powers. Diplomarbeit, University of Jena, Germany"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00735-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00735-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00735-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T05:11:03Z","timestamp":1626066663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00735-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["735"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00735-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]},"assertion":[{"value":"7 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}