SCHWEITZER 1977 Problem 5
Suppose that the automorphism group of the finite undirected graph is isomorphic to the quaternion group (of order ). Prove that the adjacency matrix of has an eigenvalue of multiplicity at least .
( is the set of vertices of the graph . The set of edges is a subset of the set of all unordered pairs of elements of . The group of automorphisms of consists of those permutations of that map edges to edges. The adjacency matrix is the matrix defined by if and otherwise.)
L. Babai
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.