ABSTRACT
An isomorphic mapping of a graph Q onto itself is called an automorphism. Thus, an automorphism is a bijective mapping of V{Q) onto itself, which maintiuns the psdr relationship S(G):
v iG )* -^ v { g ) , e { g ) ^ e i g ) . (18)
Any graph has at least one such automorphism, namely the identity mapping, where any vertex or edge is mapped onto itself:
'} >
Cfc Cfc
The occurrence of further automorphisms, in addition to the identity mapping, will depend on the symmetry of the graph.
