Graph Automorphisms from the Geometric Viewpoint
Wen-Xue Du, Yi-Zheng Fan

TL;DR
This paper explores graph automorphisms through a geometric lens, linking automorphism groups to eigenspaces of the adjacency matrix and characterizing extremal vectors to understand symmetry properties.
Contribution
It provides a novel geometric characterization of graph automorphisms using eigenspaces and linear representations, including extremal vectors and their span dimensions.
Findings
Automorphisms correspond to invariant eigenspaces of the adjacency matrix.
Characterization of extremal vectors with maximal span under automorphism group action.
Exact dimensions of span for eigenvectors are determined.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Data Management and Algorithms
