{"id":"https://openalex.org/W4200602692","doi":"https://doi.org/10.1142/s1793830922500434","title":"Edge-vertex domination in trees","display_name":"Edge-vertex domination in trees","publication_year":2021,"publication_date":"2021-12-09","ids":{"openalex":"https://openalex.org/W4200602692","doi":"https://doi.org/10.1142/s1793830922500434"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922500434","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500434","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041495839","display_name":"Kijung Kim","orcid":"https://orcid.org/0000-0002-6623-5123"},"institutions":[{"id":"https://openalex.org/I4921948","display_name":"Pusan National University","ror":"https://ror.org/01an57a31","country_code":"KR","type":"education","lineage":["https://openalex.org/I4921948"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Kijung Kim","raw_affiliation_strings":["Department of Mathematics, Pusan National University, Busandaehak-ro 63beon-gil, Geumjeong-gu, Busan 46241, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-6623-5123","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Pusan National University, Busandaehak-ro 63beon-gil, Geumjeong-gu, Busan 46241, Republic of Korea","institution_ids":["https://openalex.org/I4921948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041495839"],"corresponding_institution_ids":["https://openalex.org/I4921948"],"apc_list":null,"apc_paid":null,"fwci":0.4542,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69623338,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"08","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9660999774932861,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7928836345672607},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7461868524551392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6715077757835388},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4844541549682617},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3774346709251404}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7928836345672607},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7461868524551392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6715077757835388},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4844541549682617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3774346709251404},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922500434","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500434","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7076454833","display_name":null,"funder_award_id":"2020R1I1A1A01055403","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2663774503","https://openalex.org/W2793144387","https://openalex.org/W2958617377","https://openalex.org/W3007438706","https://openalex.org/W3042819172","https://openalex.org/W3112882099"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W4393363920","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2902222102","https://openalex.org/W3111310291"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,11,20,24,30,34,44,52,58,66,76,83,96,105,111,116,120],"see":[2,12,21,25,31,35,45,53,59,67,77,84,97,106,112,117,121],"text]":[3,13,22,26,32,36,54,60,68,85,107,113,118,122],"be":[4],"a":[5,40,56],"finite":[6],"simple":[7],"graph.":[8],"A":[9],"vertex":[10,41,64],"is":[14,27,37,55,69,86],"edge-vertex":[15,48,70,80,92],"dominated":[16,71],"by":[17,72],"an":[18,73,91],"edge":[19,74],"if":[23],"incident":[28,38],"with":[29,39,119],"or":[33],"adjacent":[42],"to":[43],"text].":[46,78,98],"An":[47],"dominating":[49,93],"set":[50,94],"of":[51,65,75,90,95,114,131],"subset":[57],"such":[61],"that":[62,104],"every":[63,109],"The":[79],"domination":[81],"number":[82],"the":[87,127,132],"minimum":[88],"cardinality":[89],"In":[99],"this":[100],"paper,":[101],"we":[102,125],"prove":[103],"for":[108],"tree":[110],"order":[115],"leaves,":[123],"and":[124],"characterize":[126],"trees":[128],"attaining":[129],"each":[130],"bounds.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}