The graph of the relation SquareOf has A as the set of vertices and an arrow from m to n iff n= m^2. So you need to draw five nodes labeled by 1, 2, 3, 4, 5 and for every ordered pair of nodes (including the same node/label taken twice), check if there is an arrow from the first element of the pair to the second. I believe there are only two arrows, one of which is a loop (an arrow from a node to itself).