{"id":"https://openalex.org/keywords/efficient-dominating-sets","display_name":"efficient dominating sets","description":"Efficient dominating sets are vertex subsets in a graph such that every vertex is adjacent to exactly one vertex in the subset, counting itself.","display_name_alternatives":["independent perfect dominating sets","e.d. set","e.d. sets","perfect codes in graphs","perfect 1-codes","efficient dominating set","independent perfect dominating set"],"ids":{"openalex":"https://openalex.org/keywords/efficient-dominating-sets","wikidata":"https://www.wikidata.org/wiki/Q137258572"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7828,"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.7828,"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"}}],"works_count":135,"cited_by_count":1448,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/efficient-dominating-sets","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
