paper

Graph Automorphisms from the Geometric Viewpoint

arXiv:1312.2778

Abstract

An automorphism of a graph is a bijective map from to itself such that for any two vertices and . Denote by the group consisting of all automorphisms of . Apparently, an automorphism of can be regarded as a permutation on , provided that has vertices. For each permutation on , there is a natural action on any given vector such that , so can be viewed as a linear operator on . Accordingly, one can formulate a characterization to the automorphisms of , {\it i.e.,} is an automorphism of if and only if every eigenspace of is -invariant, where is the adjacency matrix of . Consequently, every eigenspace of is -invariant, which is equivalent to that for any eigenvector of corresponding to the eigenvalue , is a subspace of the eigenspace . By virtue of the linear representation of the automorphism group , we characterize those extremal vectors in an eigenspace of so that can attain extremal values, and furthermore, we determine the exact value of for any eigenvector of .

20 pages, 3 figures

Cited by in corpus (2)