2018
DOI: 10.48550/arxiv.1802.02982
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Ricci-flat cubic graphs with girth five

Abstract: We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Anal., 2009. A graph is Ricci-flat, if it has vanishing Ricci curvature on all edges. We show, that the only Ricci-flat cubic graphs with girth at least 5 are the Petersen graph, the Triplex and the dodecahedral graph. This will correct the classification in [8] that misses the Tripl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…One way to define Ricci-flatness is to modify the notion of Ricci curvature for metric spaces in the sense of [Oll] The classification was addressed in [LLY] (cf. also [CKLLLY,CKLLLY2,OSY]). For vertices x, y ∈ V , and any real value α ∈ [0, 1], define the probability distribution µ α…”
Section: Two Notions Of Ricci-flatness For Graphsmentioning
confidence: 92%
“…One way to define Ricci-flatness is to modify the notion of Ricci curvature for metric spaces in the sense of [Oll] The classification was addressed in [LLY] (cf. also [CKLLLY,CKLLLY2,OSY]). For vertices x, y ∈ V , and any real value α ∈ [0, 1], define the probability distribution µ α…”
Section: Two Notions Of Ricci-flatness For Graphsmentioning
confidence: 92%
“…Thus one of d (3,4), d(3, 5) must be 2. By the symmetry of vertex 4 and vertex 5, wlog, let d(3, 5) = 2.…”
Section: D(x)mentioning
confidence: 99%
“…We have determined the Ricci-flat graphs in class G that contains an edge with endpoint degree {2, 3}. In this section, we continue with endpoint degree (3,3) and (3,4). To determine the former case (see Theorem 4), we will need the Theorem 3.…”
Section: Ricci-flat Graphs Containing Vertex With Degreementioning
confidence: 99%
See 1 more Smart Citation
“…There have been works on classifying Ricci-flat graphs. At first, [4] and [2] classified all Ricci-flat graphs with girth at least five. Then the authors in [3] characterized all Ricci-flat graphs of girth four with vertex-disjoint 4-cycles, their results show that there are two such graphs.…”
Section: Introductionmentioning
confidence: 99%