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.
Primary topic: Advanced Graph Theory Research (78%)
Related topic: Advanced Graph Theory Research (78%)
Wikidata ID: wiki/Q137258572
OpenAlex ID: keywords/efficient-dominating-sets
