Abstract :
Let G be an arbitrary simple graph of order n. G is called strongly asymmetric if all induced overgraphs of G of order (n + 1) are nonisomorphic. In this paper we give some properties of such graphs and prove that the class Lc of all connected strongly asymmetric graphs is infinite.
