A cut locus for finite graphs and the farthest point mapping

DOI10.1016/j.disc.2015.08.003zbMath1322.05048OpenAlexW1611735079WikidataQ124818251 ScholiaQ124818251MaRDI QIDQ501076

Alessandro Maddaloni, Carol T. Zamfirescu

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.003

zbMATH Keywords

diametercut locusinjectivity radiusfarthest point mappinggraph distance function

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Embeddings into almost self-centered graphs of given radius

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sectional curvature of polygonal complexes with planar substructures
• Regularity of optimal transport and cut locus: from nonsmooth analysis to geometry to smooth analysis
• Cut locus structures on graphs
• Unique eccentric point graphs
• Unsolved problems in geometry
• Radius, diameter, and minimum degree
• The geodetic number of a graph
• On two conjectures of Steinhaus
• Curvature and geometry of tessellating plane graphs
• Distance in graphs -- taking the long view
• Boundary vertices in graphs
• On the covering of a complete space by the geodesics though a point
• On the geodetic number of a graph
• Elliptic operators on planar graphs: Unique continuation for eigenfunctions and nonpositive curvature
• Combinatorial curvature for planar graphs
• Geodesics in non-positively curved plane tessellations
• A Characterization of Certain Ptolemaic Graphs