Orientable cut locus structures on graphs
Differential Geometry
2016-08-14 v1 Discrete Mathematics
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 . Here, criteria for the orientability of are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles.
Keywords
Cite
@article{arxiv.1103.3136,
title = {Orientable cut locus structures on graphs},
author = {Jin-ichi Itoh and Costin Vîlcu},
journal= {arXiv preprint arXiv:1103.3136},
year = {2016}
}
Comments
24 pages, 14 pages. Fourth in a series of four papers