{"id":"https://openalex.org/W3213440615","doi":"https://doi.org/10.1142/s1793830922500318","title":"Total vertex-edge domination in graphs: Complexity and algorithms","display_name":"Total vertex-edge domination in graphs: Complexity and algorithms","publication_year":2021,"publication_date":"2021-11-15","ids":{"openalex":"https://openalex.org/W3213440615","doi":"https://doi.org/10.1142/s1793830922500318","mag":"3213440615"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922500318","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500318","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/A5088109816","display_name":"Nitisha Singhwal","orcid":null},"institutions":[{"id":"https://openalex.org/I121750182","display_name":"National Institute of Technology Warangal","ror":"https://ror.org/017ebfz38","country_code":"IN","type":"education","lineage":["https://openalex.org/I121750182"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Nitisha Singhwal","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Warangal 506004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Warangal 506004, India","institution_ids":["https://openalex.org/I121750182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112705073","display_name":"P. Venkata Subba Reddy","orcid":null},"institutions":[{"id":"https://openalex.org/I121750182","display_name":"National Institute of Technology Warangal","ror":"https://ror.org/017ebfz38","country_code":"IN","type":"education","lineage":["https://openalex.org/I121750182"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Palagiri Venkata Subba Reddy","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Warangal 506004, India"],"raw_orcid":"https://orcid.org/0000-0003-1049-7949","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Warangal 506004, India","institution_ids":["https://openalex.org/I121750182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088109816"],"corresponding_institution_ids":["https://openalex.org/I121750182"],"apc_list":null,"apc_paid":null,"fwci":0.1514,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54727425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"14","issue":"07","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.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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.9739999771118164,"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.8110582828521729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6534854769706726},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5984052419662476},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5483827590942383},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5256196856498718},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5119777917861938},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4818093180656433},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4276149570941925},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.269547700881958}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8110582828521729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6534854769706726},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5984052419662476},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5483827590942383},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5256196856498718},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5119777917861938},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4818093180656433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4276149570941925},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.269547700881958},{"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/s1793830922500318","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500318","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W157976967","https://openalex.org/W1493071618","https://openalex.org/W1542353215","https://openalex.org/W1570340896","https://openalex.org/W1581552469","https://openalex.org/W1708444016","https://openalex.org/W2004759101","https://openalex.org/W2007607373","https://openalex.org/W2011039300","https://openalex.org/W2060834235","https://openalex.org/W2113764055","https://openalex.org/W2401610261","https://openalex.org/W2624999672","https://openalex.org/W2663774503","https://openalex.org/W2963893664","https://openalex.org/W2992421611","https://openalex.org/W3033004975","https://openalex.org/W3042819172","https://openalex.org/W3042909566","https://openalex.org/W3046755290","https://openalex.org/W3049446609","https://openalex.org/W3099344741","https://openalex.org/W3112882099","https://openalex.org/W3141776272"],"related_works":["https://openalex.org/W2897850773","https://openalex.org/W1543322965","https://openalex.org/W2053022865","https://openalex.org/W2586796145","https://openalex.org/W2341947675","https://openalex.org/W2002597511","https://openalex.org/W4362699645","https://openalex.org/W2103411036","https://openalex.org/W2951930661","https://openalex.org/W2140429404"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,13,21,36,41,52,60,64,71,78,82,96,108,122,136,159,165,203],"see":[2,14,22,37,42,53,61,65,72,79,83,97,109,123,137,160,166,204],"text]":[3,15,43,62,80,84,98,110,138,161,167],"be":[4,197],"a":[5,17,47,87,116,163],"simple,":[6,18],"undirected":[7,19],"and":[8,152,188,212],"connected":[9],"graph.":[10],"A":[11,39,74],"vertex":[12,31,69],"of":[16,44,51,58,70,81,115,121,157,162,202],"graph":[20,59,164],"text]-dominates":[23],"all":[24],"edges":[25],"incident":[26],"to":[27,135],"at":[28],"least":[29],"one":[30],"in":[32,220],"its":[33],"closed":[34],"neighborhood":[35],"text].":[38,73,124,205],"set":[40,50,77,91,120],"vertices":[45],"is":[46,63,85,111,139,168,181,207,232],"vertex-edge":[48,75,89,105,118,173,214],"dominating":[49,76,90,119],"text],":[54],"if":[55,92],"every":[56],"edge":[57],"text]-dominated":[66],"by":[67],"some":[68],"called":[86,169],"total":[88,104,117,172,213],"the":[93,112,131,170,210],"induced":[94],"subgraph":[95],"has":[99],"no":[100],"isolated":[101],"vertices.":[102],"The":[103,155],"domination":[106,174,211,215],"number":[107],"minimum":[113,171],"cardinality":[114],"In":[125],"this":[126],"paper,":[127],"we":[128],"prove":[129,178],"that":[130,179,194,209],"decision":[132],"problem":[133,156,175],"corresponding":[134],"NP-complete":[140],"for":[141,185,230],"chordal":[142],"graphs,":[143,147],"star":[144],"convex":[145,149],"bipartite":[146,150],"comb":[148],"graphs":[151,187],"planar":[153],"graphs.":[154,190],"determining":[158],"(MTVEDP).":[176],"We":[177,191],"MTVEDP":[180,195,231],"linear":[182,227],"time":[183],"solvable":[184],"chain":[186],"threshold":[189],"also":[192],"show":[193],"can":[196],"approximated":[198],"within":[199],"approximation":[200],"ratio":[201],"It":[206],"shown":[208],"problems":[216],"are":[217],"not":[218],"equivalent":[219],"computational":[221],"complexity":[222],"aspects.":[223],"Finally,":[224],"an":[225],"integer":[226],"programming":[228],"formulation":[229],"presented.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}