{"id":"https://openalex.org/W3042819172","doi":"https://doi.org/10.1142/s1793830920500913","title":"A lower bound on the total vertex-edge domination number of a tree","display_name":"A lower bound on the total vertex-edge domination number of a tree","publication_year":2020,"publication_date":"2020-07-15","ids":{"openalex":"https://openalex.org/W3042819172","doi":"https://doi.org/10.1142/s1793830920500913","mag":"3042819172"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500913","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500913","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/A5104669071","display_name":"B. Senthilkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"B. Senthilkumar","raw_affiliation_strings":["Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090659552","display_name":"H. Naresh Kumar","orcid":"https://orcid.org/0009-0000-7620-4542"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Naresh Kumar","raw_affiliation_strings":["Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043202535","display_name":"Y. B. Venkatakrishnan","orcid":"https://orcid.org/0000-0003-4560-2040"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Y. B. Venkatakrishnan","raw_affiliation_strings":["Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India","institution_ids":["https://openalex.org/I932239252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5104669071"],"corresponding_institution_ids":["https://openalex.org/I932239252"],"apc_list":null,"apc_paid":null,"fwci":0.2814,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61533436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"13","issue":"01","first_page":"2050091","last_page":"2050091"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9136000275611877,"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.8386316299438477},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7516751289367676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6446872353553772},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5512017011642456},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.5139800906181335},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4687001407146454},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45120322704315186},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.42646926641464233},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4109993577003479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3333076238632202}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8386316299438477},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7516751289367676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6446872353553772},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5512017011642456},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.5139800906181335},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4687001407146454},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45120322704315186},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.42646926641464233},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4109993577003479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3333076238632202},{"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/s1793830920500913","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500913","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1581552469","https://openalex.org/W2051431590","https://openalex.org/W2113764055","https://openalex.org/W2624999672","https://openalex.org/W2896286920"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W2963404550","https://openalex.org/W30750922","https://openalex.org/W2033190383","https://openalex.org/W4235356280","https://openalex.org/W4299822763","https://openalex.org/W2339280209","https://openalex.org/W2763279932","https://openalex.org/W2612157706","https://openalex.org/W4283726592"],"abstract_inverted_index":{"A":[0,33,64],"vertex":[1,59],"[Formula:":[2,8,20,35,49,61,91,96,107,122,126,131,138],"see":[3,9,21,36,50,62,92,97,108,123,127,132,139],"text]":[4,10,37,51,128,133],"of":[5,48,60,84,90,106,120],"a":[6,39,85],"graph":[7],"is":[11,38,52,68,99],"said":[12,69],"to":[13,19,29,70],"vertex-edge":[14,40,53,65,87,103],"dominate":[15],"every":[16,26,46,117],"edge":[17,27,47],"incident":[18,31],"text],":[22,93,98,124,140],"as":[23,25],"well":[24],"adjacent":[28],"these":[30],"edges.":[32],"subset":[34],"dominating":[41,66,88],"set":[42,67,89],"(ve-dominating":[43],"set)":[44],"if":[45,73],"dominated":[54],"by":[55,95],"at":[56],"least":[57],"one":[58],"text].":[63,109],"be":[71],"total":[72,86,102],"its":[74],"induced":[75],"subgraph":[76],"has":[77],"no":[78],"isolated":[79],"vertices.":[80],"The":[81],"minimum":[82],"cardinality":[83],"denoted":[94],"called":[100],"the":[101,147],"domination":[104],"number":[105],"In":[110],"this":[111],"paper,":[112],"we":[113,136,142],"prove":[114],"that":[115],"for":[116],"nontrivial":[118],"tree":[119],"order":[121],"with":[125],"leaves":[129],"and":[130,141],"support":[134],"vertices":[135],"have":[137],"characterize":[143],"extremal":[144],"trees":[145],"attaining":[146],"lower":[148],"bound.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}