{"version":"1.0","type":"link","title":"Dominating set - Newikis","description":"In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/e/e1/Dominating-set.svg/1280px-Dominating-set.svg.png","thumbnail_width":1280,"thumbnail_height":1707}