A note on the spectral characterization of θ-graphs

We consider θ-graphs, that is, graphs obtained by subdividing the edges of the multigraph consisting of 3 parallel edges. It is shown that any θ-graph G is determined by the spectrum (the multiset of eigenvalues) except possibly when it contains a unique 4-cycle.