We show that spectrum and per-spectrum of a graph $G$ is $[x_1,\dots,x_n]$ and $[ix_1,\dots,ix_n]$, respectively,, iff $G$ is a bipartite graph without cycles of length $k$, $k=0\pmod4$.