{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:08Z","timestamp":1740107108786,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02472-4","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A proof of a conjecture on the paired-domination subdivision number"],"prefix":"10.1007","volume":"38","author":[{"given":"Zehui","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2298-4744","authenticated-orcid":false,"given":"Seyed Mahmoud","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rana","family":"Khoeilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Karami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2472_CR1","first-page":"177","volume":"7","author":"J Amjadi","year":"2022","unstructured":"Amjadi, J., Chellali, M.: Complexity of the paired domination subdivision problem. Commun. Comb. Optim. 7, 177\u2013182 (2022)","journal-title":"Commun. Comb. Optim."},{"key":"2472_CR2","first-page":"3","volume":"73","author":"M Chellali","year":"2004","unstructured":"Chellali, M., Haynes, T.W.: Trees with unique minimum paired dominating sets. Ars Combin. 73, 3\u201312 (2004)","journal-title":"Ars Combin."},{"key":"2472_CR3","first-page":"161","volume":"67","author":"M Chellali","year":"2005","unstructured":"Chellali, M., Haynes, T.W.: On paired and double domination in graphs. Util. Math. 67, 161\u2013171 (2005)","journal-title":"Util. Math."},{"key":"2472_CR4","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00373-012-1162-2","volume":"29","author":"Y Egawa","year":"2013","unstructured":"Egawa, Y., Furuya, M., Takatou, M.: Upper bounds on the paired-domination subdivision number of a graph. Graphs Combin. 29, 843\u2013856 (2013)","journal-title":"Graphs Combin."},{"key":"2472_CR5","doi-asserted-by":"publisher","first-page":"6601","DOI":"10.1016\/j.disc.2007.11.034","volume":"308","author":"O Favaron","year":"2008","unstructured":"Favaron, O., Karami, H., Sheikholeslami, S.M.: Paired-domination number of a graph and its complement. Discrete Math. 308, 6601\u20136605 (2008)","journal-title":"Discrete Math."},{"key":"2472_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00373-005-0871-1","volume":"25","author":"O Favaron","year":"2009","unstructured":"Favaron, O., Karami, H., Sheikholeslami, S.M.: Paired-domination subdivision numbers of graphs. Graphs Combin. 25, 503\u2013512 (2009)","journal-title":"Graphs Combin."},{"key":"2472_CR7","doi-asserted-by":"crossref","unstructured":"Hao, G., Sheikholeslami, S.M., Chellali, M., Khoeilar, R., Karami, H.: On the paired-domination subdivision number of a graph, Mathematics, 9, Article ID: 439 (2021)","DOI":"10.3390\/math9040439"},{"key":"2472_CR8","first-page":"79","volume":"4","author":"TW Haynes","year":"2019","unstructured":"Haynes, T.W., Henning, M.A.: Paired-domination game played in graphs. Commun. Comb. Optim. 4, 79\u201394 (2019)","journal-title":"Commun. Comb. Optim."},{"key":"2472_CR9","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, T.W., Slater, P.J.: Paired-domination in graphs. Networks 32, 199\u2013206 (1998)","journal-title":"Networks"},{"key":"2472_CR10","first-page":"65","volume":"109","author":"TW Haynes","year":"1995","unstructured":"Haynes, T.W., Slater, P.J.: Paired-domination and the paired-domatic number. Congr. Numer. 109, 65\u201372 (1995)","journal-title":"Congr. Numer."},{"key":"2472_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.tcs.2004.02.028","volume":"320","author":"L Kang","year":"2004","unstructured":"Kang, L., Sohn, M.Y., Cheng, T.C.E.: Paired-domination in inflated graphs. Theor. Comput. Sci. 320, 485\u2013494 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"2472_CR12","first-page":"161","volume":"150","author":"KE Proffitt","year":"2001","unstructured":"Proffitt, K.E., Haynes, T.W., Slater, P.J.: Paired-domination in grid graphs. Congr. Numer. 150, 161\u2013172 (2001)","journal-title":"Congr. Numer."},{"key":"2472_CR13","doi-asserted-by":"crossref","unstructured":"Qiang, X., Kosari, S., Shao, Z., Sheikholeslami, S.M., Chellali, M., Karami, H.: A note on the paired-domination subdivision number of trees. Mathematics, 9, Article ID: 181 (2021)","DOI":"10.3390\/math9020181"},{"key":"2472_CR14","doi-asserted-by":"crossref","unstructured":"Wei, S., Hao, G., Sheikholeslami, S.M., Khoeilar, R., Karami, H.: On the paired-domination subdivision number of trees, Mathematics, 9, Article ID: 1135, (2021)","DOI":"10.3390\/math9101135"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02472-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02472-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02472-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:42:11Z","timestamp":1654814531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02472-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2472"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02472-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"26 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"71"}}