加载中…
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 has positive Lin-Lu-Yau curvature on every vertex pair, then has at most vertices, and this upper bound is sharp.

生成讲解博客的中文版本

生成AI智能校验的中文版本