The set of vertices with positive curvature in a planar graph with nonnegative curvature
classification
🧮 math.DG
math.CO
keywords
curvaturegroupnonnegativepositiveboundcombinatorialgivegraph
read the original abstract
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly infinite---graph with nonnegative combinatorial curvature and positive total curvature is a finite group, and give an upper bound estimate for the order of the group.
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.