An heuristic for graph symmetry detection

Abstract

We give a short introduction to an heuristic to find auto-morphisms in a graph such as axial, central or rotational symmetries. Using techniques of factorial analysis, we embed the graph in an Euclidean space and try to detect and interpret the geometric symmetries of of the embedded graph. It has been particularly developed to detect axial symmetries.