{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:50Z","timestamp":1759638770110,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571155","11761070"],"award-info":[{"award-number":["11571155","11761070"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11201208"],"award-info":[{"award-number":["11201208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10878-020-00596-y","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T18:03:06Z","timestamp":1591380186000},"page":"571-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The complexity of total edge domination and some related results on trees"],"prefix":"10.1007","volume":"40","author":[{"given":"Zhuo","family":"Pan","sequence":"first","affiliation":[]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6311-8888","authenticated-orcid":false,"given":"Xianyue","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-3040","authenticated-orcid":false,"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"issue":"3","key":"596_CR1","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(3):247\u2013261","journal-title":"Networks"},{"key":"596_CR2","volume-title":"Fundermentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundermentals of domination in graphs. Marcel Dekker, New York"},{"issue":"3","key":"596_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"JD Horton","year":"1993","unstructured":"Horton JD, Kilakos K (1993) Minimum edge dominating sets. SIAM J Discret Math 6(3):375\u2013387","journal-title":"SIAM J Discret Math"},{"key":"596_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013104"},{"key":"596_CR5","first-page":"233","volume":"11A","author":"JG Kalbflisch","year":"1971","unstructured":"Kalbflisch JG, Stanton R, Horton JD (1971) On covering sets and error correcting codes. J Comb 11A:233\u2013250","journal-title":"J Comb"},{"key":"596_CR6","unstructured":"Kilakos K (1998) On the complexity of edge domination. Master\u2019s Thesis, University of New Brunswick, New Brunswick, Canada"},{"key":"596_CR7","unstructured":"Kulli VR, Patwari DK (1991) On the edge domination number of a graph. In: Proceedings of the symposium on graph theory and combinatorics, Publication, vol 21, pp 75\u201381. Centre Math Sci Trivandrum, Cochin"},{"key":"596_CR8","volume-title":"Introduction to combinatorial mathematics","author":"CL Lru","year":"1968","unstructured":"Lru CL (1968) Introduction to combinatorial mathematics. McGraw-Hill, New York"},{"key":"596_CR9","first-page":"489","volume":"19","author":"S Mitchell","year":"1977","unstructured":"Mitchell S, Hedetniemi ST (1977) Edge domination in trees. Congr Numer 19:489\u2013509","journal-title":"Congr Numer"},{"key":"596_CR10","first-page":"33","volume":"5","author":"MH Muddebihal","year":"2013","unstructured":"Muddebihal MH, Sedamkar AR (2013) Characterization of trees with equal edge domination and end edge domination numbers. Math Theory Model 5:33\u201342","journal-title":"Math Theory Model"},{"key":"596_CR11","first-page":"1077","volume":"10","author":"MNS Paspasan","year":"2016","unstructured":"Paspasan MNS, Canoy SR (2016) Edge domination and total edge domination in the join of graphs. Appl Math Sci 10:1077\u20131086","journal-title":"Appl Math Sci"},{"key":"596_CR12","first-page":"198","volume":"5","author":"S Velammal","year":"2014","unstructured":"Velammal S (2014) Equality of connected edge domination and total edge domaination in graphs. Int J Enhanc Res Sci Technol Eng 5:198\u2013201","journal-title":"Int J Enhanc Res Sci Technol Eng"},{"key":"596_CR13","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1016\/j.dam.2005.12.007","volume":"154","author":"B Xu","year":"2006","unstructured":"Xu B (2006) Two classes of edge domination in graphs. Discret Appl Math 154:1541\u20131546","journal-title":"Discret Appl Math"},{"key":"596_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis M (1981) Edge-deletion problems. SIAM J Comput 10:297\u2013309","journal-title":"SIAM J Comput"},{"key":"596_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis M, Gavril F (1980) Edge dominating sets in graphs. SIAM J Appl Math 38:364\u2013372","journal-title":"SIAM J Appl Math"},{"key":"596_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2014.08.005","volume":"6","author":"YC Zhao","year":"2014","unstructured":"Zhao YC, Liao ZH, Miao LY (2014) On the algorithmic complexity of edge total domination. Theor Comput Sci 6:28\u201333","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00596-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00596-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00596-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:02:30Z","timestamp":1622851350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00596-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["596"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00596-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,5]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}