If I'm not mistaken, they're called asymmetric graphs: en.wikipedia.org/wiki/Asymmetric_graph According to this wikipedia page, the smallest nontrivial example is on 6 vertices, and there are infinitely many examples. Moreover, almost all graphs are asymmetric in the sense that the ratio of graphs with nontrivial automorphisms tends to zero as the number of vertices grow.