Recent work of An, Drummond-Cole, and Knudsen [ADK], as well as the author [R], has shown that the homology groups of configuration spaces of graphs can be equipped with the structure of a finitely generated graded module over a polynomial ring. In this work we study this module structure in certain families of graphs using the language of FI-algebras recently explored by Nagel and Römer [NR]. As an application we prove that the syzygies of the modules in these families exhibit a range of stable behaviors.It therefore becomes natural to ask whether one can use techniques from commutative algebra to deduce facts about these homology groups. In [R], the author showed that the total homology groups could be decomposed into sums of graded shifts of square-free monomial ideals, in the cases wherein G is a tree. Other than that work, however, very little has been done in this direction. In this work, we study the modules H q (G) for specific families of graphs G, using recent work of White and the author [RW], and Lütgehetmann [L], as well as Nagel and Römer [NR].In [RW], White and the author introduced the notion of a finitely generated FI-graph (see Definition 3.9). For the purposes of this introduction, we restrict to a specific natural class of examples of this structure. Fix