Regular graphs are the graphs in which degree of each vertex is same. Weisfeiler-Lehman Algorithm fails to distinguish between given two non-isomorphic regular graphs.

Is there a fastest known algorithm for regular graph isomorphism? Are regular graphs are the hardest instance for graph Isomorphism? Is there any combinatorial or algebraic to deal this situation efficiently?