{"id":"https://openalex.org/W2949161809","doi":"https://doi.org/10.1142/s179383091950040x","title":"Edges contained in all or in no minimum edge dominating set of a tree","display_name":"Edges contained in all or in no minimum edge dominating set of a tree","publication_year":2019,"publication_date":"2019-06-11","ids":{"openalex":"https://openalex.org/W2949161809","doi":"https://doi.org/10.1142/s179383091950040x","mag":"2949161809"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091950040x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091950040x","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":false,"raw_author_name":"Nac\u00e9ra Meddah","raw_affiliation_strings":["LAMDA-RO Laboratory, Department of Mathematics, University of Blida, B. P. 270, Blida, Algeria"],"raw_orcid":null,"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"],"raw_orcid":null,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83332908"],"apc_list":null,"apc_paid":null,"fwci":0.4043,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6396343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"04","first_page":"1950040","last_page":"1950040"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.993399977684021,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9513999819755554,"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.755599856376648},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6693511009216309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6009899377822876},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5996300578117371},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5955529808998108},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5792962908744812},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.425988107919693},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4219179153442383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36219578981399536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23023727536201477},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17923098802566528},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.09971368312835693},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08197864890098572},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0731717050075531}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.755599856376648},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6693511009216309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6009899377822876},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5996300578117371},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5955529808998108},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5792962908744812},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.425988107919693},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4219179153442383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36219578981399536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23023727536201477},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17923098802566528},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.09971368312835693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08197864890098572},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0731717050075531}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383091950040x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091950040x","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/W2026675463","https://openalex.org/W2059672600","https://openalex.org/W2090526848","https://openalex.org/W2564248630","https://openalex.org/W4247060915"],"related_works":["https://openalex.org/W3214848625","https://openalex.org/W3135804629","https://openalex.org/W4226332489","https://openalex.org/W2388604061","https://openalex.org/W2734661547","https://openalex.org/W2015510928","https://openalex.org/W2018719923","https://openalex.org/W2329392816","https://openalex.org/W2592660350","https://openalex.org/W131081729"],"abstract_inverted_index":{"In":[0,36],"a":[1,18,24],"graph,":[2],"an":[3],"edge":[4,13,31],"dominates":[5,29],"itself":[6],"and":[7],"all":[8,45],"its":[9],"adjacent":[10],"edges.":[11],"An":[12],"dominating":[14],"set":[15],"(EDS)":[16],"in":[17,44,47,51],"graph":[19],"[Formula:":[20,33],"see":[21,34],"text]":[22,35],"is":[23],"subset":[25],"of":[26,32],"edges":[27,41],"that":[28,42],"every":[30],"this":[37],"paper,":[38],"we":[39],"characterize":[40],"are":[43],"or":[46],"no":[48],"minimum":[49],"EDS":[50],"trees.":[52]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}