A discrete curvature on a planar graph
classification
🌀 gr-qc
keywords
curvaturegraphdiscreteplanarbecomescombinatorialcompactd-manifold
read the original abstract
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
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.