How many automorphism does a clique with 6 vertices have, when we take two edges from it (two edges that don't have the same vertex)?
I thought the answer is 6*(n-2)! Number of automorphism for a full graph Kn is n!. Clique can be seen as a full graph since all of the vertices must be connected to each other. Since we take away two edges I think it should be (n-2)!. And it has to be multiplied by 6 because there are 6 vertices all together so was still permutate them.
Is this correct? How to find this correctly? What if there are N vertices?