Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity

Abstract

We give a $O^{\ast }(k^{O(k)})$ time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by $k$ which improves on the previous best running time bound of $O^{\ast }(2^{O(k^2/\log k)})$.