{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T15:27:25Z","timestamp":1769182045949,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00373-021-02434-2","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:07:05Z","timestamp":1643710025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Double Roman Domination in Graphs with Minimum Degree at Least Two and No $$C_{5}$$-cycle"],"prefix":"10.1007","volume":"38","author":[{"given":"Saeed","family":"Kosari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zehui","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2298-4744","authenticated-orcid":false,"given":"Seyed Mahmoud","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rana","family":"Khoeilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Karami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"2434_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2017.06.014","volume":"232","author":"H Abdollahzadeh Ahangar","year":"2017","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M.: On the double Roman domination in graphs. Discrete Appl. Math. 232, 1\u20137 (2017)","journal-title":"Discrete Appl. Math."},{"key":"2434_CR2","first-page":"124617","volume":"364","author":"H Abdollahzadeh Ahangar","year":"2020","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M.: Outer independent double Roman domination. Appl. Math. Comput. 364, 124617 (2020)","journal-title":"Appl. Math. Comput."},{"key":"2434_CR3","first-page":"125444","volume":"391","author":"H Abdollahzadeh Ahangar","year":"2021","unstructured":"Abdollahzadeh Ahangar, H., \u00c1lvarez, M.P., Chellali, M., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C.: Triple Roman domination in graphs. Appl. Math. Comput. 391, 125444 (2021)","journal-title":"Appl. Math. Comput."},{"key":"2434_CR4","first-page":"126662","volume":"414","author":"H Abdollahzadeh Ahangar","year":"2022","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C.: Maximal double Roman domination in graphs. Appl. Math. Comput. 414, 126662 (2022)","journal-title":"Appl. Math. Comput."},{"key":"2434_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10878-018-0286-6","volume":"36","author":"J Amjadi","year":"2018","unstructured":"Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M., Volkmann, L.: An upper bound on the double Roman domination number. J. Comb. Optim. 36, 81\u201389 (2018)","journal-title":"J. Comb. Optim."},{"key":"2434_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2016.03.017","volume":"211","author":"RA Beeler","year":"2016","unstructured":"Beeler, R.A., Haynes, T.W., Hedetniemi, S.T.: Double Roman domination. Discrete Appl. Math. 211, 23\u201329 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2434_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-51117-3_11","volume-title":"Topics in Domination in Graph","author":"M Chellali","year":"2020","unstructured":"Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Roman domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Henning, A. (eds.) Topics in Domination in Graph, pp. 365\u2013409. Springer, Berlin (2020)"},{"key":"2434_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-58892-2_10","volume-title":"Structures of Domination in Graphs","author":"M Chellali","year":"2021","unstructured":"Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Varieties of Roman domination. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.) Structures of Domination in Graphs, pp. 273\u2013307. Springer, Berlin (2021)"},{"key":"2434_CR9","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1016\/j.akcej.2019.12.001","volume":"17","author":"M Chellali","year":"2020","unstructured":"Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Varieties of Roman domination II. AKCE Int. J. Graphs Comb. 17, 966\u2013984 (2020)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2434_CR10","first-page":"141","volume":"115","author":"M Chellali","year":"2020","unstructured":"Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: A survey on Roman domination parameters in directed graphs. J. Combin. Math. Combin. Comput. 115, 141\u2013171 (2020)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2434_CR11","unstructured":"Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: The Roman domatic problem in graphs and digraphs: a survey. Discuss. Math. Graph Theory (to appear)"},{"key":"2434_CR12","first-page":"27","volume":"5","author":"G Hao","year":"2020","unstructured":"Hao, G., Volkmann, L., Mojdeh, D.A.: Total double Roman domination in graphs. Commun. Comb. Optim. 5, 27\u201339 (2020)","journal-title":"Commun. Comb. Optim."},{"key":"2434_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7151\/dmgt.2069","volume":"39","author":"N Jafari Rad","year":"2019","unstructured":"Jafari Rad, N., Rahbani, H.: Some progress on the double Roman domination in graphs. Discuss. Math. Graph Theory 39, 41\u201353 (2019)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2434_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2019.06.018","volume":"270","author":"R Khoeilar","year":"2019","unstructured":"Khoeilar, R., Chellali, M., Karami, H., Sheikholeslami, S.M.: An improved upper bound on the double Roman domination number of graphs with minimum degree at least two. Discrete Appl. Math. 270, 159\u2013167 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2434_CR15","unstructured":"Shao, Z., Sheikholeslami, S.M., Chellali, M., Khoeilar, R., Karami, H.: Extremal graphs for an upper bound on the double Roman domination number of graphs with minimum degree at least two (submitted)"},{"key":"2434_CR16","first-page":"71","volume":"3","author":"L Volkmann","year":"2018","unstructured":"Volkmann, L.: Double Roman domination and domatic numbers of graphs. Commun. Comb. Optim. 3, 71\u201377 (2018)","journal-title":"Commun. Comb. Optim."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02434-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02434-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02434-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T14:36:11Z","timestamp":1648046171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02434-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2434"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02434-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"assertion":[{"value":"12 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"39"}}