{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:19Z","timestamp":1759638379025,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["25(0313)\/20\/EMR-II"],"award-info":[{"award-number":["25(0313)\/20\/EMR-II"]}],"id":[{"id":"10.13039\/501100001412","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":[[2022,8]]},"DOI":"10.1007\/s10878-021-00832-z","type":"journal-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T22:02:56Z","timestamp":1638396176000},"page":"303-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Results on vertex-edge and independent vertex-edge domination"],"prefix":"10.1007","volume":"44","author":[{"given":"Subhabrata","family":"Paul","sequence":"first","affiliation":[]},{"given":"Keshav","family":"Ranjan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"issue":"9","key":"832_CR1","doi-asserted-by":"publisher","first-page":"1820","DOI":"10.1080\/00207160.2017.1343469","volume":"95","author":"R Boutrig","year":"2018","unstructured":"Boutrig R, Chellali M (2018) Total vertex-edge domination. Int J Comput Math 95(9):1820\u20131828","journal-title":"Int J Comput Math"},{"issue":"2","key":"832_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00010-015-0354-2","volume":"90","author":"R Boutrig","year":"2016","unstructured":"Boutrig R, Chellali M, Haynes TW, Hedetniemi ST (2016) Vertex-edge domination in graphs. Aequ Math 90(2):355\u2013366","journal-title":"Aequ Math"},{"key":"832_CR3","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York"},{"issue":"3","key":"832_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F Gavril","year":"1975","unstructured":"Gavril F (1975) A recognition algorithm for the intersection graphs of directed paths in directed trees. Discrete Math. 13(3):237\u2013249","journal-title":"Discrete Math."},{"key":"832_CR5","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"832_CR6","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJB (1998) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"issue":"5","key":"832_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.crma.2014.03.017","volume":"352","author":"B Krishnakumari","year":"2014","unstructured":"Krishnakumari B, Venkatakrishnan YB, Krzywkowski M (2014) Bounds on the vertex-edge domination number of a tree. C R Math 352(5):363\u2013366","journal-title":"C R Math"},{"issue":"04","key":"832_CR8","doi-asserted-by":"publisher","first-page":"1750045","DOI":"10.1142\/S1793830917500458","volume":"09","author":"B Krishnakumari","year":"2017","unstructured":"Krishnakumari B, Chellali M, Venkatakrishnan YB (2017) Double vertex-edge domination. Discrete Math Algorithms Appl 09(04):1750045","journal-title":"Discrete Math Algorithms Appl"},{"key":"832_CR9","unstructured":"Lewis J (2007) Vertex-edge and edge-vertex parameters in graphs. Ph.D. thesis, Clemson, SC, USA"},{"key":"832_CR10","first-page":"193","volume":"81","author":"JR Lewis","year":"2010","unstructured":"Lewis JR, Hedetniemi ST, Haynes TW, Fricke GH (2010) Vertex-edge domination. Util Math 81:193\u2013213","journal-title":"Util Math"},{"key":"832_CR11","unstructured":"Peters Jr. KW (1986) Theoretical and algorithmic results on domination and connectivity (Nordhaus\u2013Gaddum, Gallai type results, max\u2013min relationships, linear time, series\u2013parallel). Ph.D. thesis, Clemson, SC, USA"},{"issue":"4","key":"832_CR12","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00010-018-0609-9","volume":"93","author":"P \u017byli\u0144ski","year":"2019","unstructured":"\u017byli\u0144ski P (2019) Vertex-edge domination in graphs. Aequ Math 93(4):735\u2013742","journal-title":"Aequ Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00832-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00832-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00832-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:12Z","timestamp":1659079692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00832-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["832"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00832-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,12,1]]},"assertion":[{"value":"18 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}