{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T15:33:08Z","timestamp":1782055988524,"version":"3.54.5"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T00:00:00Z","timestamp":1446768000000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00373-015-1641-3","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T10:06:41Z","timestamp":1446804401000},"page":"1217-1227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Signed Roman k-domination in Digraphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Lutz","family":"Volkmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"1641_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"HA Ahangar","year":"2014","unstructured":"Ahangar, H.A., 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":"1641_CR2","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.2478\/s11533-010-0077-5","volume":"8","author":"M Atapour","year":"2010","unstructured":"Atapour, M., Hajypory, R., Sheikholeslami, S.M., Volkmann, L.: The signed $$k$$ k -domination number of directed graphs. Cent. Eur. J. Math. 8, 1048\u20131057 (2010)","journal-title":"Cent. Eur. J. Math."},{"key":"1641_CR3","volume-title":"Structural Models, An Introduction to the Theory of Directed Graphs","author":"F Harary","year":"1965","unstructured":"Harary, F., Norman, R.Z., Cartwright, D.: Structural Models, An Introduction to the Theory of Directed Graphs. Wiley, New York (1965)"},{"key":"1641_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York (1998)"},{"key":"1641_CR5","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs, Advanced Topics. Marcel Dekker Inc, New York (1998)"},{"key":"1641_CR6","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Volkmann, L.: Signed Roman $$k$$ k -domination in graphs, Graphs Combin. doi: 10.1007\/s00373-015-1536-3","DOI":"10.1007\/s00373-015-1536-3"},{"key":"1641_CR7","doi-asserted-by":"crossref","first-page":"2567","DOI":"10.1016\/j.disc.2008.04.001","volume":"309","author":"H Karami","year":"2009","unstructured":"Karami, H., Sheikholeslami, S.M., Khodkar, A.: Lower bounds on the signed domination numbers of directed graphs. Discret. Math. 309, 2567\u20132570 (2009)","journal-title":"Discret. Math."},{"key":"1641_CR8","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s10878-013-9648-2","volume":"30","author":"SM Sheikholeslami","year":"2015","unstructured":"Sheikholeslami, S.M., Volkmann, L.: Signed Roman domination in digraphs. J. Comb. Optim. 30, 456\u2013467 (2015). doi: 10.1007\/s10878-013-9648-2","journal-title":"J. Comb. Optim."},{"key":"1641_CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.7151\/dmgt.1555","volume":"31","author":"L Volkmann","year":"2011","unstructured":"Volkmann, L.: Signed domination and signed domatic numbers of digraphs Discuss. Math. Graph Theory 31, 415\u2013427 (2011)","journal-title":"Math. Graph Theory"},{"key":"1641_CR10","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10587-005-0038-5","volume":"55","author":"B Zelinka","year":"2005","unstructured":"Zelinka, B.: Signed domination numbers of directed graphs. Czechoslovak Math. J. 55, 479\u2013482 (2005)","journal-title":"Czechoslovak Math. J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1641-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1641-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1641-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:42Z","timestamp":1559041182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1641-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1641"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1641-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,6]]}}}