Hidden Symmetries in Simple Graphs
AbstractIt 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. View Full-Text
Share & Cite This Article
Parks, A.D. Hidden Symmetries in Simple Graphs. Symmetry 2012, 4, 219-224.
Parks AD. Hidden Symmetries in Simple Graphs. Symmetry. 2012; 4(1):219-224.Chicago/Turabian Style
Parks, Allen D. 2012. "Hidden Symmetries in Simple Graphs." Symmetry 4, no. 1: 219-224.