{"id":"https://openalex.org/W3162749470","doi":"https://doi.org/10.1142/s1793830921501317","title":"Isolate Roman domination in graphs","display_name":"Isolate Roman domination in graphs","publication_year":2021,"publication_date":"2021-05-17","ids":{"openalex":"https://openalex.org/W3162749470","doi":"https://doi.org/10.1142/s1793830921501317","mag":"3162749470"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921501317","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921501317","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/A5059391205","display_name":"Davood Bakhshesh","orcid":"https://orcid.org/0000-0002-8883-8312"},"institutions":[{"id":"https://openalex.org/I2800768525","display_name":"University of Bojnord","ror":"https://ror.org/05khxfe53","country_code":"IR","type":"education","lineage":["https://openalex.org/I2800768525"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Davood Bakhshesh","raw_affiliation_strings":["Department of Computer Science, University of Bojnord, Bojnord, Iran"],"raw_orcid":"https://orcid.org/0000-0002-8883-8312","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bojnord, Bojnord, Iran","institution_ids":["https://openalex.org/I2800768525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059391205"],"corresponding_institution_ids":["https://openalex.org/I2800768525"],"apc_list":null,"apc_paid":null,"fwci":0.3028,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60415651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"03","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.9803000092506409,"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.9803000092506409,"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.7342525720596313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6163365840911865},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6068527698516846},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.5238828063011169},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4594593346118927},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4110949635505676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40236666798591614}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7342525720596313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6163365840911865},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6068527698516846},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.5238828063011169},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4594593346118927},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4110949635505676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40236666798591614},{"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/s1793830921501317","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921501317","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":[{"id":"https://metadata.un.org/sdg/16","score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1984228559","https://openalex.org/W2028111792","https://openalex.org/W2087928776","https://openalex.org/W2176821079","https://openalex.org/W2202070217","https://openalex.org/W2346913169","https://openalex.org/W2587351417","https://openalex.org/W3036402760"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W2963404550","https://openalex.org/W30750922","https://openalex.org/W4378234127","https://openalex.org/W72870998","https://openalex.org/W2763279932","https://openalex.org/W2339280209","https://openalex.org/W2346500824","https://openalex.org/W4299822763","https://openalex.org/W2033190383"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,11,16,26,32,36,46,50,60,66,78,88,93,112,123,127,140,144,154,158,171,182,187,204,225,229],"see":[2,12,17,27,33,37,47,51,61,67,79,89,94,113,124,128,141,145,155,159,172,183,188,205,226,230],"text]":[3,18,34,38,48,62,80,114,129,142,146,156,173,206,227],"be":[4],"a":[5,21,56,73,104,131,138,202],"graph":[6,203],"with":[7,35,49,143,157,228,240],"the":[8,83,101,176,196,236,241],"vertex":[9,31,45,139,153],"set":[10],"text].":[13,52,68,95,160,189,231],"A":[14,110],"function":[15,24,59,76,111,121,134,169],"is":[19,39,63,81,115,130,137,148,174,246],"called":[20,82,116,175],"Roman":[22,57,74,84,107,119,132,167,178,198,211,243],"dominating":[23,58,75,108,120,133,168,244],"of":[25,55,72,77,87,103,106,122,164,170,181,201,209,223],"text],":[28,90,125,184],"if":[29,126],"every":[30],"adjacent":[40,150],"to":[41,65,151],"at":[42],"least":[43],"one":[44],"The":[53,69,161],"weight":[54,71,163],"equal":[64],"minimum":[70,162],"domination":[85,179,199,212,216],"number":[86,180,200,213],"denoted":[91,185],"by":[92,186],"In":[96],"this":[97],"paper,":[98],"we":[99,219,233],"initiate":[100],"study":[102],"variant":[105],"functions.":[109],"an":[117,165],"isolate":[118,166,177,197,242],"and":[135,214,251],"there":[136],"which":[147],"not":[149],"any":[152],"We":[190],"present":[191,220],"some":[192,221],"upper":[193],"bound":[194],"on":[195],"in":[207],"terms":[208],"its":[210,215],"number.":[217],"Moreover,":[218],"classes":[222],"graphs":[224,250],"Finally,":[232],"show":[234],"that":[235],"decision":[237],"problem":[238],"associated":[239],"functions":[245],"NP-complete":[247],"for":[248],"bipartite":[249],"chordal":[252],"graphs.":[253]},"counts_by_year":[{"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"}