PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 54(68), pp. 2528 (1993) 

The strongly asymmetric graphs of order 6 and 7Mirko Lepovi\'cPrirodnomatematicki fakultet, Kragujevac, YugoslaviaAbstract: 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. Classification (MSC2000): 05C50 Full text of the article:
Electronic fulltext finalized on: 1 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
