{"id":"https://openalex.org/W3110357715","doi":"https://doi.org/10.1142/s1793830921500634","title":"Algorithmic aspects of total Roman {3}-domination in graphs","display_name":"Algorithmic aspects of total Roman {3}-domination in graphs","publication_year":2020,"publication_date":"2020-11-25","ids":{"openalex":"https://openalex.org/W3110357715","doi":"https://doi.org/10.1142/s1793830921500634","mag":"3110357715"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500634","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500634","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/A5084730012","display_name":"Padamutham Chakradhar","orcid":"https://orcid.org/0000-0001-6589-8358"},"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":"Padamutham Chakradhar","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Warangal 506 004, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Warangal 506 004, India","institution_ids":["https://openalex.org/I121750182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112670960","display_name":"Palagiri 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 506 004, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Warangal 506 004, India","institution_ids":["https://openalex.org/I121750182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084730012"],"corresponding_institution_ids":["https://openalex.org/I121750182"],"apc_list":null,"apc_paid":null,"fwci":0.2814,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63809524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"05","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.9998000264167786,"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.9998000264167786,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9814000129699707,"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.7188471555709839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5709154605865479},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4654572308063507},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4211444556713104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3890726566314697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3401028513908386}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7188471555709839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5709154605865479},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4654572308063507},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4211444556713104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3890726566314697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3401028513908386},{"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/s1793830921500634","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500634","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W560340026","https://openalex.org/W1493071618","https://openalex.org/W1542353215","https://openalex.org/W1570340896","https://openalex.org/W1708444016","https://openalex.org/W1984228559","https://openalex.org/W2007607373","https://openalex.org/W2012391569","https://openalex.org/W2026300475","https://openalex.org/W2028111792","https://openalex.org/W2028357390","https://openalex.org/W2038225707","https://openalex.org/W2045027193","https://openalex.org/W2060834235","https://openalex.org/W2094067618","https://openalex.org/W2347101574","https://openalex.org/W2963893664","https://openalex.org/W3005171979","https://openalex.org/W3008183860","https://openalex.org/W3141776272","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W2980963558","https://openalex.org/W4297797135","https://openalex.org/W3125672081","https://openalex.org/W1673581201","https://openalex.org/W2991991550","https://openalex.org/W64182352"],"abstract_inverted_index":{"For":[0,37,110],"a":[1,9,21,111,121,152,180,214],"simple,":[2],"undirected,":[3],"connected":[4],"graph":[5,112,153],"[Formula:":[6,11,28,33,40,44,48,52,69,73,77,113,124,128,141,148,154,176,186,215,229,237,242,255],"see":[7,12,29,34,41,45,49,53,56,70,74,78,81,114,125,129,137,142,149,155,177,187,216,230,238,243,256],"text],":[8,46,71,115],"function":[10,25],"text]":[13,30,42,50,54,75,79,126,130,150,156,178,188,231,239],"which":[14],"satisfies":[15],"the":[16,97,116,134,171,220,225,262],"following":[17],"conditions":[18],"is":[19,63,88,131,157,192,199,250],"called":[20,158],"total":[22,135,160,265],"Roman":[23,161,266],"{3}-dominating":[24],"(TR3DF)":[26],"of":[27,99,120,123,140,146,151,173,182],"with":[31,254],"weight":[32,119,183],"text]:":[35],"(C1)":[36],"every":[38],"vertex":[39],"if":[43,68,175],"then":[47,72],"has":[51,76,106,179],"([Formula:":[55,80],"text])":[57,82],"neighbors":[58,83],"such":[59,84],"that":[60,85,170,197,224,248,261],"whose":[61,86],"sum":[62,87],"at":[64,89,184],"least":[65,90],"3,":[66],"and":[67,209,222,264],"2.":[91],"(C2)":[92],"The":[93,144],"subgraph":[94],"induced":[95],"by":[96],"set":[98],"vertices":[100],"labeled":[101],"one,":[102],"two":[103],"or":[104],"three":[105],"no":[107],"isolated":[108],"vertices.":[109],"smallest":[117],"possible":[118],"TR3DF":[122,181],"denoted":[127],"known":[132],"as":[133],"Roman[Formula:":[136],"text]-domination":[138],"number":[139],"text].":[143,244,257],"problem":[145,163,172],"determining":[147],"minimum":[159],"{3}-domination":[162,267],"(MTR3DP).":[164],"In":[165],"this":[166],"paper,":[167],"we":[168,246,277],"show":[169,196,223,247,260],"deciding":[174],"most":[185],"for":[189,203,219,235,252,284],"chordal":[190],"graphs":[191,208,253],"NP-complete.":[193],"We":[194,212,258],"also":[195,259],"MTR3DP":[198,221,249],"polynomial":[200],"time":[201],"solvable":[202],"bounded":[204],"treewidth":[205],"graphs,":[206],"chain":[207],"threshold":[210],"graphs.":[211],"design":[213],"text]-approximation":[217],"algorithm":[218,234],"same":[226],"cannot":[227],"have":[228],"ratio":[232],"approximation":[233],"any":[236],"unless":[240],"NP":[241],"Next,":[245],"APX-complete":[251],"domination":[263],"problems":[268],"are":[269],"not":[270],"equivalent":[271],"in":[272],"computational":[273],"complexity":[274],"aspects.":[275],"Finally,":[276],"present":[278],"an":[279],"integer":[280],"linear":[281],"programming":[282],"formulation":[283],"MTR3DP.":[285]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}