On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913510454198272 |
|---|---|
| author | Liu, Xiaonan Lu, Linyuan Wang, Zhiyu |
| author_facet | Liu, Xiaonan Lu, Linyuan Wang, Zhiyu |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_13666 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature Liu, Xiaonan Lu, Linyuan Wang, Zhiyu Combinatorics 05C10, 51F99 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. |
| title | On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature |
| topic | Combinatorics 05C10, 51F99 |
| url | https://arxiv.org/abs/2409.13666 |