Hidden Symmetries in Simple Graphs

Symmetry

关键词: graph theory;    automorphism group;    normalizer;    hidden symmetry;    symmetry measures;   

DOI  :  10.3390/sym4010219

来源: mdpi

【 摘 要 】

It is shown that each element σ 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 σ permutation of V—i.e., σ 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.

【 授权许可】

CC BY   
© 2012 by the authors; licensee MDPI, Basel, Switzerland.