Symmetry Detection for Structural Graph Models

In recent years special methods have been presented for eigensolution of symmetricstructures. Therefore, an automatic approach for detecting the symmetry axis and/or planes was inevitable. In this paper a simple automatic approach is developed for symmetrydetection in structural graph models. This is achieved by a special coloring of graph utilizingthe dominant eigenvector of a special matrix known as the inner-product matrix, andimposing some constraints. Combining the present method and some canonical forms, anefficient tool is obtained for graph factorization. The efficiency of the present method isillustrated through some examples.