{"id":"https://openalex.org/W4224240428","doi":"https://doi.org/10.1080/09728600.2022.2059415","title":"Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties","display_name":"Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties","publication_year":2022,"publication_date":"2022-01-02","ids":{"openalex":"https://openalex.org/W4224240428","doi":"https://doi.org/10.1080/09728600.2022.2059415"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2022.2059415","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2059415","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1080/09728600.2022.2059415","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066590366","display_name":"H. Abdollahzadeh Ahangar","orcid":"https://orcid.org/0000-0002-0038-8047"},"institutions":[{"id":"https://openalex.org/I84248293","display_name":"Babol Noshirvani University of Technology","ror":"https://ror.org/02zc85170","country_code":"IR","type":"education","lineage":["https://openalex.org/I84248293"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"H. Abdollahzadeh Ahangar","raw_affiliation_strings":["Department of Mathematics, Babol Noshirvani University of Technology, Shariati Ave., Babol, I.R. Iran, Postal Code: 47148-71167"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Babol Noshirvani University of Technology, Shariati Ave., Babol, I.R. Iran, Postal Code: 47148-71167","institution_ids":["https://openalex.org/I84248293"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066590366"],"corresponding_institution_ids":["https://openalex.org/I84248293"],"apc_list":{"value":1000,"currency":"GBP","value_usd":1226},"apc_paid":{"value":1000,"currency":"GBP","value_usd":1226},"fwci":0.1327,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4268043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":"1","first_page":"74","last_page":"78"},"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.980400025844574,"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.9185000061988831,"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/domination-analysis","display_name":"Domination analysis","score":0.8630080223083496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8486878871917725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7648502588272095},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7063091397285461},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6984935402870178},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5179518461227417},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4770980477333069}],"concepts":[{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.8630080223083496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8486878871917725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7648502588272095},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7063091397285461},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6984935402870178},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5179518461227417},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4770980477333069}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09728600.2022.2059415","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2059415","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2022.2059415","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2059415","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1443337832","display_name":null,"funder_award_id":"BNUT/385001/1401","funder_id":"https://openalex.org/F4320323590","funder_display_name":"Babol Noshirvani University of Technology"}],"funders":[{"id":"https://openalex.org/F4320323590","display_name":"Babol Noshirvani University of Technology","ror":"https://ror.org/02zc85170"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W560340026","https://openalex.org/W1984228559","https://openalex.org/W2011039300","https://openalex.org/W2026300475","https://openalex.org/W2028333952","https://openalex.org/W2058946695","https://openalex.org/W2070698547","https://openalex.org/W2150276036","https://openalex.org/W2504650782","https://openalex.org/W2805978690","https://openalex.org/W3124704196","https://openalex.org/W3152577304","https://openalex.org/W4214483257","https://openalex.org/W4248338579"],"related_works":["https://openalex.org/W2963404550","https://openalex.org/W2794522194","https://openalex.org/W30750922","https://openalex.org/W2033190383","https://openalex.org/W4299822763","https://openalex.org/W2339280209","https://openalex.org/W4235356280","https://openalex.org/W2763279932","https://openalex.org/W4283726592","https://openalex.org/W3118953946"],"abstract_inverted_index":{"A":[0,37],"Roman":[1,39,44,75,85,98,131],"dominating":[2,40,45,76,99],"function":[3,10,41,46,77,100],"on":[4,128],"a":[5,9,43,73,96],"graph":[6],"G":[7,55],"is":[8,24,42,79,91,149],"f:V(G)\u2192{0,1,2}":[11],"satisfying":[12],"the":[13,48,52,58,80,92,109,113,129,143],"condition":[14],"that":[15,51,142,154],"every":[16],"vertex":[17,30],"u":[18],"for":[19,32,155],"which":[20,33],"f(u)":[21],"=":[22,35],"0":[23],"adjacent":[25],"to":[26],"at":[27],"least":[28],"one":[29],"v":[31],"f(v)":[34],"2.":[36],"total":[38,74,84,97,130],"with":[47],"additional":[49],"property":[50],"subgraph":[53],"of":[54,60,63,72,88,95,112,145,159],"induced":[56],"by":[57],"set":[59],"all":[61],"vertices":[62],"positive":[64],"weight":[65,71,94],"has":[66],"no":[67],"isolated":[68],"vertex.":[69],"The":[70,83],"f":[78],"value":[81],"\u03a3u\u2208V(G)f(u).":[82],"domination":[86,132],"number":[87],"G,":[89],"\u03b3tR(G),":[90],"minimum":[93],"in":[101,116,133],"G.":[102],"In":[103],"this":[104],"paper":[105],"we":[106,152],"first":[107],"study":[108],"complexity":[110],"issue":[111],"problem":[114,144],"posed":[115],"[A.":[117],"Cabrera":[118,121],"Martinez,":[119],"S.":[120],"Garcia,":[122,125],"A.":[123],"Carri\u00f3n":[124],"Further":[126],"results":[127],"graphs,":[134],"Mathematics":[135],"8(3)":[136],"(2020)":[137],"349],":[138],"and":[139,164],"then":[140],"show":[141],"deciding":[146],"whether":[147],"\u03b3tR(G)=\u03b3R(G)+\u03b3(G)":[148],"NP-complete.":[150],"Also,":[151],"prove":[153],"any":[156],"tree":[157],"T":[158],"order":[160],"n\u22652,":[161],"\u03b3tR(T)=\u03b3R(T)+\u03b3(T)":[162],"if":[163,166],"only":[165],"\u03b3tR(T)=3\u03b3(T).":[167]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}