{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:18Z","timestamp":1770972378626,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00873-y","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:37Z","timestamp":1654791397000},"page":"921-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Paired domination versus domination and packing number in graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Magda","family":"Dettlaff","sequence":"first","affiliation":[]},{"given":"Didem","family":"G\u00f6z\u00fcpek","sequence":"additional","affiliation":[]},{"given":"Joanna","family":"Raczek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"873_CR1","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1016\/j.disc.2015.03.014","volume":"338","author":"JD Alvaro","year":"2015","unstructured":"Alvaro JD, Dantas S, Rautenbach D (2015) Perfectly relating the domination, total domination, and paired domination numbers of a graph. Discr. Math 338:1424\u20131431","journal-title":"Discr. Math"},{"key":"873_CR2","first-page":"255","volume":"73","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar B, Henning MA, Rall DF (2007) Paired-domination of Cartesian product of graphs. Util. Math. 73:255\u2013265","journal-title":"Util. Math."},{"key":"873_CR3","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, New York"},{"key":"873_CR4","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"},{"key":"873_CR5","doi-asserted-by":"crossref","unstructured":"Henning MA, Vestergaard PD (2006) Trees with paired\u2013domination number twice their domination number, Aalborg University","DOI":"10.1007\/s10878-006-9014-8"},{"key":"873_CR6","doi-asserted-by":"publisher","first-page":"3420","DOI":"10.1016\/j.disc.2007.06.034","volume":"308","author":"X Hou","year":"2008","unstructured":"Hou X (2008) A characterization of $$(2\\gamma , \\gamma _{\\rm p})$$-trees. Discrere Math. 308:3420\u20133426","journal-title":"Discrere Math."},{"key":"873_CR7","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":"873_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A Meir","year":"1975","unstructured":"Meir A, Moon JW (1975) Relations between packing and covering numbers of a tree. Pacific J. Math. 61:225\u2013233","journal-title":"Pacific J. Math."},{"key":"873_CR9","unstructured":"Rall DF (2008) Packing and Domination Invariants on Cartesian Products and Direct Products"},{"key":"873_CR10","first-page":"31","volume":"30","author":"E Shang","year":"2004","unstructured":"Shang E, Kang L, Henning MA (2004) A characterization of trees with equal total domination and paired-domination numbers. Australas. J. of Comb. 30:31\u201339","journal-title":"Australas. J. of Comb."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00873-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00873-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00873-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:12:56Z","timestamp":1660371176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00873-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00873-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"14 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}