recently, mendel and naor, dumitriu and radcliffe, and radcliffe and williamson have begun the study of what could be termed the geometric fiedler vector (or spectral gap) for graphs. their principle observation is that the functional form associated with the graph can be expressed in terms of the distance function on $\mathbb{r}$. we give a partial structural characterization of when the geometric fiedler vector can be extended to a geometric spectrum. additionally, we provide applications of the geometric spectrum to community detection in graphs. this is joint work with tobias hagge, patrick mackey, kathleen nowak, carlos ortiz marrero, and jenny webster.