The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph automorphisms with finite quotient) the Mahler measure of its Laplacian polynomial is the growth rate of the complexity of finite quotients of $G$. Any 1-periodic plane graph $G$ determines a link $\ell \cup C$ with unknotted component $C$. In this case the Laplacian polynomial of $G$ is related to the Alexander polynomial of the link. Lehmer's question, an open question about the roots of monic integral polynomials, is equivalent to a question about the complexity growth of signed 1-periodic graphs that are not necessarily embedded.