{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T04:28:37Z","timestamp":1741926517430,"version":"3.38.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:00:00Z","timestamp":1740009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:00:00Z","timestamp":1740009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701059"],"award-info":[{"award-number":["11701059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chongqing Natural Science Foundation Innovation and Development Joint Fund","award":["CSTB2022NSCQ-LZX0003"],"award-info":[{"award-number":["CSTB2022NSCQ-LZX0003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10878-025-01263-w","type":"journal-article","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T19:08:06Z","timestamp":1740078486000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The edge-vertex domination and weighted edge-vertex domination problem"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3092-9692","authenticated-orcid":false,"given":"Peng","family":"Li","sequence":"first","affiliation":[]},{"given":"Xinyi","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Xingli","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"1263_CR1","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.dam.2018.02.009","volume":"243","author":"WJ Desormeaux","year":"2018","unstructured":"Desormeaux WJ, Haynes TW, Hedetniemi ST, Moore C (2018) Distribution centers in graphs. Discret Appl Math 243:286\u2013293","journal-title":"Discret Appl Math"},{"issue":"2","key":"1263_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.2174\/1573409915666190807145908","volume":"16","author":"S Ediz","year":"2020","unstructured":"Ediz S, Cancan M (2020) On molecular topological properties of alkylating agents based anticancer drug candidates via some ve-degree topological indices. Curr Comput Aided Drug des 16(2):190\u2013195","journal-title":"Curr Comput Aided Drug des"},{"key":"1263_CR3","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Domination in graphs: advanced topics. Marcel Dekker Inc, New York"},{"key":"1263_CR4","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Fundamentals of domination in graphs. Marcel Dekker Inc, New York"},{"issue":"4","key":"1263_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes TW, Hedetniemi SM, Hedetniemi ST, Henning MA (2002) Domination in graphs applied to electric power networks. SIAM J Discret Math 15(4):519\u2013529","journal-title":"SIAM J Discret Math"},{"key":"1263_CR6","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-108","author":"TW Haynes","year":"2006","unstructured":"Haynes TW, Knisley D, Seier E, Zou Y (2006) A quantitive analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. https:\/\/doi.org\/10.1186\/1471-2105-7-108","journal-title":"BMC Bioinform"},{"key":"1263_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2018.09.019","volume":"766","author":"MA Henning","year":"2019","unstructured":"Henning MA, Pandey A (2019) Alghoritmic aspects of semitotal domination in graphs. Theoret Comput Sci 766:46\u201357","journal-title":"Theoret Comput Sci"},{"key":"1263_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"PJ Looges","year":"1993","unstructured":"Looges PJ, Olariu S (1993) Optimal greedy algorithms for indifference graphs. Comput Math Appl 25:15\u201325","journal-title":"Comput Math Appl"},{"key":"1263_CR9","unstructured":"Peters JKW (1986) Theoretical and algorithmic results on domination and connectivity (NordhausCGaddum, Gallai type results, max-min relationships, linear time, series- parallel), Ph.D. thesis, Clemson, SC, USA"},{"key":"1263_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam G, Rangan CP (1988) A uniform approach to domination problems on interval graphs. Inf Process Lett 27:271\u2013274","journal-title":"Inf Process Lett"},{"key":"1263_CR11","first-page":"235","volume":"59","author":"A Raychaudhuri","year":"1987","unstructured":"Raychaudhuri A (1987) On powers of interval and unit interval graphs. Congr Numer 59:235\u2013242","journal-title":"Congr Numer"},{"key":"1263_CR12","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1007\/978-3-030-51156-2_182","volume":"1197","author":"B Sahin","year":"2021","unstructured":"Sahin B, Sahin A (2021) Double edge-vertex domination, intelligent and fuzzy techniques: Smart and innovative solutions, INFUS 2020. Adv Intell Syst Comput 1197:1564\u20131572","journal-title":"Adv Intell Syst Comput"},{"key":"1263_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2018.01.012","volume":"134","author":"YB Venkatakrishnan","year":"2018","unstructured":"Venkatakrishnan YB, Krishnakumari B (2018) An improved upper bound of edge-vertex domination of a tree. Inf Process Lett 134:14\u201317","journal-title":"Inf Process Lett"},{"key":"1263_CR14","first-page":"188","volume-title":"WALCOM 2019, LNCS","author":"YB Venkatakrishnan","year":"2019","unstructured":"Venkatakrishnan YB, Krishnakumari B (2019) On the alghoritmic complexity of double vertex-edge domination in graphs. In: Das G-K et al (eds) WALCOM 2019, LNCS, vol 11355. Springer, Cham, pp 188\u2013198"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01263-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01263-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01263-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T21:07:02Z","timestamp":1741900022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01263-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,20]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1263"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01263-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,2,20]]},"assertion":[{"value":"23 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","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 that they have no conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"30"}}