{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:07:04Z","timestamp":1772716024543,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,10,20]],"date-time":"2009-10-20T00:00:00Z","timestamp":1255996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10878-009-9274-1","type":"journal-article","created":{"date-parts":[[2009,10,19]],"date-time":"2009-10-19T15:57:46Z","timestamp":1255967866000},"page":"217-234","source":"Crossref","is-referenced-by-count":6,"title":["A characterization of graphs with disjoint dominating and paired-dominating sets"],"prefix":"10.1007","volume":"22","author":[{"given":"Justin","family":"Southey","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,20]]},"reference":[{"key":"9274_CR1","first-page":"166","volume":"27","author":"X-G Chen","year":"2007","unstructured":"Chen X-G, Sun L, Xing H-M (2007) Paired-domination numbers of cubic graphs (Chinese). Acta Math Sci Ser A Chin Ed 27:166\u2013170","journal-title":"Acta Math Sci Ser A Chin Ed"},{"key":"9274_CR2","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1016\/j.dam.2007.05.011","volume":"155","author":"TCE Cheng","year":"2007","unstructured":"Cheng TCE, Kang LY, Ng CT (2007) Paired domination on interval and circular-arc graphs. Discrete Appl Math 155:2077\u20132086","journal-title":"Discrete Appl Math"},{"key":"9274_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-006-9022-8","volume":"14","author":"P Dorbec","year":"2007","unstructured":"Dorbec P, Gravier S, Henning MA (2007) Paired-domination in generalized claw-free graphs. J\u00a0Comb Optim 14:1\u20137","journal-title":"J\u00a0Comb Optim"},{"key":"9274_CR4","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1016\/j.disc.2006.04.031","volume":"306","author":"M Dorfling","year":"2006","unstructured":"Dorfling M, Goddard W, Henning MA, Mynhardt CM (2006) Construction of trees and graphs with equal domination parameters. Discrete Math 306:2647\u20132654","journal-title":"Discrete Math"},{"key":"9274_CR5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O Favaron","year":"2004","unstructured":"Favaron O, Henning MA (2004) Paired domination in claw-free cubic graphs. Graphs Comb 20:447\u2013456","journal-title":"Graphs Comb"},{"key":"9274_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7151\/dmgt.1063","volume":"18","author":"S Fitzpatrick","year":"1998","unstructured":"Fitzpatrick S, Hartnell B (1998) Paired-domination. Discuss Math, Graph Theory 18:63\u201372","journal-title":"Discuss Math, Graph Theory"},{"key":"9274_CR7","doi-asserted-by":"crossref","unstructured":"Goddard W, Henning MA (2009) A\u00a0characterization of cubic graphs with paired-domination number three-fifths their order. Graphs Comb (to appear)","DOI":"10.1007\/s00373-010-0884-2"},{"key":"9274_CR8","first-page":"3","volume":"71","author":"TW Haynes","year":"2006","unstructured":"Haynes TW, Henning MA (2006) Trees with large paired-domination number. Util Math 71:3\u201312","journal-title":"Util Math"},{"key":"9274_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"},{"key":"9274_CR10","doi-asserted-by":"crossref","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":"9274_CR11","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, New York"},{"key":"9274_CR12","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"9274_CR13","first-page":"207","volume":"69","author":"MA Henning","year":"2006","unstructured":"Henning MA (2006) Trees with equal total domination and paired-domination numbers. Util Math 69:207\u2013218","journal-title":"Util Math"},{"key":"9274_CR14","doi-asserted-by":"crossref","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\u00a0Comb Optim 13:61\u201378","journal-title":"J\u00a0Comb Optim"},{"key":"9274_CR15","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning MA (2009) Recent results on total domination in graphs: a\u00a0survey. Discrete Math 309:32\u201363","journal-title":"Discrete Math"},{"key":"9274_CR16","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1007\/s10587-008-0057-0","volume":"58","author":"MA Henning","year":"2008","unstructured":"Henning MA, Mynhardt CM (2008) The diameter of paired-domination vertex critical graphs. Czechoslov Math\u00a0J 58:887\u2013897","journal-title":"Czechoslov Math\u00a0J"},{"key":"9274_CR17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10878-005-4107-3","volume":"10","author":"MA Henning","year":"2005","unstructured":"Henning MA, Plummer MD (2005) Vertices contained in all or in no minimum paired-dominating set of a tree. J\u00a0Comb Optim 10:283\u2013294","journal-title":"J\u00a0Comb Optim"},{"key":"9274_CR18","first-page":"159","volume":"89","author":"MA Henning","year":"2008","unstructured":"Henning MA, Southey J (2008) A note on graphs with disjoint dominating and total dominating sets. Ars Comb 89:159\u2013162","journal-title":"Ars Comb"},{"key":"9274_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.2989\/QM.2009.32.1.10.712","volume":"32","author":"MA Henning","year":"2009","unstructured":"Henning MA, Southey J (2009) A characterization of graphs with disjoint dominating and total dominating sets. Quaest Math 32:119\u2013129","journal-title":"Quaest Math"},{"key":"9274_CR20","first-page":"187","volume":"74","author":"MA Henning","year":"2007","unstructured":"Henning MA, Vestergaard PD (2007) Trees with paired-domination number twice their domination number. Util Math 74:187\u2013197","journal-title":"Util Math"},{"key":"9274_CR21","series-title":"Am Math Soc Transl","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1090\/coll\/038\/13","volume-title":"Theory of graphs","author":"O Ore","year":"1962","unstructured":"Ore O (1962) Theory of graphs. Am Math Soc Transl, vol\u00a038. Am Math Soc, Providence, pp\u00a0206\u2013212"},{"key":"9274_CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1021338214295","volume":"25","author":"H Qiao","year":"2003","unstructured":"Qiao H, Kang L, Cardei M, Du D-Z (2003) Paired-domination of trees. J\u00a0Glob Optim 25:43\u201354","journal-title":"J\u00a0Glob Optim"},{"key":"9274_CR23","first-page":"7","volume":"39","author":"B Zelinka","year":"1989","unstructured":"Zelinka B (1989) Total domatic number and degrees of vertices of a graph. Math Slovaca 39:7\u201311","journal-title":"Math Slovaca"},{"key":"9274_CR24","first-page":"351","volume-title":"Domination in graphs: advanced topics","author":"B Zelinka","year":"1998","unstructured":"Zelinka B (1998) Domatic numbers of graphs and their variants: a survey. In: Haynes TW et al. (eds) Domination in graphs: advanced topics. Marcel Dekker, New York, pp\u00a0351\u2013377"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9274-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9274-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9274-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9274-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,20]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9274"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9274-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,20]]}}}