Every graph is a cut locus

DOI10.2969/JMSJ/06731227MaRDI QIDQ500097zbMATH OpenOpenAlexFDO

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)

Full work available at URL https://arxiv.org/abs/1103.1759, https://projecteuclid.org/euclid.jmsj/1438777448

zbMATH Keywords

cut locusgraphRiemannian geometry

Mathematics Subject Classification ID

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

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.

Review text

This short and elegant paper shows that every connected length graph can be realized (isometrically) as the cut locus of a point on a closed Riemannian surface. Moreover, if the graph is cyclic and regular, then this surface can be arranged to have constant curvature. Finally, the stability and generic behavior of this realization are also studied. The proof of the main result is by induction on the number of generating cycles of the graph, and uses a deformation result of \textit{A. D. Weinstein} [Ann. Math. (2) 87, 29--41 (1968; Zbl 0159.23902)].

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

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 1875959 (Why is no real title available?)
• A cut locus for finite graphs and the farthest point mapping
• A connection between cut locus, Thom space and Morse-Bott functions
• Cut locus realizations on convex polyhedra

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)