Non-Sunada graphs
We consider the question of whether there is a converse to the Sunada Theorem in the context of -regular graphs. We give a weak converse to the Sunada Theorem, which gives a necessary and sufficient condition for two graphs to be isospectral in terms of a Sunada-like condition, and show by example that a strong converse does not hold.