{"id":"https://openalex.org/W4285395875","doi":"https://doi.org/10.1080/09728600.2022.2094735","title":"An improved upper bound on the independent double Roman domination number of trees","display_name":"An improved upper bound on the independent double Roman domination number of trees","publication_year":2022,"publication_date":"2022-07-12","ids":{"openalex":"https://openalex.org/W4285395875","doi":"https://doi.org/10.1080/09728600.2022.2094735"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2022.2094735","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094735","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094735?needAccess=true","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094735?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049333554","display_name":"F. Nahani Pour","orcid":null},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"F. Nahani Pour","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]}]},{"author_position":"middle","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, Babol, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Babol Noshirvani University of Technology, Babol, Iran","institution_ids":["https://openalex.org/I84248293"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008747635","display_name":"Mustapha Chellali","orcid":"https://orcid.org/0000-0001-5231-6195"},"institutions":[{"id":"https://openalex.org/I83332908","display_name":"University of Blida","ror":"https://ror.org/03g41pw14","country_code":"DZ","type":"education","lineage":["https://openalex.org/I83332908"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"M. Chellali","raw_affiliation_strings":["LAMDA-RO Laboratory, Department of Mathematics, University of Blida B.P. 270, Blida, Algeria"],"affiliations":[{"raw_affiliation_string":"LAMDA-RO Laboratory, Department of Mathematics, University of Blida B.P. 270, Blida, Algeria","institution_ids":["https://openalex.org/I83332908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023197041","display_name":"Seyed Mahmoud Sheikholeslami","orcid":"https://orcid.org/0000-0003-2298-4744"},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. M. Sheikholeslami","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"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.1461,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47400589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"3","first_page":"206","last_page":"210"},"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.975600004196167,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9674999713897705,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9044179916381836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8352460265159607},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.7848580479621887},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7629515528678894},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5492961406707764},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5342243313789368},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5135324597358704},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.431970477104187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3220823109149933}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9044179916381836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8352460265159607},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.7848580479621887},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7629515528678894},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5492961406707764},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5342243313789368},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5135324597358704},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.431970477104187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3220823109149933},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09728600.2022.2094735","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094735","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094735?needAccess=true","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a60a27c4f19f4001966d231d933700de","is_oa":true,"landing_page_url":"https://doaj.org/article/a60a27c4f19f4001966d231d933700de","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 206-210 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2022.2094735","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094735","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094735?needAccess=true","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285395875.pdf","grobid_xml":"https://content.openalex.org/works/W4285395875.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W2054611590","https://openalex.org/W2346913169","https://openalex.org/W2744781146","https://openalex.org/W2790637388","https://openalex.org/W2793545881","https://openalex.org/W2796445651","https://openalex.org/W2958098820","https://openalex.org/W2971362683","https://openalex.org/W2980094089","https://openalex.org/W3048258632","https://openalex.org/W3203173652","https://openalex.org/W4210440361"],"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":{"AbstractFor":[0],"a":[1,14,34,70],"graph":[2],"[Formula:":[3,16,26,51,57,109,120,135,150,182,186],"see":[4,17,27,52,58,110,121,136,151,183,187],"text]":[5,18,28,53,59,111,122,137,184,188],"an":[6,91,117],"independent":[7,104],"double":[8,105,160],"Roman":[9,106,161],"dominating":[10],"function":[11,15],"(IDRDF)":[12],"is":[13,86,93,112,140],"having":[19],"the":[20,77,94,103,113,141,149,167,177],"property":[21],"that:":[22],"(i)":[23],"every":[24,55,130],"vertex":[25,56],"with":[29,37,60,185],"f(v)":[30,61],"=":[31,39,62],"0":[32],"has":[33,64],"neighbor":[35,68],"u":[36],"f(u)":[38],"3":[40,73],"or":[41,72],"at":[42,65],"least":[43,66],"two":[44],"neighbors":[45],"x":[46],"and":[47,102],"y":[48],"such":[49],"that":[50,128],"(ii)":[54],"1":[63],"one":[67],"assigned":[69,81],"2":[71],"under":[74,84],"f;":[75],"(iii)":[76],"set":[78],"of":[79,90,96,116,133,143,146,166,180],"vertices":[80,145],"non-zero":[82],"values":[83,98],"f":[85],"independent.":[87],"The":[88],"weight":[89,115],"IDRDF":[92,118],"sum":[95],"its":[97],"overs":[99],"all":[100],"vertices,":[101],"domination":[107,162],"number":[108,142],"minimum":[114],"on":[119],"In":[123],"this":[124],"article,":[125],"we":[126,175],"show":[127],"for":[129],"tree":[131],"T":[132,179],"order":[134,181],"where":[138],"s(T)":[139],"support":[144],"T,":[147],"improving":[148],"text]-upper":[152],"bound":[153],"established":[154],"in":[155,163],"[Maimani":[156],"et":[157],"al.":[158],"Independent":[159],"graphs,":[164],"Bulletin":[165],"Iranian":[168],"Mathematical":[169],"Society,":[170],"46":[171],"(2020)":[172],"543\u2013555].":[173],"Moreover,":[174],"characterize":[176],"trees":[178]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}