{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:41:17Z","timestamp":1773513677175,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,30]],"date-time":"2016-03-30T00:00:00Z","timestamp":1459296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007225","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","award":["NSC101-2115-M-002-005-MY3"],"award-info":[{"award-number":["NSC101-2115-M-002-005-MY3"]}],"id":[{"id":"10.13039\/100007225","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-016-1695-x","type":"journal-article","created":{"date-parts":[[2016,3,30]],"date-time":"2016-03-30T04:13:57Z","timestamp":1459311237000},"page":"1731-1747","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Edge Roman Domination on Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Hua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Hung","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,30]]},"reference":[{"key":"1695_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"H Abdollahzadeh Ahangar","year":"2014","unstructured":"Abdollahzadeh Ahangar, H., Henning, M.A., L\u00f6wenstein, C., Zhao, Y., Samodivkin, V.: Signed Roman domination in graphs. J. Comb. Optim. 27, 241\u2013255 (2014)","journal-title":"J. Comb. Optim."},{"key":"1695_CR2","unstructured":"Akbari, S., Ehsani, S., Ghajar, S., Jalaly Khalilabadi, P., Sadeghian Sadeghabad, S.: On the edge Roman domination in graphs (manuscript)"},{"key":"1695_CR3","unstructured":"Akbari, S., Qajar, S.: On the edge roman domination number of planar graphs (manuscript)"},{"key":"1695_CR4","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s00373-014-1415-3","volume":"31","author":"M Atapour","year":"2015","unstructured":"Atapour, M., Sheikholeslami, S.M., Volkmann, L.: Global Roman domination in trees. Graphs Combin. 31, 813\u2013825 (2015)","journal-title":"Graphs Combin."},{"key":"1695_CR5","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1137\/070699688","volume":"23","author":"EW Chambers","year":"2009","unstructured":"Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for Roman domination. SIAM J. Discrete Math. 23, 1575\u20131586 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1695_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/080733085","volume":"26","author":"GJ Chang","year":"2012","unstructured":"Chang, G.J., Liu, C.-H.: Roman domination on $$2$$ 2 -connected graphs. SIAM J. Discrete Math. 26, 193\u2013205 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"1695_CR7","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"GJ Chang","year":"2013","unstructured":"Chang, G.J., Liu, C.-H.: Roman domination on strongly chordal graphs. J. Comb. Optim. 26, 608\u2013619 (2013)","journal-title":"J. Comb. Optim."},{"key":"1695_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jctb.1994.1019","volume":"60","author":"G Chen","year":"1994","unstructured":"Chen, G., Saito, A.: Graphs with a cycle of length divisible by three. J. Combin. Theory Ser. B 60, 277\u2013292 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1695_CR9","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1016\/j.dam.2008.10.011","volume":"157","author":"A Hansberg","year":"2009","unstructured":"Hansberg, A., Volkmann, L.: Upper bounds on the $$k$$ k -domination number and the $$k$$ k -Roman domination number. Discrete Appl. Math. 157, 1634\u20131639 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1695_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math. (in French) 15, 271\u2013283 (1930)","journal-title":"Fund. Math. (in French)"},{"key":"1695_CR11","first-page":"175","volume":"69","author":"P Roushini Leely Pushpam","year":"2009","unstructured":"Roushini Leely Pushpam, P., Malini Mai, T.N.M.: Edge Roman domination in graphs. J. Combin. Math. Combin. Comput 69, 175\u2013182 (2009)","journal-title":"J. Combin. Math. Combin. Comput"},{"issue":"2","key":"1695_CR12","first-page":"40","volume":"49","author":"CS ReVelle","year":"1997","unstructured":"ReVelle, C.S.: Can you protect the Roman Empire? Johns Hopkins Magazine 49(2), 40 (1997)","journal-title":"Johns Hopkins Magazine"},{"issue":"3","key":"1695_CR13","first-page":"70","volume":"49","author":"CS ReVelle","year":"1997","unstructured":"ReVelle, C.S.: Test your solution to can you protect the Roman Empire. Johns Hopkins Magazine 49(3), 70 (1997)","journal-title":"Johns Hopkins Magazine"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1695-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1695-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1695-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T23:00:17Z","timestamp":1567724417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1695-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,30]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1695"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1695-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,30]]}}}