%0 Journal Article
%T Hidden Symmetries in Simple Graphs
%A Allen D. Parks
%J Symmetry
%D 2012
%I MDPI AG
%R 10.3390/sym4010219
%X It is shown that each element s in the normalizer of the automorphism group Aut(G) of a simple graph G with labeled vertex set V is an Aut(G) invariant isomorphism between G and the graph obtained from G by the s permutation of V¡ªi.e., s is a hidden permutation symmetry of G. A simple example illustrates the theory and the applied notion of system robustness for reconfiguration under symmetry constraint (RUSC) is introduced.
%K graph theory
%K automorphism group
%K normalizer
%K hidden symmetry
%K symmetry measures
%U http://www.mdpi.com/2073-8994/4/1/219