{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:18Z","timestamp":1740122478300,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T00:00:00Z","timestamp":1611014400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T00:00:00Z","timestamp":1611014400000},"content-version":"vor","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":[[2021,2]]},"DOI":"10.1007\/s10878-020-00687-w","type":"journal-article","created":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T20:04:16Z","timestamp":1611086656000},"page":"451-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the semipaired domination number of graphs with minimum degree at least two"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0865-0871","authenticated-orcid":false,"given":"Teresa W.","family":"Haynes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,19]]},"reference":[{"key":"687_CR1","first-page":"101","volume":"94","author":"WJ Desormeaux","year":"2014","unstructured":"Desormeaux WJ, Henning MA (2014) Paired domination in graphs: a survey and recent results. Util. Math. 94:101\u2013166","journal-title":"Util. Math."},{"key":"687_CR2","first-page":"67","volume":"94","author":"W Goddard","year":"2014","unstructured":"Goddard W, Henning MA, McPillan CA (2014) Semitotal domination in graphs. Util. Math. 94:67\u201381","journal-title":"Util. Math."},{"key":"687_CR3","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","key":"687_CR4","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York"},{"key":"687_CR5","first-page":"93","volume":"104","author":"TW Haynes","year":"2018","unstructured":"Haynes TW, Henning MA (2018a) Semipaired domination in graphs. J. Combin. Comput. Combin. Math. 104:93\u2013109","journal-title":"J. Combin. Comput. Combin. Math."},{"issue":"2","key":"687_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s10878-018-0303-9","volume":"36","author":"TW Haynes","year":"2018","unstructured":"Haynes TW, Henning MA (2018b) Perfect graphs involving semitotal and semipaired domination. J. Combin. Optim. 36(2):416\u2013433","journal-title":"J. Combin. Optim."},{"key":"687_CR7","doi-asserted-by":"publisher","first-page":"659","DOI":"10.7151\/dmgt.2143","volume":"39","author":"TW Haynes","year":"2019","unstructured":"Haynes TW, Henning MA (2019) Graphs with large semipaired domination number. Discuss. Math. Graph Theory 39:659\u2013671","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"687_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s00373-020-02145-0","volume":"36","author":"TW Haynes","year":"2020","unstructured":"Haynes TW, Henning MA (2020) Trees with unique minimum semitotal dominating sets. Graphs Combin. 36(3):689\u2013702","journal-title":"Graphs Combin."},{"key":"687_CR9","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."},{"issue":"3","key":"687_CR10","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(3):199\u2013206","journal-title":"Networks"},{"issue":"1","key":"687_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10878-006-9014-8","volume":"13","author":"MA Henning","year":"2007","unstructured":"Henning MA (2007) Graphs with large paired-domination number. J. Combin. Optim. 13(1):61\u201378","journal-title":"J. Combin. Optim."},{"key":"687_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00373-017-1769-4","volume":"33","author":"MA Henning","year":"2017","unstructured":"Henning MA (2017) Edge weighting functions on semitotal dominating sets. Graphs Combin. 33:403\u2013417","journal-title":"Graphs Combin."},{"key":"687_CR13","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s00373-018-1916-6","volume":"34","author":"MA Henning","year":"2018","unstructured":"Henning MA, Kaemawichanurat P (2018) Semipaired domination in claw-free cubic graphs. Graphs Combin. 34:819\u2013844","journal-title":"Graphs Combin."},{"issue":"3","key":"687_CR14","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10878-019-00427-9","volume":"38","author":"MA Henning","year":"2019","unstructured":"Henning MA, Kaemawichanurat P (2019) Semipaired domination in maximal outerplanar graphs. J. Comb. Optim. 38(3):911\u2013926","journal-title":"J. Comb. Optim."},{"key":"687_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.disc.2014.01.021","volume":"324","author":"MA Henning","year":"2014","unstructured":"Henning MA, Marcon AJ (2014) On matching and semitotal domination in graphs. Discrete Math. 324:13\u201318","journal-title":"Discrete Math."},{"issue":"1","key":"687_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.7151\/dmgt.1844","volume":"36","author":"MA Henning","year":"2016","unstructured":"Henning MA, Marcon AJ (2016) Vertices contained in all or in no minimum semitotal dominating set of a tree. Discuss. Math. Graph Theory 36(1):71\u201393","journal-title":"Discuss. Math. Graph Theory"},{"issue":"4","key":"687_CR17","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00026-016-0331-z","volume":"20","author":"MA Henning","year":"2016","unstructured":"Henning MA, Marcon AJ (2016) Semitotal domination in claw-free cubic graphs. Ann. Combin. 20(4):799\u2013813","journal-title":"Ann. Combin."},{"key":"687_CR18","first-page":"165","volume":"106","author":"MA Henning","year":"2018","unstructured":"Henning MA, Marcon AJ (2018) Semitotal domination in graphs: partition and algorithmic results. Util. Math. 106:165\u2013184","journal-title":"Util. Math."},{"key":"687_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2018.09.019","volume":"766","author":"MA Henning","year":"2019","unstructured":"Henning MA, Pandey A (2019) Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766:46\u201357","journal-title":"Theor. Comput. Sci."},{"key":"687_CR20","doi-asserted-by":"crossref","unstructured":"Henning MA, Pandey A, Tripathi V (2019) Complexity and algorithms for semipaired domination in graphs. In: Combinatorial Algorithms. Lecture Notes in Computer Science, vol. 11638, pp. 278\u2013289. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-25005-8_23"},{"key":"687_CR21","unstructured":"Henning MA, Yeo A (2013) Total Domination in Graphs (Springer Monographs in Mathematics) ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00687-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00687-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-00687-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T07:30:01Z","timestamp":1612510201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00687-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,19]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["687"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00687-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,1,19]]},"assertion":[{"value":"28 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}