{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:08:30Z","timestamp":1746518910479},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:00:00Z","timestamp":1555459200000},"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":[[2019,10]]},"DOI":"10.1007\/s10878-019-00408-y","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T16:41:01Z","timestamp":1555519261000},"page":"712-720","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On perfect Roman domination number in trees: complexity and bounds"],"prefix":"10.1007","volume":"38","author":[{"given":"Mahsa","family":"Darkooti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdollah","family":"Alhevaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadegh","family":"Rahimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadi","family":"Rahbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,17]]},"reference":[{"key":"408_CR1","first-page":"11","volume":"52","author":"M Adabi","year":"2012","unstructured":"Adabi M, Targhi EE, Rad NJ, Moradi MS (2012) Properties of independent Roman domination in graphs. Australas J Combin 52:11\u201318","journal-title":"Australas J Combin"},{"key":"408_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"HA Ahangar","year":"2014","unstructured":"Ahangar HA, Henning MA, L\u00f6wenstein C, Zhao Y, Samodivkin V (2014) Signed Roman domination in graphs. J Comb Optim 27:241\u2013255","journal-title":"J Comb Optim"},{"issue":"2","key":"408_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.2298\/AADM160802017A","volume":"10","author":"HA Ahangar","year":"2016","unstructured":"Ahangar HA, Henning MA, Samodivkin V, Yero IG (2016) Total Roman domination in graphs. Appl Anal Discrete Math 10(2):501\u2013517","journal-title":"Appl Anal Discrete Math"},{"key":"408_CR4","doi-asserted-by":"publisher","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":"408_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2015.11.013","volume":"204","author":"M Chellali","year":"2016","unstructured":"Chellali M, Haynes TW, Hedetniemi ST, McRae AA (2016) Roman 2-domination. Discrete Appl Math 204:22\u201328","journal-title":"Discrete Appl Math"},{"key":"408_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"408_CR7","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, Inc., New York"},{"key":"408_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.dam.2017.10.027","volume":"236","author":"MA Henning","year":"2018","unstructured":"Henning MA, Klostermeyer WF, MacGillivray G (2018) Perfect Roman domination in trees. Discrete Appl Math 236:235\u2013245","journal-title":"Discrete Appl Math"},{"key":"408_CR9","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.4134\/JKMS.2009.46.6.1309","volume":"46","author":"K Kammerling","year":"2009","unstructured":"Kammerling K, Volkmann L (2009) Roman k-domination in graphs. J Korean Math Soc 46:1309\u20131318","journal-title":"J Korean Math Soc"},{"key":"408_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/09720529.2014.914288","volume":"18","author":"W Klostermeyer","year":"2015","unstructured":"Klostermeyer W (2015) A taxonomy of perfect domination. J Discrete Math Sci Cryptogr 18:105\u2013116","journal-title":"J Discrete Math Sci Cryptogr"},{"key":"408_CR11","first-page":"175","volume":"69","author":"PRL Pushpam","year":"2009","unstructured":"Pushpam PRL, Mai TNMN (2009) Edge Roman domination in graphs. J Comb Math Comb Comput 69:175\u2013182","journal-title":"J Comb Math Comb Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00408-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00408-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00408-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T23:23:21Z","timestamp":1586993001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00408-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,17]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["408"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00408-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,17]]},"assertion":[{"value":"17 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}