{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:36Z","timestamp":1740107136586,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11371008","91230201"],"award-info":[{"award-number":["11371008","91230201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["13dz2260400"],"award-info":[{"award-number":["13dz2260400"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1661-z","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T06:55:53Z","timestamp":1448952953000},"page":"1489-1494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Upper Bounds for the Paired-Domination Numbers of Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Changhong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,1]]},"reference":[{"key":"1661_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10878-008-9177-6","volume":"19","author":"L Chen","year":"2010","unstructured":"Chen, L., Lu, C.H., Zeng, Z.B.: Labelling algorithms for paired-domination problems in block and interval graphs. J. Combin. Optim. 19, 457\u2013470 (2010)","journal-title":"J. Combin. Optim."},{"key":"1661_CR2","unstructured":"Clark, W.E., Shekhtman, B., Suen, S., Fisher, D.C.: Upper bounds for the domination number of a graph. In:Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), Congr. Numer. 132, 99\u2013123 (1998)"},{"key":"1661_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10878-009-9275-0","volume":"22","author":"P Dorbec","year":"2011","unstructured":"Dorbec, P., Henning, M.A.: Upper paired-domination in claw-free graphs. J. Combin. Optim. 22, 235\u2013251 (2011)","journal-title":"J. Combin. Optim."},{"key":"1661_CR4","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, M.A.: Paired domination in claw-free cubic graphs. Graphs Combin. 20, 447\u2013456 (2004)","journal-title":"Graphs Combin."},{"key":"1661_CR5","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s00373-010-0884-2","volume":"25","author":"W Goddard","year":"2009","unstructured":"Goddard, W., Henning, M.A.: A characterization of cubic graphs with paired-domination number three-fifths their order. Graphs Combin. 25, 675\u2013692 (2009)","journal-title":"Graphs Combin."},{"key":"1661_CR6","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, T.W., Slater, P.J.: Paired-domination in graphs. Networks 32, 199\u2013206 (1998)","journal-title":"Networks"},{"key":"1661_CR7","unstructured":"Haynes, T. W., Slater, P. J.: Paired-domination and the paired-domatic number. In:Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), Congr. Numer. 109, 65\u201372 (1995)"},{"key":"1661_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10878-006-9014-8","volume":"13","author":"MA Henning","year":"2007","unstructured":"Henning, M.A.: Graphs with large paired-domination number. J. Combin. Optim. 13, 61\u201378 (2007)","journal-title":"J. Combin. Optim."},{"key":"1661_CR9","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1007\/s00373-012-1224-5","volume":"29","author":"SW Huang","year":"2013","unstructured":"Huang, S.W., Kang, L.Y., Shan, E.F.: Paired-domination in claw-free graphs. Graphs Combin. 29, 1777\u20131794 (2013)","journal-title":"Graphs Combin."},{"key":"1661_CR10","unstructured":"Lu, C.H., Wang, K., Wu, Y. N.: Paired-domination in claw-free graphs with minimum degree at least three, (2014) (submitted)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1661-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1661-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1661-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:42Z","timestamp":1559041182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1661-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1661"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1661-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}