{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:34:25Z","timestamp":1753882465585,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2018\/000234"],"award-info":[{"award-number":["MTR\/2018\/000234"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TATA Realty Infrastructure Limited"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p> A vertex [Formula: see text] of a graph is said to [Formula: see text]-[Formula: see text] dominate every edge incident with [Formula: see text], as well as every edge incident to vertices adjacent to [Formula: see text]. A subset [Formula: see text] is a total outer connected vertex-edge dominating set of a graph [Formula: see text] if every edge in [Formula: see text] is [Formula: see text]-[Formula: see text] dominated by a vertex in [Formula: see text], the subgraph induced by [Formula: see text] has no isolated vertices and the subgraph induced by [Formula: see text] is connected. We initiate the study of total outer connected vertex-edge domination in graphs. We show that the decision problem for total outer-connected vertex-edge domination problem is [Formula: see text]-Complete even for bipartite graphs. We prove that for every tree of order [Formula: see text] with [Formula: see text] leaves, [Formula: see text] and characterize the trees attaining the lower bound. We also study the effect of edge removal, edge addition and edge subdivision on total outer connected vertex-edge domination number of a graph. <\/jats:p>","DOI":"10.1142\/s1793830922500574","type":"journal-article","created":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T12:10:00Z","timestamp":1644667800000},"source":"Crossref","is-referenced-by-count":1,"title":["Total outer connected vertex-edge domination"],"prefix":"10.1142","volume":"15","author":[{"given":"B.","family":"Senthilkumar","sequence":"first","affiliation":[{"name":"Department of Mathematics, School of Arts, Science, Humanities and Education, SASTRA Deemed to be University, Tanjore, India"}]},{"given":"H. Naresh","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Arts, Science, Humanities and Education, Srinivasa Ramanujan Center, SASTRA Deemed to be University, Tanjore, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4560-2040","authenticated-orcid":false,"given":"Y. B.","family":"Venkatakrishnan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Arts, Science, Humanities and Education, SASTRA Deemed to be University, Tanjore, India"}]}],"member":"219","published-online":{"date-parts":[[2022,2,11]]},"reference":[{"key":"S1793830922500574BIB001","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1343469"},{"key":"S1793830922500574BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00010-015-0354-2"},{"issue":"4","key":"S1793830922500574BIB003","doi-asserted-by":"crossref","first-page":"1550048","DOI":"10.1142\/S1793830915500482","volume":"7","author":"Chellali M.","year":"2015","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"S1793830922500574BIB004","doi-asserted-by":"crossref","first-page":"377","DOI":"10.7151\/dmgt.1500","volume":"30","author":"Cyman J.","year":"2010","journal-title":"Discuss. Math. Graph Theory"},{"issue":"15","key":"S1793830922500574BIB005","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.1016\/j.dam.2009.06.027","volume":"157","author":"Cyman J.","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"S1793830922500574BIB006","doi-asserted-by":"crossref","first-page":"1350009","DOI":"10.1142\/S1793830913500092","volume":"5","author":"Favron O.","year":"2013","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"S1793830922500574BIB007","first-page":"223","volume":"7","author":"Hattingh J. H.","year":"2010","journal-title":"AKCE J. Graphs Comb."},{"key":"S1793830922500574BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"S1793830922500574BIB009","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500458"},{"key":"S1793830922500574BIB010","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500671"},{"key":"S1793830922500574BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2014.03.017"},{"key":"S1793830922500574BIB012","first-page":"193","volume":"81","author":"Lewis J. R.","year":"2010","journal-title":"Util. Math."},{"issue":"4","key":"S1793830922500574BIB013","doi-asserted-by":"crossref","first-page":"1950040","DOI":"10.1142\/S179383091950040X","volume":"11","author":"Meddah N.","year":"2019","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:25:30Z","timestamp":1675401930000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":13,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.1142\/S1793830922500574"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500574","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,2,11]]},"article-number":"2250057"}}