{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:27:53Z","timestamp":1774466873167,"version":"3.50.1"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"DOI":"10.13039\/501100003725","name":"The national research foundation of korea","doi-asserted-by":"crossref","award":["2020R1I1A1A01055403"],"award-info":[{"award-number":["2020R1I1A1A01055403"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:p> Let [Formula: see text] be a finite simple graph. A vertex [Formula: see text] is edge-vertex dominated by an edge [Formula: see text] if [Formula: see text] is incident with [Formula: see text] or [Formula: see text] is incident with a vertex adjacent to [Formula: see text]. An edge-vertex dominating set of [Formula: see text] is a subset [Formula: see text] such that every vertex of [Formula: see text] is edge-vertex dominated by an edge of [Formula: see text]. The edge-vertex domination number [Formula: see text] is the minimum cardinality of an edge-vertex dominating set of [Formula: see text]. In this paper, we prove that [Formula: see text] for every tree [Formula: see text] of order [Formula: see text] with [Formula: see text] leaves, and we characterize the trees attaining each of the bounds. <\/jats:p>","DOI":"10.1142\/s1793830922500434","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T01:22:15Z","timestamp":1639444935000},"source":"Crossref","is-referenced-by-count":4,"title":["Edge-vertex domination in trees"],"prefix":"10.1142","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6623-5123","authenticated-orcid":false,"given":"Kijung","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Mathematics, Pusan National University, Busandaehak-ro 63beon-gil, Geumjeong-gu, Busan 46241, Republic of Korea"}]}],"member":"219","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"S1793830922500434BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500458"},{"key":"S1793830922500434BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921500452"},{"key":"S1793830922500434BIB003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.030","volume":"858","author":"Lamprou I.","year":"2021","journal-title":"Theoret. Comput. Sci."},{"key":"S1793830922500434BIB006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ita\/2020001","volume":"54","author":"Sahin A.","year":"2020","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"S1793830922500434BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500913"},{"key":"S1793830922500434BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.012"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T05:54:01Z","timestamp":1669701241000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,9]]},"references-count":6,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["10.1142\/S1793830922500434"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500434","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,9]]},"article-number":"2250043"}}