{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:04Z","timestamp":1759637824354,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,10]],"date-time":"2017-10-10T00:00:00Z","timestamp":1507593600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF 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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0181-6","type":"journal-article","created":{"date-parts":[[2017,10,10]],"date-time":"2017-10-10T12:19:15Z","timestamp":1507637955000},"page":"424-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm complexity of neighborhood total domination and \n                $$(\\rho ,\\gamma _{nt})$$\n                \n                    \n                        \n                            (\n                            \u03c1\n                            ,\n                            \n                                \u03b3\n                                \n                                    n\n                                    t\n                                \n                            \n                            )\n                        \n                    \n                \n            -graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Changhong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4449-7082","authenticated-orcid":false,"given":"Bing","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":[[2017,10,10]]},"reference":[{"key":"181_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probablistic method: random structures Algorithms","author":"N Alon","year":"2000","unstructured":"Alon N, Spencer JH (2000) The probablistic method: random structures Algorithms. Wiley, New York"},{"key":"181_CR2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.7494\/OpMath.2011.31.4.519","volume":"31","author":"S Arumugam","year":"2011","unstructured":"Arumugam S, Sivagnanam C (2011) Neighborhood total domination in graphs. Opuscula Math 31:519\u2013531","journal-title":"Opuscula Math"},{"key":"181_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi AA (1984) Dominating sets for split and bipartite graphs. Inform Process Lett 19:37\u201340","journal-title":"Inform Process Lett"},{"key":"181_CR4","doi-asserted-by":"crossref","first-page":"5063","DOI":"10.1016\/j.tcs.2009.08.004","volume":"410","author":"L Chen","year":"2009","unstructured":"Chen L, Lu C, Zeng Z (2009) Hardness results and approximation algorithms for (weighted) paired-domination in graphs. Theor Comput Sci 410:5063\u20135071","journal-title":"Theor Comput Sci"},{"key":"181_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/1097-0118(200008)34:4<277::AID-JGT4>3.0.CO;2-#","volume":"34","author":"EJ Cockayne","year":"2000","unstructured":"Cockayne EJ, Favaron O, Mynhardt CM, Puech J (2000) A characterization of \n                        $$(\\gamma, i)$$\n                        \n                            \n                                \n                                    (\n                                    \u03b3\n                                    ,\n                                    i\n                                    )\n                                \n                            \n                        \n                    -trees. J Graph Theory 34:277\u2013292","journal-title":"J Graph Theory"},{"key":"181_CR6","doi-asserted-by":"crossref","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":"181_CR7","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. Discret Math 306:2647\u20132654","journal-title":"Discret Math"},{"key":"181_CR8","first-page":"121","volume":"55","author":"F Harary","year":"1986","unstructured":"Harary F, Livingston M (1986) Characterization of trees with equal domination and independent domination numbers. Congr Numer 55:121\u2013150","journal-title":"Congr Numer"},{"key":"181_CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/1097-0118(200006)34:2<142::AID-JGT3>3.0.CO;2-V","volume":"34","author":"JH Hattingh","year":"2000","unstructured":"Hattingh JH, Henning MA (2000) Characterizations of trees with equal domination parameters. J Graph Theory 34:142\u2013153","journal-title":"J Graph Theory"},{"key":"181_CR10","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, Inc., New York"},{"key":"181_CR11","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in graphs: advanced topics. Marcel Dekker, Inc., New York"},{"key":"181_CR12","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) A survey of selected recent results on total domination in graphs. Discret Math 309:32\u201363","journal-title":"Discret Math"},{"key":"181_CR13","first-page":"99","volume":"60","author":"MA Henning","year":"2001","unstructured":"Henning MA (2001) Trees with large total domination number. Util Math 60:99\u2013106","journal-title":"Util Math"},{"key":"181_CR14","doi-asserted-by":"crossref","first-page":"417","DOI":"10.2989\/16073600709486210","volume":"30","author":"MA Henning","year":"2007","unstructured":"Henning MA, Yeo A (2007) A transition from total domination in graphs to transversals in hypergraphs. Quaest Math 30:417\u2013436","journal-title":"Quaest Math"},{"key":"181_CR15","doi-asserted-by":"crossref","first-page":"2460","DOI":"10.1016\/j.dam.2013.05.014","volume":"161","author":"MA Henning","year":"2013","unstructured":"Henning MA, Rad NJ (2013) Bounds on neighborhood total domination in graphs. Discret Appl Math 161:2460\u20132466","journal-title":"Discret Appl Math"},{"key":"181_CR16","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River","edition":"2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0181-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0181-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0181-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T09:29:02Z","timestamp":1589794142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0181-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["181"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0181-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,10,10]]}}}