| Contents |
| By definition, permutations associated with graph automorphisms commute with the graph's adjacency matrix, as well as with its discrete Laplacian. This property is important when one is looking for non-simple eigenvalues. We will review other notions of graph symmetries that generalize this property of automorphisms and present some applications to dynamical systems. |
|