{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:17:01Z","timestamp":1774383421040,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministerio de Econom\u00eda y Competitividad, Agencia Estatal de Investigaci\u00f3n","award":["MTM2016-78227-C2-1-P"],"award-info":[{"award-number":["MTM2016-78227-C2-1-P"]}]},{"DOI":"10.13039\/501100008530","name":"Fondo Europeo de Desarrollo Regional","doi-asserted-by":"crossref","award":["MTM2017-90584-REDT"],"award-info":[{"award-number":["MTM2017-90584-REDT"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10878-020-00679-w","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T11:04:21Z","timestamp":1610017461000},"page":"401-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure domination in rooted product graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Rangel","family":"Hern\u00e1ndez-Ortiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3101-6518","authenticated-orcid":false,"given":"Luis Pedro","family":"Montejano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Alberto","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"679_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.dam.2019.02.043","volume":"262","author":"T Araki","year":"2019","unstructured":"Araki T, Yamanaka R (2019) Secure domination in cographs. Discrete Appl Math 262:179\u2013184","journal-title":"Discrete Appl Math"},{"key":"679_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.10.020","volume":"236","author":"T Araki","year":"2018","unstructured":"Araki T, Yumoto I (2018) On the secure domination numbers of maximal outerplanar graphs. Discrete Appl Math 236:23\u201329","journal-title":"Discrete Appl Math"},{"issue":"10","key":"679_CR3","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ipl.2015.05.006","volume":"115","author":"H Boumediene Merouane","year":"2015","unstructured":"Boumediene Merouane H, Chellali M (2015) On secure domination in graphs. Inform Process Lett 115(10):786\u2013790","journal-title":"Inform Process Lett"},{"issue":"2","key":"679_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2989\/QM.2008.31.2.5.477","volume":"31","author":"AP Burger","year":"2008","unstructured":"Burger AP, Henning MA, van Vuuren JH (2008) Vertex covers and secure domination in graphs. Quaest Math 31(2):163\u2013171","journal-title":"Quaest Math"},{"key":"679_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.disc.2006.05.037","volume":"307","author":"EJ Cockayne","year":"2007","unstructured":"Cockayne EJ (2007) Irredundance, secure domination and maximum degree in trees. Discrete Math 307:12\u201317","journal-title":"Discrete Math"},{"key":"679_CR6","first-page":"87","volume":"39","author":"EJ Cockayne","year":"2003","unstructured":"Cockayne EJ, Favaron O, Mynhardt CM (2003) Secure domination, weak Roman domination and forbidden subgraphs. Bull Inst Combin Appl 39:87\u2013100","journal-title":"Bull Inst Combin Appl"},{"key":"679_CR7","first-page":"19","volume":"67","author":"EJ Cockayne","year":"2005","unstructured":"Cockayne EJ, Grobler PJP, Gr\u00fcndlingh WR, Munganga J, van Vuuren JH (2005) Protection of a graph. Util Math 67:19\u201332","journal-title":"Util Math"},{"key":"679_CR8","volume-title":"Domination in graphs: volume 2 advanced topics. CRC pure and applied mathematics","author":"T Haynes","year":"1998","unstructured":"Haynes T, Hedetniemi S, Slater P (1998) Domination in graphs: volume 2 advanced topics. CRC pure and applied mathematics. Taylor & Francis, Baco Raton"},{"key":"679_CR9","volume-title":"Fundamentals of domination in graphs, Chapman and Hall\/CRC pure and applied mathematics series","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs, Chapman and Hall\/CRC pure and applied mathematics series. Marcel Dekker, Inc., New York"},{"key":"679_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2019.01.005","volume":"145","author":"A Jha","year":"2019","unstructured":"Jha A, Pradhan D, Banerjee S (2019) The secure domination problem in cographs. Inform Process Lett 145:30\u201338","journal-title":"Inform Process Lett"},{"issue":"2","key":"679_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.7151\/dmgt.1405","volume":"28","author":"WF Klostermeyer","year":"2008","unstructured":"Klostermeyer WF, Mynhardt CM (2008) Secure domination and secure total domination in graphs. Discuss Math Graph Theory 28(2):267\u2013284","journal-title":"Discuss Math Graph Theory"},{"issue":"1","key":"679_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2989\/16073606.2016.1259188","volume":"40","author":"Z Li","year":"2017","unstructured":"Li Z, Shao Z, Xu J (2017) On secure domination in trees. Quaest Math 40(1):1\u201312","journal-title":"Quaest Math"},{"issue":"2","key":"679_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10878-017-0197-y","volume":"35","author":"D Pradhan","year":"2018","unstructured":"Pradhan D, Jha A (2018) On computing a minimum secure dominating set in block graphs. J Combin Optim 35(2):613\u2013631","journal-title":"J Combin Optim"},{"issue":"1","key":"679_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2298\/FIL1901319V","volume":"33","author":"M Valveny","year":"2019","unstructured":"Valveny M, Rodr\u00edguez-Vel\u00e1zquez JA (2019) Protection of graphs with emphasis on cartesian product graphs. Filomat 33(1):319\u2013333","journal-title":"Filomat"},{"key":"679_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.dam.2019.01.012","volume":"260","author":"Y Zou","year":"2019","unstructured":"Zou Y, Liu J, Hsu C, Wang YL (2019) A simple algorithm for secure domination in proper interval graphs. Discrete Appl Math 260:289\u2013293","journal-title":"Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00679-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00679-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00679-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T07:28:46Z","timestamp":1612510126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00679-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["679"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00679-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"9 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}