On the number of cut locus structures on graphs
classification
🧮 math.CO
math.DG
keywords
locusnumbersomeanotherboundsconnectedeverygive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.