arXiv · 1103.1759
Every graph is a cut locus
Abstract
We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior.
Explore related subjects
Keep this discovery
Jin-ichi Itoh, Costin Vîlcu. 2011-03-09. Every graph is a cut locus. https://arxiv.org/abs/1103.1759
Cite the original work for its findings. Save a collection to share your selection of sources.