Christina J. Edholm

Learn More
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise; maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the(More)
This study uses county-level surveillance data to systematically analyze geographic variation and clustering of persons living with diagnosed HIV (PLWH) in the southern United States in 2011. Clusters corresponding to large metropolitan areas - including Miami, Atlanta, and Baltimore - had HIV prevalence rates higher (p < .001) than the regional rate.(More)
  • 1