{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:57:09Z","timestamp":1772319429090,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T00:00:00Z","timestamp":1340323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10878-012-9500-0","type":"journal-article","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T22:42:02Z","timestamp":1340318522000},"page":"241-255","source":"Crossref","is-referenced-by-count":62,"title":["Signed Roman domination in graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"H.","family":"Abdollahzadeh Ahangar","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[]},{"given":"Christian","family":"L\u00f6wenstein","sequence":"additional","affiliation":[]},{"given":"Yancai","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Samodivkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,22]]},"reference":[{"key":"9500_CR1","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1137\/070699688","volume":"23","author":"W Chambers","year":"2009","unstructured":"Chambers W, Kinnersley B, Prince N, West DB (2009) Extremal problems for Roman domination. SIAM J Discrete Math 23:1575\u20131586","journal-title":"SIAM J Discrete Math"},{"key":"9500_CR2","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 Jr PA, Hedetniemi SM, Hedetniemi ST (2004) Roman domination in graphs. Discrete Math 278:11\u201322","journal-title":"Discrete Math"},{"key":"9500_CR3","first-page":"19","volume":"67","author":"EJ Cockayne","year":"2005","unstructured":"Cockayne EJ, Grobler PJP, Grundlingh W, Munganga J, van Vuuren JH (2005) Protection of a graph. Util Math 67:19\u201332","journal-title":"Util Math"},{"key":"9500_CR4","first-page":"311","volume":"1","author":"J Dunbar","year":"1995","unstructured":"Dunbar J, Hedetniemi ST, Henning MA, Slater PJ (1995) Signed domination in graphs. Graph Theory Comb Appl 1:311\u2013322","journal-title":"Graph Theory Comb Appl"},{"key":"9500_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0012-365X(96)00026-X","volume":"158","author":"O Favaron","year":"1996","unstructured":"Favaron O (1996) Signed domination in regular graphs. Discrete Math 158:287\u2013293","journal-title":"Discrete Math"},{"key":"9500_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00207160701374376","volume":"85","author":"H Fernau","year":"2008","unstructured":"Fernau H (2008) Roman domination: a parameterized perspective. Int J Comput Math 85:25\u201338","journal-title":"Int J Comput Math"},{"key":"9500_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1006\/jctb.1999.1905","volume":"76","author":"Z Furedi","year":"1999","unstructured":"Furedi Z, Mubayi D (1999) Signed domination in regular graphs and set-systems. J Comb Theory, Ser B 76:223\u2013239","journal-title":"J Comb Theory, Ser B"},{"key":"9500_CR8","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. Dekker, New York"},{"key":"9500_CR9","first-page":"31","volume-title":"Domination in graphs: vol\u00a0II","author":"MA Henning","year":"1998","unstructured":"Henning MA (1998) Dominating functions in graphs. In: Haynes TW, Hedetniemi ST, Slater PJ (eds) Domination in graphs: vol\u00a0II. Dekker, New York, pp 31\u201362"},{"issue":"2","key":"9500_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.7151\/dmgt.1178","volume":"22","author":"MA Henning","year":"2002","unstructured":"Henning MA (2002) A characterization of Roman trees. Discuss Math, Graph Theory 22(2):325\u2013334","journal-title":"Discuss Math, Graph Theory"},{"key":"9500_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(03)00040-2","volume":"271","author":"MA Henning","year":"2003","unstructured":"Henning MA (2003) Defending the Roman empire from multiple attacks. Discrete Math 271:101\u2013115","journal-title":"Discrete Math"},{"key":"9500_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","volume":"266","author":"MA Henning","year":"2003","unstructured":"Henning MA, Hedetniemi ST (2003) Defending the Roman empire\u2013a new strategy. Discrete Math 266:239\u2013251","journal-title":"Discrete Math"},{"issue":"2","key":"9500_CR13","first-page":"40","volume":"49","author":"CS ReVelle","year":"1997","unstructured":"ReVelle CS (1997) Can you protect the Roman empire? Johns Hopkins Mag 49(2):40","journal-title":"Johns Hopkins Mag"},{"issue":"7","key":"9500_CR14","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/2589113","volume":"107","author":"CS ReVelle","year":"2000","unstructured":"ReVelle CS, Rosing KE (2000) Defendens imperium Romanum: a classical problem in military strategy. Am Math Mon 107(7):585\u2013594","journal-title":"Am Math Mon"},{"key":"9500_CR15","first-page":"358","volume":"21","author":"X Song","year":"2006","unstructured":"Song X, Wang X (2006) Roman domination number and domination number of a tree. Chin Q J Math 21:358\u2013367","journal-title":"Chin Q J Math"},{"key":"9500_CR16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"December","author":"I Stewart","year":"1999","unstructured":"Stewart I (1999) Defend the Roman empire! Sci Am December:136\u2013138","journal-title":"Sci Am"},{"key":"9500_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(98)00189-7","volume":"195","author":"Z Zhang","year":"1999","unstructured":"Zhang Z, Xu B, Li Y, Liu L (1999) A note on the lower bounds of signed domination number of a graph. Discrete Math 195:295\u2013298","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9500-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10878-012-9500-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9500-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:18Z","timestamp":1559276598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10878-012-9500-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,22]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9500"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10878-012-9500-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,22]]}}}