2000 character limit reached
On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
Published 20 Sep 2024 in math.CO | (2409.13666v1)
Abstract: In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then has at most $10$ vertices, and this upper bound is sharp.
Paper Prompts
Sign up for free to create and run prompts on this paper.