{"id":"https://openalex.org/W3036402760","doi":"https://doi.org/10.1142/s1793830920500652","title":"Characterization of some classes of graphs with equal domination number and isolate domination number","display_name":"Characterization of some classes of graphs with equal domination number and isolate domination number","publication_year":2020,"publication_date":"2020-06-20","ids":{"openalex":"https://openalex.org/W3036402760","doi":"https://doi.org/10.1142/s1793830920500652","mag":"3036402760"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500652","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500652","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.289,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62234485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":"12","issue":"05","first_page":"2050065","last_page":"2050065"},"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.968999981880188,"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.9383999705314636,"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.7813262343406677},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.7104953527450562},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6752599477767944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6732162237167358},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6691999435424805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4611196219921112},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3548322916030884}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7813262343406677},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.7104953527450562},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6752599477767944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6732162237167358},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6691999435424805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4611196219921112},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3548322916030884}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830920500652","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500652","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":6,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W2021111619","https://openalex.org/W2151819870","https://openalex.org/W2176821079","https://openalex.org/W2587351417","https://openalex.org/W4232474228"],"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/W3118953946","https://openalex.org/W2612157706"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,13,18,27,34,45,56,65,70,76,80,91,95,113,123,128,142,145],"see":[2,14,19,28,35,46,57,66,71,77,81,92,96,114,124,129,143,146],"text]":[3,20,36,58,78,82,93,97,115],"be":[4],"a":[5,23,52,151],"simple":[6],"and":[7,160,174],"undirected":[8],"graph":[9,141],"with":[10,156],"vertex":[11,32,43],"set":[12,17,25,54,75,111],"text].":[15,47,72,130,147],"A":[16,73],"is":[21,37,59,83,116],"called":[22,60,84,117],"dominating":[24,53,74,110],"of":[26,51,55,64,79,94,107,112,122,167],"text],":[29,67,125,144],"if":[30,87],"every":[31,138],"in":[33,44,178],"adjacent":[38],"to":[39],"at":[40,99],"least":[41,100],"one":[42,101],"The":[48,104],"minimum":[49,105],"cardinality":[50,106],"the":[61,88,118],"domination":[62,120,158,162,177],"number":[63,121,159],"denoted":[68,126],"by":[69,127,172],"isolate":[85,109,119,161],"dominating,":[86],"induced":[89],"subgraph":[90],"contains":[98],"isolated":[102],"vertex.":[103],"an":[108,168],"In":[131],"this":[132],"paper,":[133],"we":[134,149],"show":[135],"that":[136],"for":[137,154],"proper":[139],"interval":[140],"Moreover,":[148],"provide":[150],"constructive":[152],"characterization":[153],"trees":[155],"equal":[157],"number.":[163],"These":[164],"solve":[165],"part":[166],"open":[169],"problem":[170],"posed":[171],"Hamid":[173],"Balamurugan":[175],"[Isolate":[176],"graphs,":[179],"Arab":[180],"J.":[181],"Math.":[182],"Sci.":[183],"22(2)":[184],"(2016)":[185],"232\u2013241].":[186]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}