  A gain graph over a group $G$, also referred to as $G$-gain graph, is a graph
where an element of a group $G$, called gain, is assigned to each oriented
edge, in such a way that the inverse element is associated with the opposite
orientation. Gain graphs can be regarded as a generalization of signed graphs,
among others. In this work, we show a new switching method to construct
cospectral gain graphs. Some previous methods known for graph cospectrality
follow as a corollary of our results.
