Given a graph class ${\mathscr{H}}$ , the task of -Square Root problem is to decide whether an input G has square root H from . We are interested in parameterized complexity for classes that composed by graphs at vertex deletion distance most k maximum degree one, is, we looking such there modulator S size − disjoint union isolated vertices and edges. show different variants problems with const...