\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
We consider $\theta$-graphs, that is, graphs obtained by subdividing
the edges of the multigraph consisting of $3$ parallel edges. It is
shown that any $\theta$-graph $G$ is determined by the spectrum
(the multiset of eigenvalues)
except possibly when it contains a unique $4$-cycle.
\end{document}