{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:06:26Z","timestamp":1763726786182},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T00:00:00Z","timestamp":1399939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10878-014-9747-8","type":"journal-article","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T13:20:52Z","timestamp":1399900852000},"page":"333-346","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Signed Roman edge domination numbers in graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"H. Abdollahzadeh","family":"Ahangar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Amjadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,13]]},"reference":[{"key":"9747_CR1","doi-asserted-by":"crossref","unstructured":"Ahangar HA, Henning MA, Zhao Y, L\u00f6wenstein C, Samodivkin V (2014) Signed Roman domination in graphs. J Comb Optim 27:241\u2013255","DOI":"10.1007\/s10878-012-9500-0"},{"key":"9747_CR2","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, New York"},{"key":"9747_CR3","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"9747_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00373-007-0762-8","volume":"24","author":"H Karami","year":"2008","unstructured":"Karami H, Khodkar A, Sheikholeslami SM (2008) Some notes on signed edge domination in graphs. Graphs Comb 24:27\u201332","journal-title":"Graphs Comb"},{"key":"9747_CR5","first-page":"121","volume":"78","author":"H Karami","year":"2009","unstructured":"Karami H, Khodkar A, Sheikholeslami SM (2009) An improved upper bound for signed edge domination numbers in graphs. Util Math 78:121\u2013128","journal-title":"Util Math"},{"key":"9747_CR6","first-page":"451","volume":"93","author":"H Karami","year":"2009","unstructured":"Karami H, Khodkar A, Sheikholeslami SM (2009) Signed edge domination numbers in trees. ARS Comb 93:451\u2013457","journal-title":"ARS Comb"},{"key":"9747_CR7","first-page":"105","volume":"40","author":"SM Sheikholeslami","year":"2012","unstructured":"Sheikholeslami SM, Volkmann L (2012) The signed Roman domatic number of a graph. Ann Math Inform 40:105\u2013112","journal-title":"Ann Math Inform"},{"key":"9747_CR8","doi-asserted-by":"crossref","unstructured":"Sheikholeslami SM, Volkmann L (2014) Signed Roman domination number in digraphs. J Comb Optim. doi: 10.1007\/s10878-013-9648-2","DOI":"10.1007\/s10878-013-9648-2"},{"key":"9747_CR9","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River","edition":"2"},{"key":"9747_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00044-9","volume":"239","author":"B Xu","year":"2001","unstructured":"Xu B (2001) On signed domination numbers of graphs. Discret Math 239:179\u2013189","journal-title":"Discret Math"},{"key":"9747_CR11","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1016\/j.dam.2005.12.007","volume":"154","author":"B Xu","year":"2006","unstructured":"Xu B (2006) Two classes of edge domination in graphs. Discret Appl Math 154:1541\u20131546","journal-title":"Discret Appl Math"},{"key":"9747_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.21136\/MB.2002.133984","volume":"127","author":"B Zelinka","year":"2002","unstructured":"Zelinka B (2002) On signed edge domination numbers of trees. Math Bohem 127:49\u201355","journal-title":"Math Bohem"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9747-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9747-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9747-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T09:02:02Z","timestamp":1597827722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9747-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,13]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9747"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9747-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,13]]}}}