The slope variety of a graph G is an algebraic variety whose points correspond to the slopes arising from point-line configurations of G. We start by reviewing the background material necessary to understand the theory of slope varieties. We then move on to slope varieties over finite fields and determine the size of this set. We show that points in this variety correspond to graphs without an induced path on four vertices. We then establish a bijection between graphs without an induced path on four vertices and series-parallel networks. Next, we study the defining polynomials of the slope variety in more detail. The polynomials defining the slope variety are understood but we show that those of minimal degree suffice to define the slope variety set theoretically. We conclude with some remarks on how we would define the slope variety for point-line configurations in higher dimensions.