{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T01:40:57Z","timestamp":1782870057224,"version":"3.54.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T00:00:00Z","timestamp":1734134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T00:00:00Z","timestamp":1734134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10878-024-01245-4","type":"journal-article","created":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T18:00:31Z","timestamp":1734199231000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Np-completeness and bounds for disjunctive total domination subdivision"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5397-0367","authenticated-orcid":false,"given":"Canan","family":"\u00c7ift\u00e7i","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2086-8969","authenticated-orcid":false,"given":"Aysun","family":"Ayta\u00e7","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,14]]},"reference":[{"key":"1245_CR1","first-page":"157","volume":"5","author":"J Amjadi","year":"2020","unstructured":"Amjadi J (2020) Total roman domination subdivision number in graphs. Commun. Comb. Optim. 5:157\u2013168","journal-title":"Commun. Comb. Optim."},{"key":"1245_CR2","first-page":"177","volume":"7","author":"J Amjadi","year":"2022","unstructured":"Amjadi J, Chellali M (2022) Complexity of the paired domination subdivision problem. Commun Combinatorics Opt 7:177\u2013182","journal-title":"Commun Combinatorics Opt"},{"key":"1245_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10878-020-00597-x","volume":"40","author":"J Amjadi","year":"2020","unstructured":"Amjadi J, Khoeilar R, Chellali M, Shao Z (2020) On the Roman domination subdivision number of a graph. J Comb Optim 40:501\u2013511","journal-title":"J Comb Optim"},{"key":"1245_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.33401\/fujma.790046","volume":"3","author":"C \u00c7ift\u00e7i","year":"2020","unstructured":"\u00c7ift\u00e7i C (2020) Disjunctive total domination of some shadow distance graphs. Fund J Math Appl 3:185\u2013193","journal-title":"Fund J Math Appl"},{"key":"1245_CR5","first-page":"1148","volume":"11","author":"C \u00c7ift\u00e7i","year":"2021","unstructured":"\u00c7ift\u00e7i C, Ayta\u00e7 A (2021) Disjunctive total domination in some graphs derived from the subdivision graph. TWMS J Appl Eng Math 11:1148\u20131157","journal-title":"TWMS J Appl Eng Math"},{"key":"1245_CR6","first-page":"15","volume":"174","author":"C \u00c7ift\u00e7i","year":"2020","unstructured":"\u00c7ift\u00e7i C, Ayta\u00e7 V (2020) Disjunctive total domination subdivision number of graphs. Fund Inform 174:15\u201326","journal-title":"Fund Inform"},{"key":"1245_CR7","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1080\/09720529.2019.1645393","volume":"23","author":"Q Chen","year":"2020","unstructured":"Chen Q, Tang Y (2020) Semitotal domination subdivision numbers of graphs. J. Discrete Math. Sci. Cryptogr. 23:973\u2013987","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"1245_CR8","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.1093\/comjnl\/bxac142","volume":"66","author":"C \u00c7ift\u00e7i","year":"2023","unstructured":"\u00c7ift\u00e7i C, Ayta\u00e7 V (2023) Disjunctive total domination in harary graphs. Comput J 66:2990\u20132999","journal-title":"Comput J"},{"key":"1245_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211\u2013219","journal-title":"Networks"},{"key":"1245_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"EJ Cockayne","year":"1977","unstructured":"Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7:247\u2013261","journal-title":"Networks"},{"key":"1245_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.7151\/dmgt.2103","volume":"39","author":"M Dettlaff","year":"2019","unstructured":"Dettlaff M, Raczek J, Topp J (2019) Domination subdivision and domination multisubdivision numbers of graphs. Discuss. Math. Graph Theory 39:829\u2013839","journal-title":"Discuss. Math. Graph Theory"},{"key":"1245_CR12","doi-asserted-by":"publisher","first-page":"1950036","DOI":"10.1142\/S1793830919500368","volume":"11","author":"SV Divya Rashmi","year":"2019","unstructured":"Divya Rashmi SV, Somasundaram A, Arumugam S (2019) Secure domination subdivision number of a graph. Discrete Math. Algorithms Appl. 11:1950036","journal-title":"Discrete Math. Algorithms Appl."},{"key":"1245_CR13","first-page":"338","volume-title":"Computers and intractabilty","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractabilty. A guide to the theory of NP-completeness, Freeman San Francisco, p 338"},{"key":"1245_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7151\/dmgt.1147","volume":"21","author":"T Haynes","year":"2001","unstructured":"Haynes T, Hedetniemi SM, Hedetniemi ST, Jacobs D, Knisely J, Van Der Merwe L (2001) Domination subdivision numbers. Discuss. Math. Graph Theory 21:239\u2013253","journal-title":"Discuss. Math. Graph Theory"},{"key":"1245_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.7151\/dmgt.1244","volume":"24","author":"T Haynes","year":"2004","unstructured":"Haynes T, Henning M, Hopkins L (2004) Total domination subdivision numbers of graphs. Discuss. Math. Graph Theory 24:457\u2013467","journal-title":"Discuss. Math. Graph Theory"},{"key":"1245_CR16","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/s10878-014-9811-4","volume":"31","author":"MA Henning","year":"2016","unstructured":"Henning MA, Naicker V (2016) Disjunctive total domination in graphs. J Comb Optim 31:1090\u20131110","journal-title":"J Comb Optim"},{"key":"1245_CR17","first-page":"152","volume":"28","author":"R Khoeilar","year":"2020","unstructured":"Khoeilar R, Kheibari M, Shao Z, Sheikholeslami SM (2020) Total $$k$$-rainbow domination subdivision number in graphs. Comput. Sci. J. Moldova 28:152\u2013169","journal-title":"Comput. Sci. J. Moldova"},{"key":"1245_CR18","first-page":"255","volume":"17","author":"V Naicker","year":"2015","unstructured":"Naicker V, Henning MA (2015) Graphs with large disjunctive total domination number. Discret. Math. Theor. C. 17:255\u2013281","journal-title":"Discret. Math. Theor. C."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01245-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01245-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01245-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T19:03:21Z","timestamp":1737745401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01245-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,14]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1245"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01245-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,14]]},"assertion":[{"value":"30 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2024","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 declare no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No new data were generated or analysed in support of this research.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}}],"article-number":"10"}}