Expanded-clique graphs and the domination problem

Mitre C. Dourado, Rodolfo A. Oliveira, Vitor Ponciano +2

Given a graph $G$ such that each vertex $v_i$ has a value $f(v_i)$, the expanded-clique graph $H$ is the graph where each vertex $v_i$ of $G$ becomes a clique $V_i$ of size $f(v_i)…