{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T05:02:57Z","timestamp":1741496577615,"version":"3.38.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"South African National Research Foundation","award":["129265"],"award-info":[{"award-number":["129265"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s40314-024-03025-6","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T03:34:58Z","timestamp":1733715298000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Paired versus double domination in forbidden graph classes"],"prefix":"10.1007","volume":"44","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[]},{"given":"Paras","family":"Maniya","sequence":"additional","affiliation":[]},{"given":"Dinabandhu","family":"Pradhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"3025_CR1","doi-asserted-by":"publisher","first-page":"1840","DOI":"10.1016\/j.disc.2006.03.061","volume":"306","author":"M Blidia","year":"2006","unstructured":"Blidia M, Chellali M, Haynes TW (2006) Characterizations of trees with equal paired and double domination numbers. Discrete Math 306:1840\u20131845","journal-title":"Discrete Math"},{"key":"3025_CR2","first-page":"159","volume":"70","author":"M Blidia","year":"2006","unstructured":"Blidia M, Chellali M, Haynes TW, Henning MA (2006) Independent and double domination in trees. Util Math 70:159\u2013173","journal-title":"Util Math"},{"key":"3025_CR3","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.dam.2020.03.045","volume":"284","author":"A Cabrera Mart\u00ednez","year":"2020","unstructured":"Cabrera Mart\u00ednez A, Cabrera Garc\u00eda S, Rodr\u00edguez-Vel\u00e1zquez JA (2020) Double domination in lexicographic product graphs. Discrete Appl Math 284:290\u2013300","journal-title":"Discrete Appl Math"},{"key":"3025_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.dam.2021.05.011","volume":"300","author":"A Cabrera Mart\u00ednez","year":"2021","unstructured":"Cabrera Mart\u00ednez A, Cabrera Garc\u00eda S, Rodr\u00edguez-Vel\u00e1zquez JA (2021) A note on double domination in graphs. Discrete Appl Math 300:107\u2013111","journal-title":"Discrete Appl Math"},{"key":"3025_CR5","first-page":"161","volume":"67","author":"M Chellali","year":"2005","unstructured":"Chellali M, Haynes TW (2005) On paired and double domination in graphs. Util Math 67:161\u2013171","journal-title":"Util Math"},{"key":"3025_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-51117-3_3","volume-title":"Topics in Domination in Graphs. Developments in Mathematics","author":"WJ Desormeaux","year":"2020","unstructured":"Desormeaux WJ, Haynes TW, Henning MA (2020) Paired domination in graphs. In: Haynes TW, Hedetniemi ST, Henning MA (eds) Topics in Domination in Graphs. Developments in Mathematics. Springer, Cham, pp 31\u201377"},{"key":"3025_CR7","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s10878-012-9547-y","volume":"27","author":"P Dorbec","year":"2014","unstructured":"Dorbec P, Hartnell B, Henning MA (2014) Paired versus double domination in $$K_{1, r}$$-free graphs. J Comb Optim 27:688\u2013694","journal-title":"J Comb Optim"},{"key":"3025_CR8","doi-asserted-by":"crossref","unstructured":"Hansberg A, Volkmann L (2020) Multiple domination. In Haynes TW, Hedetniemi ST, Henning MA (eds) Topics in Domination in Graphs. Developments in Mathematics, Springer, Cham, pp 151\u2013203","DOI":"10.1007\/978-3-030-51117-3_6"},{"key":"3025_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7151\/dmgt.1256","volume":"25","author":"J Harant","year":"2005","unstructured":"Harant J, Henning MA (2005) On double domination in graphs. Discuss Math Graph Theory 25:29\u201334","journal-title":"Discuss Math Graph Theory"},{"key":"3025_CR10","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary F, Haynes TW (2000) Double domination in graphs. Ars Combin 55:201\u2013213","journal-title":"Ars Combin"},{"key":"3025_CR11","first-page":"65","volume":"109","author":"TW Haynes","year":"1995","unstructured":"Haynes TW, Slater PJ (1995) Paired domination and the paired domatic number. Congr Numer 109:65\u201372","journal-title":"Congr Numer"},{"key":"3025_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Slater PJ (1998) Paired domination in graphs. Networks 32:199\u2013206","journal-title":"Networks"},{"volume-title":"Topics in Domination in Graphs. Developments in Mathematics","year":"2020","key":"3025_CR13","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (eds) (2020) Topics in Domination in Graphs. Developments in Mathematics. Springer, Cham"},{"volume-title":"Structures of Domination in Graphs. Developments in Mathematics","year":"2021","key":"3025_CR14","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (eds) (2021) Structures of Domination in Graphs. Developments in Mathematics. Springer, Cham"},{"volume-title":"Domination in Graphs: Core Concepts, Springer Monographs in Mathematics","year":"2023","key":"3025_CR15","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (eds) (2023) Domination in Graphs: Core Concepts, Springer Monographs in Mathematics. Springer, Cham"},{"key":"3025_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-03857-0","volume-title":"Graph and Network Theory: An Applied Approach using Mathematica. Springer Optimization and its Applications","author":"MA Henning","year":"2022","unstructured":"Henning MA, Van Vuuren JH (2022) Graph and Network Theory: An Applied Approach using Mathematica. Springer Optimization and its Applications. Springer, Cham"},{"key":"3025_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs. Springer Monographs in Mathematics","author":"MA Henning","year":"2013","unstructured":"Henning MA, Yeo A (2013) Total Domination in Graphs. Springer Monographs in Mathematics. Springer, Cham"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03025-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03025-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03025-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T07:58:11Z","timestamp":1741420691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03025-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3025"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03025-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"27 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors do not have any financial or non financial interests that are directly or indirectly related to the work submitted for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"71"}}