Every graph is a cut locus

DOI10.2969/JMSJ/06731227zbMATH Open1330.53052arXiv1103.1759OpenAlexW1898586754MaRDI QIDQ500097FDOQ500097

Authors: Costin Vîlcu, Jin-Ichi Itoh 

Publication date: 8 October 2015

Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1103.1759

Recommendations

• scientific article; zbMATH DE number 1875959
• A cut locus for finite graphs and the farthest point mapping
• scientific article; zbMATH DE number 4019932
• scientific article; zbMATH DE number 3947118
• On the length of the cut locus on surfaces

zbMATH Keywords

graphcut locusRiemannian geometry

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Geodesics in global differential geometry (53C22)

Cites Work

• The cut loci and the conjugate loci on ellipsoids
• Graphs on surfaces
• On the length of the cut locus on surfaces
• Scattering of geodesic fields, I
• Curvature and geometry of tessellating plane graphs
• Geodesics in non-positively curved plane tessellations
• Curvature, geometry and spectral properties of planar graphs
• The length of a cut locus on a surface and Ambrose's problem
• The cut locus and conjugate locus of a riemannian manifold
• Simplicial Structure of the Real Analytic Cut Locus
• Title not available (Why is that?)
• Title not available (Why is that?)
• THE UNBOUNDED DEAD-END DEPTH PROPERTY IS NOT A GROUP INVARIANT
• A finitely presented group with unbounded dead-end depth
• Connections between differential geometry and topology. I. Simply connected surfaces
• Cut loci of submanifolds in space forms and in the geometries of Möbius and Lie
• Many endpoints and few interior points of geodesics
• Stability of the cut locus in dimensions less than or equal to 6
• Metric structure of cut loci in surfaces and Ambrose's problem
• Farthest points and cut loci on some degenerate convex surfaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The cut loci on ellipsoids and certain Liouville manifolds
• Cut locus structures on graphs

Cited In (4)

• Cut locus realizations on convex polyhedra
• A connection between cut locus, Thom space and Morse-Bott functions
• Title not available (Why is that?)
• A cut locus for finite graphs and the farthest point mapping

This page was built for publication: Every graph is a cut locus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500097)