NP-completeness of a problem using a "T-gadget"
You're asking whether the underlying 3-regular graph has a Hamiltonian path, which is NP-complete.  Your activation signal must traverse every edge in this path exactly twice.

See also this question and this one.