{"id":"https://openalex.org/W2586928089","doi":"https://doi.org/10.1142/s1793830917500239","title":"Roman domination and 2-independence in trees","display_name":"Roman domination and 2-independence in trees","publication_year":2017,"publication_date":"2017-02-10","ids":{"openalex":"https://openalex.org/W2586928089","doi":"https://doi.org/10.1142/s1793830917500239","mag":"2586928089"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830917500239","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500239","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/A5036041098","display_name":"Nac\u00e9ra Meddah","orcid":null},"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":true,"raw_author_name":"Nac\u00e9ra Meddah","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/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":"Mustapha 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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036041098"],"corresponding_institution_ids":["https://openalex.org/I83332908"],"apc_list":null,"apc_paid":null,"fwci":0.9477,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76344086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"09","issue":"02","first_page":"1750023","last_page":"1750023"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9945999979972839,"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/T12288","display_name":"Optimization and Search Problems","score":0.9858999848365784,"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/combinatorics","display_name":"Combinatorics","score":0.707137942314148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6056370735168457},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5902739763259888},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4171629548072815}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.707137942314148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6056370735168457},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5902739763259888},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4171629548072815}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830917500239","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500239","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":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1735141257","https://openalex.org/W1984228559","https://openalex.org/W2017926358","https://openalex.org/W2026300475","https://openalex.org/W2058946695","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W3111310291"],"abstract_inverted_index":{"A":[0,78],"Roman":[1,72],"dominating":[2],"function":[3,13],"(RDF)":[4],"on":[5],"a":[6,12,52,65,88,117,150],"graph":[7],"[Formula:":[8,14,23,27,37,41,46,57,67,75,80,84,89,94,101,110,118,123,128,132,146,153],"see":[9,15,24,28,38,42,47,58,68,76,81,85,90,95,102,111,119,124,129,133,147,154],"text]":[10,16,25,29,39,43,69,82,86,96,103,112,125,134,148],"is":[11,30,54,70,87,126,149],"satisfying":[17],"the":[18,55,61,71,127],"condition":[19],"that":[20,144],"every":[21,98],"vertex":[22,36,99],"with":[26],"adjacent":[31],"to":[32],"at":[33,105],"least":[34],"one":[35,107],"of":[40,51,64,83,93,100,116,122],"for":[44],"which":[45],"text].":[48,77,155],"The":[49,113],"weight":[50,63],"RDF":[53,66],"sum":[56],"text],":[59],"and":[60],"minimum":[62],"domination":[73],"number":[74,131],"subset":[79],"text]-independent":[91,120],"set":[92,121],"if":[97,145],"has":[104],"most":[106],"neighbor":[108],"in":[109,139],"maximum":[114],"cardinality":[115],"text]-independence":[130],"Both":[135],"parameters":[136],"are":[137,162],"incomparable":[138],"general,":[140],"however,":[141],"we":[142],"show":[143],"tree,":[151],"then":[152],"Moreover,":[156],"all":[157],"extremal":[158],"trees":[159],"attaining":[160],"equality":[161],"characterized.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-26T15:22:09.906841","created_date":"2025-10-10T00:00:00"}