Low-density parity-check (LDPC) codes are codes based on sparse matrices that have equivalent sparse bipartite graph representations. Spatially coupled LDPC codes are obtained by replicating a base graph and spreading edges across the copies in a symmetric way to yield high performing codes. In this talk, we prove the cycle structure of an arbitrary SC LDPC code graph. Moreover, we adapt algebraic constructions from Macula, Margulis, Rosenthal and Vontobel to construct SC LDPC codes. Time-permitting, we will examine the properties and performance of the resulting SC LDPC codes.