{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:40:00Z","timestamp":1784774400748,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T00:00:00Z","timestamp":1334016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10878-012-9482-y","type":"journal-article","created":{"date-parts":[[2012,4,9]],"date-time":"2012-04-09T16:15:26Z","timestamp":1333988126000},"page":"608-619","source":"Crossref","is-referenced-by-count":81,"title":["Roman domination on strongly chordal graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Chun-Hung","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,4,10]]},"reference":[{"key":"9482_CR1","first-page":"159","volume":"49","author":"AP Burger","year":"2004","unstructured":"Burger AP, Cockayne EJ, Grundlingh WR, Mynhardt CM, van Vuuren JH, Winterbach W (2004) Finite order domination in graphs. J Comb Math Comb Comput 49:159\u2013175","journal-title":"J Comb Math Comb Comput"},{"key":"9482_CR2","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, West DB (2009) Extremal problems for Roman domination. SIAM J Discrete Math 23:1575\u20131586","journal-title":"SIAM J Discrete Math"},{"key":"9482_CR3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.dam.2003.05.004","volume":"143","author":"GJ Chang","year":"2004","unstructured":"Chang GJ (2004) The weighted independent domination problem is NP-complete for chordal graphs. Discrete Appl Math 143:351\u2013352","journal-title":"Discrete Appl Math"},{"key":"9482_CR4","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"GJ Chang","year":"1984","unstructured":"Chang GJ, Nemhauser GL (1984) The k-domination and k-stability problems on sun-free chordal graphs. SIAM J Algebr Discrete Methods 5:332\u2013345","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"9482_CR5","first-page":"87","volume":"39","author":"EJ Cockayne","year":"2003","unstructured":"Cockayne EJ, Favaron O, Mynhardt CM (2003) Secure domination, weak Roman domination and forbidden subgraphs. Bull Inst Comb Appl 39:87\u2013100","journal-title":"Bull Inst Comb Appl"},{"key":"9482_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 PA Jr, Hedetniemi SM, Hedetniemi ST (2004) Roman domination in graphs. Discrete Math 278:11\u201322","journal-title":"Discrete Math"},{"key":"9482_CR7","first-page":"19","volume":"67","author":"EJ Cockayne","year":"2005","unstructured":"Cockayne EJ, Grobler PJP, Gr\u00fcndlingh W, Munganga J, van Vuuren JH (2005) Protection of a graph. Util Math 67:19\u201332","journal-title":"Util Math"},{"key":"9482_CR8","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M Farber","year":"1982","unstructured":"Farber M (1982) Independent domination in chordal graphs. Oper Res Lett 1:134\u2013138","journal-title":"Oper Res Lett"},{"key":"9482_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber M (1984) Domination, independent domination and duality in strongly chordal graphs. Discrete Appl Math 7:115\u2013130","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9482_CR10","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(1):25\u201338","journal-title":"Int J Comput Math"},{"key":"9482_CR11","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, San Francisco"},{"key":"9482_CR12","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC (2004) Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier, Amsterdam","edition":"2"},{"key":"9482_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","volume":"266","author":"ST Hedetniemi","year":"2003","unstructured":"Hedetniemi ST, Henning MA (2003) Defending the Roman Empire\u2014a new strategy. Discrete Math 266:239\u2013251","journal-title":"Discrete Math"},{"issue":"2","key":"9482_CR14","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":"9482_CR15","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":"9482_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/080733085","volume":"26","author":"C-H Liu","year":"2012","unstructured":"Liu C-H, Chang GJ (2012a) Roman domination on 2-connected graphs. SIAM J Discrete Math 26:193\u2013205","journal-title":"SIAM J Discrete Math"},{"key":"9482_CR17","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1016\/j.disc.2011.12.021","volume":"312","author":"C-H Liu","year":"2012","unstructured":"Liu C-H, Chang GJ (2012b) Upper bounds on Roman domination numbers of graphs. Discrete Math 312:1386\u20131391","journal-title":"Discrete Math"},{"key":"9482_CR18","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, Peng S-L (2008) Efficient algorithms for Roman domination on some classes of graphs. Discrete Appl Math 156:3400\u20133415","journal-title":"Discrete Appl Math"},{"key":"9482_CR19","unstructured":"Prince N (2006) Thresholds for Roman domination, Manuscript"},{"issue":"2","key":"9482_CR20","first-page":"40","volume":"49","author":"CS ReVelle","year":"1997","unstructured":"ReVelle CS (1997a) Can you protect the Roman Empire? Johns Hopkins Mag 49(2):40","journal-title":"Johns Hopkins Mag"},{"issue":"3","key":"9482_CR21","first-page":"70","volume":"49","author":"CS ReVelle","year":"1997","unstructured":"ReVelle CS (1997b) Test your solution to \u201cCan you protect the Roman Empire\u201d. Johns Hopkins Mag 49(3):70","journal-title":"Johns Hopkins Mag"},{"issue":"7","key":"9482_CR22","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. Am Math Mon 107(7):585\u2013594","journal-title":"Am Math Mon"},{"issue":"6","key":"9482_CR23","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I Stewart","year":"1999","unstructured":"Stewart I (1999) Defend the Roman Empire! Sci Am 281(6):136\u2013139","journal-title":"Sci Am"},{"issue":"3","key":"9482_CR24","first-page":"358","volume":"21","author":"X-X Song","year":"2006","unstructured":"Song X-X, Wang X-F (2006) Roman domination number and domination number of a tree. Chin Q J Math 21(3):358\u2013367","journal-title":"Chin Q J Math"},{"key":"9482_CR25","doi-asserted-by":"crossref","first-page":"3338","DOI":"10.1016\/j.disc.2006.06.018","volume":"306","author":"H-M Xing","year":"2006","unstructured":"Xing H-M, Chen X, Chen X-G (2006) A note on Roman domination in graphs. Discrete Math 306:3338\u20133340","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9482-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9482-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9482-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:17Z","timestamp":1559262197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9482-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,10]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9482"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9482-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,10]]}}}