Suppose you have two adjacency matrices $A$ and $B$ of cospectral but non-isomorphic graphs. Is there a matrix $Q$ such that $$A=Q^{-1}BQ$$ holds?
Note if $A$ and $B$ are not cospectral we cannot have a $Q$ such that $$A=Q^{-1}BQ$$ holds.
Suppose you have two adjacency matrices $A$ and $B$ of cospectral but non-isomorphic graphs. Is there a matrix $Q$ such that $$A=Q^{-1}BQ$$ holds?
Note if $A$ and $B$ are not cospectral we cannot have a $Q$ such that $$A=Q^{-1}BQ$$ holds.
Two real symmetric matrices are similar if and only if they have the same characteristic polynomial. So if two graphs are cospectral, their adjacency matrices must be similar.