Automorphism groups, which comprise the set of graph self-isomorphisms preserving vertex connectivity, serve as a bridge linking symmetries in discrete structures to more general group actions.

Sang-Eon Han, Non-Ultra Regular Digital Covering Spaces with Nontrivial Automorphism Groups, Filomat, Vol. 27, No. 7 (2013), pp. 1205-1218 Free online reading for over 10 million articles Save and ...

Let G be a finite group. Denote by P(G) the probability that two elements of G, selected randomly and with replacement, commute, and by PA(G) the probability that a randomly chosen automorphism of G ...