Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity

Vikraman Arvind, Gaurav Rattan

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^*(2^{…