On strongly asymmetric graphs (Q1901054)

Let \(G_S\) be the graph obtained from \(G\) by adding a new vertex \(x\) to \(G\) and connecting this vertex to the subset \(S \subseteq V(G)\). \(G\) is called strongly asymmetric iff for any two different sets \(S_1, S_2 \subseteq V(G)\) the graphs \(G_{S_1}\) and \(G_{S_2}\) are nonisomorphic. The author shows that for all \(n \geq 6\) there exists at least one connected strongly asymmetric graph.