On the number of cut locus structures on graphs
arXiv:1103.1764
Abstract
We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.
13 pages, 5 figures. Third in a series of four papers