On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
classification
🧮 math.CO
keywords
curvaturelin-lu-yauouterplanarpositivearxivboundbrooksdegree
read the original abstract
In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then $G$ has at most $10$ vertices, and this upper bound is sharp.
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.