{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:25:39Z","timestamp":1778099139491,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030392185","type":"print"},{"value":"9783030392192","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_6","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T19:09:24Z","timestamp":1579892964000},"page":"67-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vertex-Edge Domination in Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Sangram K.","family":"Jena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"9","key":"6_CR2","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.: Total vertex-edge domination. Int. J. Comput. Math. 95(9), 1820\u20131828 (2018)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"6_CR3","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, T.W., Hedetniemi, S.T.: Vertex-edge domination in graphs. Aequationes Math. 90(2), 355\u2013366 (2016)","journal-title":"Aequationes Math."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.disc.2016.07.008","volume":"340","author":"M Chellali","year":"2017","unstructured":"Chellali, M., Haynes, T.W., Hedetniemi, S.T., Lewis, T.M.: On ve-degrees and ev-degrees in graphs. Discrete Math. 340(2), 31\u201338 (2017)","journal-title":"Discrete Math."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2017.01.002","volume":"25","author":"X Chen","year":"2017","unstructured":"Chen, X., Yin, K., Gao, T.: A note on independent vertex-edge domination in graphs. Discrete Optim. 25, 1\u20135 (2017)","journal-title":"Discrete Optim."},{"key":"6_CR6","first-page":"233","volume":"7","author":"S Chitra","year":"2012","unstructured":"Chitra, S., Sattanathan, R.: Global vertex-edge domination sets in graph. Int. Math. Forum 7, 233\u2013240 (2012)","journal-title":"Int. Math. Forum"},{"key":"6_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, Dallas (1979)"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM (JACM) 21(4), 549\u2013568 (1974)","journal-title":"J. ACM (JACM)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2018.07.002","volume":"31","author":"B Horoldagva","year":"2019","unstructured":"Horoldagva, B., Das, K.C., Selenge, T.: On ve-degree and ev-degree of graphs. Discrete Optim. 31, 1\u20137 (2019)","journal-title":"Discrete Optim."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830917500458","volume":"9","author":"B Krishnakumari","year":"2017","unstructured":"Krishnakumari, B., Chellali, M., Venkatakrishnan, Y.B.: Double vertex-edge domination. Discrete Math. Algorithms Appl. 9(4), 1\u201311 (2017)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40009-018-0689-z","volume":"41","author":"B Krishnakumari","year":"2018","unstructured":"Krishnakumari, B., Venkatakrishnan, Y.B.: Influence of the edge removal, edge addition and edge subdivision on the double vertex-edge domination number of a graph. Natl. Acad. Sci. Lett. 41(6), 391\u2013393 (2018)","journal-title":"Natl. Acad. Sci. Lett."},{"issue":"1","key":"6_CR13","first-page":"361","volume":"33","author":"B Krishnakumari","year":"2018","unstructured":"Krishnakumari, B., Venkatakrishnan, Y.B.: The outer-connected vertex edge domination number of a tree. Commun. Korean Math. Soc. 33(1), 361\u2013369 (2018)","journal-title":"Commun. Korean Math. Soc."},{"issue":"5","key":"6_CR14","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, Y.B., Krzywkowski, M.: Bounds on the vertex-edge domination number of a tree. C. R. Math. 352(5), 363\u2013366 (2014)","journal-title":"C. R. Math."},{"key":"6_CR15","unstructured":"Lewis, J.: Vertex-edge and edge-vertex parameters in graphs. Dissertation presented to Graduate School of Clemson University (2007)"},{"key":"6_CR16","first-page":"193","volume":"81","author":"J Lewis","year":"2010","unstructured":"Lewis, J., Hedetniemi, S.T., Haynes, T.W., Fricke, G.H.: Vertex-edge domination. Utilitas Math. 81, 193\u2013213 (2010)","journal-title":"Utilitas Math."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11671411_23","volume-title":"Approximation and Online Algorithms","author":"T Nieberg","year":"2006","unstructured":"Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296\u2013306. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11671411_23"},{"key":"6_CR18","unstructured":"Peters, K.: Theoretical and algorithmic results on domination and connectivity. Dissertation presented to Graduate School of Clemson University (1987)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4067\/S0716-09172015000100001","volume":"34","author":"S. V. Siva Rama Raju","year":"2015","unstructured":"Siva Rama Raju, S., Nagaraja Rao, I.: Complementary nil vertex edge dominating sets. Proyecciones (Antofagasta) 34(1), 1\u201313 (2015)","journal-title":"Proyecciones (Antofagasta)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.22457\/apam.v14n2a6","volume":"14","author":"D Thakkar","year":"2017","unstructured":"Thakkar, D., Jamvecha, N.P.: About ve-domination in graphs. Ann. Pure Appl. Math. 14(2), 245\u2013250 (2017)","journal-title":"Ann. Pure Appl. Math."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 100(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-10564-8_15","volume-title":"WALCOM: Algorithms and Computation","author":"YB Venkatakrishnan","year":"2019","unstructured":"Venkatakrishnan, Y.B., Naresh Kumar, H.: On the algorithmic complexity of double vertex-edge domination in graphs. In: Das, G.K., Mandal, P.S., Mukhopadhyaya, K., Nakano, S. (eds.) WALCOM 2019. LNCS, vol. 11355, pp. 188\u2013198. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-10564-8_15"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.9790\/5728-10561421","volume":"10","author":"A Vijayan","year":"2014","unstructured":"Vijayan, A., Nagarajan, T.: Vertex-edge dominating sets and vertex-edge domination polynomials of wheels. IOSR J. Math. 10(5), 14\u201321 (2014)","journal-title":"IOSR J. Math."},{"issue":"2","key":"6_CR24","first-page":"281","volume":"5","author":"A Vijayan","year":"2014","unstructured":"Vijayan, A., Nagarajan, T.: Vertex-edge domination polynomial of graphs. Int. J. Math. Arch. 5(2), 281\u2013292 (2014)","journal-title":"Int. J. Math. Arch."},{"issue":"4","key":"6_CR25","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.: Vertex-edge domination in graphs. Aequationes Math. 93(4), 735\u2013742 (2019)","journal-title":"Aequationes Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:01:24Z","timestamp":1579910484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}