Let $G = (V,E)$ be a graph that defines the graph state $$ |G\rangle = \prod_{(i,j)\in E} CZ_{i,j}|+\rangle^{\otimes |V|}. $$ Alternatively, we can write $$ | G \rangle = \sum_{x \in \{0,1\}^{|V|}} f_G(x)|x\rangle, $$ for some function $f_G$ that can be determined by expanding the definition of $|G\rangle$.
In the case where $G$ is a 2d lattice graph, then $|G\rangle$ is a cluster state, and $|G\rangle$ is also a universal resource for measurement-based quantum computing. Thus, with post-selection, one can simulate any BQP circuit.
My question is the following. Let $G$ be a 2d lattice graph and consider the state $$ | G' \rangle = \sum_{x \in \{0,1\}^{|V|}} f_G(x)|x\rangle \otimes | x\rangle. $$ Is this universal for MBQC? What if I restrict to post-selecting on only the upper $|V|$ registers?