{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:10:54Z","timestamp":1767183054751,"version":"3.40.5"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:00:00Z","timestamp":1640908800000},"content-version":"vor","delay-in-days":1491,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"The National Key Research and Development Program","award":["2017YFB0802303"],"award-info":[{"award-number":["2017YFB0802303"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61127005","61309015"],"award-info":[{"award-number":["61127005","61309015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2014M560851"],"award-info":[{"award-number":["2014M560851"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Applied Basic Research (Key Project) of Sichuan Province","award":["2017JY0095"],"award-info":[{"award-number":["2017JY0095"]}]},{"name":"973 Program of China","award":["2013CB329600"],"award-info":[{"award-number":["2013CB329600"]}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"publisher","award":["P1-0297","N1-0043"],"award-info":[{"award-number":["P1-0297","N1-0043"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1016\/j.dam.2017.07.026","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T20:15:16Z","timestamp":1504124116000},"page":"175-186","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["On the signed Roman <mml:math xmlns:mml=\"https:\/\/linproxy.fan.workers.dev:443\/http\/www.w3.org\/1998\/Math\/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si4.gif\"><mml:mi>k<\/mml:mi><\/mml:math>-domination: Complexity and thin torus graphs"],"prefix":"10.1016","volume":"233","author":[{"given":"Zehui","family":"Shao","sequence":"first","affiliation":[]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[]},{"given":"Zepeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Pu","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2017.07.026_b1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","article-title":"Signed Roman domination in graphs","volume":"27","author":"Ahangar","year":"2014","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2017.07.026_b2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2016.03.004","article-title":"Strong equality of Roman and weak Roman domination in trees","volume":"208","author":"Alvarado","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2017.07.026_b3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.7151\/dmgt.1912","article-title":"Signed Roman edge k-domination in graphs","volume":"37","author":"Asgharsharghi","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"10.1016\/j.dam.2017.07.026_b4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2298\/AADM140210003B","article-title":"The differential and the Roman domination number of a graph","volume":"8","author":"Bermudo","year":"2014","journal-title":"Appl. Anal. Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2017.07.026_b5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","article-title":"Colorings of plane graphs: A survey","volume":"313","author":"Borodin","year":"2013","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2017.07.026_b6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2298\/AADM151112023C","article-title":"Lower bounds on the Roman and independent Roman domination numbers","volume":"10","author":"Chellali","year":"2016","journal-title":"Appl. Anal. Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2017.07.026_b7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","article-title":"Roman domination in graphs","volume":"278","author":"Cockayne","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.07.026_b8","series-title":"Graph Theory, Combinatorics, and Algorithms, vol. 1","first-page":"311","article-title":"Signed domination in graphs","author":"Dunbar","year":"1995"},{"key":"10.1016\/j.dam.2017.07.026_b10","series-title":"Handbook of Product Graphs","first-page":"xviii+518","author":"Hammack","year":"2011"},{"key":"10.1016\/j.dam.2017.07.026_b11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.dam.2015.01.019","article-title":"Signed Roman k-domination in trees","volume":"186","author":"Henning","year":"2015","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2017.07.026_b12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00373-015-1536-3","article-title":"Signed roman k-domination in graphs","volume":"32","author":"Henning","year":"2016","journal-title":"Graphs Combin."},{"issue":"18","key":"10.1016\/j.dam.2017.07.026_b13","doi-asserted-by":"crossref","first-page":"3400","DOI":"10.1016\/j.dam.2008.01.011","article-title":"Efficient algorithms for Roman domination on some classes of graphs","volume":"156","author":"Liedloff","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2017.07.026_b14","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","article-title":"Roman domination on strongly chordal graphs","volume":"26","author":"Liu","year":"2013","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.dam.2017.07.026_b15","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s10878-013-9648-2","article-title":"Signed Roman domination in digraphs","volume":"30","author":"Sheikholeslami","year":"2015","journal-title":"J. Comb. Optim."},{"issue":"6","key":"10.1016\/j.dam.2017.07.026_b16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","article-title":"Defend the Roman empire!","volume":"281","author":"Stewart","year":"1999","journal-title":"Sci. Amer."},{"issue":"3","key":"10.1016\/j.dam.2017.07.026_b17","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1007\/s00373-015-1641-3","article-title":"Signed Roman k-domination in digraphs","volume":"32","author":"Volkmann","year":"2016","journal-title":"Graphs Combin."},{"issue":"1","key":"10.1016\/j.dam.2017.07.026_b18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.7151\/dmgt.1929","article-title":"Signed total Roman domination in digraphs","volume":"37","author":"Volkmann","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2017.07.026_b19","first-page":"319","article-title":"Signed domination in Kronecker product of two complete graphs","volume":"91","author":"Zhao","year":"2013","journal-title":"Util. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X17303487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X17303487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T11:27:04Z","timestamp":1641468424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17303487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":18,"alternative-id":["S0166218X17303487"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2017.07.026","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the signed Roman -domination: Complexity and thin torus graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2017.07.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}