The 1/3-conjectures for domination in cubic graphs

Paul Dorbec, Michael Antony Henning

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by ${\hat{I}}^3$(G), is the minimum car…