{"id":"https://openalex.org/W2969941771","doi":"https://doi.org/10.1142/s1793830919500551","title":"A Nordhaus\u2013Gaddum bound for Roman domination","display_name":"A Nordhaus\u2013Gaddum bound for Roman domination","publication_year":2019,"publication_date":"2019-08-21","ids":{"openalex":"https://openalex.org/W2969941771","doi":"https://doi.org/10.1142/s1793830919500551","mag":"2969941771"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830919500551","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500551","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/A5047381769","display_name":"Nader Jafari Rad","orcid":"https://orcid.org/0000-0001-7406-1859"},"institutions":[{"id":"https://openalex.org/I119025939","display_name":"Shahed University","ror":"https://ror.org/01e8ff003","country_code":"IR","type":"education","lineage":["https://openalex.org/I119025939"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Nader Jafari Rad","raw_affiliation_strings":["Department of Mathematics, Shahed University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Shahed University, Tehran, Iran","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038731437","display_name":"Hadi Rahbani","orcid":"https://orcid.org/0000-0001-8580-4443"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hadi Rahbani","raw_affiliation_strings":["Department of Mathematics, Shahrood University of Technology, Shahrood, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Shahrood University of Technology, Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047381769"],"corresponding_institution_ids":["https://openalex.org/I119025939"],"apc_list":null,"apc_paid":null,"fwci":0.582,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70109679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"05","first_page":"1950055","last_page":"1950055"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9984999895095825,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7272711992263794},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.549836277961731},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5424095392227173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5167666673660278},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4991569519042969},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4799647331237793}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7272711992263794},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.549836277961731},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5424095392227173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5167666673660278},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4991569519042969},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4799647331237793},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/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/s1793830919500551","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500551","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":12,"referenced_works":["https://openalex.org/W1974455091","https://openalex.org/W1984228559","https://openalex.org/W2019578481","https://openalex.org/W2026300475","https://openalex.org/W2028333952","https://openalex.org/W2058946695","https://openalex.org/W2059179208","https://openalex.org/W2087928776","https://openalex.org/W2202070217","https://openalex.org/W2319043422","https://openalex.org/W2346913169","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2002282073","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W4288278856"],"abstract_inverted_index":{"A":[0],"Roman":[1,34,81],"dominating":[2],"function":[3],"of":[4,40,47,100,138],"a":[5,11,26,97,135],"graph":[6,99],"[Formula:":[7,13,22,30,37,41,48,55,60,93,102,106,115,119,123,127,140,147,151,155],"see":[8,14,23,31,38,42,49,56,61,94,103,107,116,120,124,128,141,148,152,156],"text]":[9,15,24,39,50,57,95,117,121,125,149],"is":[10,44,96,122,161],"labeling":[12],"such":[16,52],"that":[17,91,145],"every":[18],"vertex":[19],"with":[20,28,109],"label":[21,29],"has":[25],"neighbor":[27],"text].":[32,129],"The":[33],"domination":[35,82],"number,":[36],"text],":[43,104,108,142,153,157],"the":[45],"minimum":[46],"over":[51],"functions.":[53],"Let":[54],"be":[58],"an":[59],"text]-vertex":[62],"graph.":[63],"Chambers":[64],"et":[65],"al.":[66],"[E.":[67],"W.":[68],"Chambers,":[69],"B.":[70,76],"Kinnersley,":[71],"N.":[72],"Prince":[73],"and":[74,112,143,150,158],"D.":[75],"West,":[77],"External":[78],"Problems":[79],"for":[80],"Siam":[83],"J.":[84],"Discrete":[85],"Math.":[86],"23":[87],"(2009)":[88],"1575\u20131586.]":[89],"proved":[90],"if":[92,111,114,146],"connected":[98],"order":[101],"then":[105,154],"equality":[110],"only":[113],"or":[118,126],"In":[130],"this":[131,159],"paper,":[132],"we":[133],"construct":[134],"specific":[136],"family":[137],"graphs":[139],"prove":[144],"bound":[160],"sharp.":[162]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}