-
- YAMADA Taiki
- Research Institute for Humanity and Nature
説明
<p>Two complete graphs are connected by adding some edges. The obtained graph is called the gluing graph. The more we add edges, the larger the Ricci curvature on it becomes. We calculate the Ricci curvature of each edge on the gluing graph and obtain the least number of edges that result in the gluing graph having positive Ricci curvature.</p>
収録刊行物
-
- 九州数学雑誌
-
九州数学雑誌 74 (2), 291-311, 2020
九州大学大学院数理学研究院
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1391975831220166784
-
- NII論文ID
- 130007956239
-
- ISSN
- 18832032
- 13406116
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可