2000 character limit reached
Orientable cut locus structures on graphs
Published 16 Mar 2011 in math.DG and cs.DM | (1103.3136v1)
Abstract: We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface $S$. Here, criteria for the orientability of $S$ are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.