Let $G$ be an arbitrary connected simple graph of order $n$. $G$ is called strongly asymmetric graph if all induced overgraphs of $G$ of order $n+1$ are nonisomorphic. We give the list of all strongly asymmetric graphs of order $6$ and $7$. Also we prove that there exist exactly $16$ asymmetric graphs of order $7$ which are not strongly asymmetric.