  A {\em balanced} spatial graph has an integer weight on each edge, so that
the directed sum of the weights at each vertex is zero. We describe the
Alexander module and polynomial for balanced spatial graphs (originally due to
Kinoshita \cite{ki}), and examine their behavior under some common operations
on the graph. We use the Alexander module to define the determinant and
$p$-colorings of a balanced spatial graph, and provide examples. We show that
the determinant of a spatial graph determines for which $p$ the graph is
$p$-colorable, and that a $p$-coloring of a graph corresponds to a
representation of the fundamental group of its complement into a metacyclic
group $\Gamma(p,m,k)$. We finish by proving some properties of the Alexander
polynomial.
