2019
DOI: 10.1080/10586458.2019.1660740
|View full text |Cite
|
Sign up to set email alerts
|

The Graph Curvature Calculator and the Curvatures of Cubic Graphs

Abstract: We classify all cubic graphs with either non-negative Ollivier-Ricci curvature or non-negative Bakry-Émery curvature everywhere. We show in both curvature notions that the non-negatively curved graphs are the prism graphs and the Möbius ladders. We also highlight an online tool for calculating the curvature of graphs under several variants of the curvature notions that we use in the classification. As a consequence of the classification result we show that non-negatively curved cubic expanders do not exist.arX… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
1

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 16 publications
(17 citation statements)
references
References 43 publications
0
16
0
1
Order By: Relevance
“…Note furthermore that Chang stands for any one of the three Chang graphs and that the Doob graphs are given by Doob n,m = K n 4 ×Shk m with n, m ≥ 1, where Shk denotes the Shrikhande graph, and the (7, 2)-Kneser, Conway-Smith graph and Hall graph are the three locally Petersen graphs. The curvatures inf x∼y κ(x, y) were determined with the help of the curvature calculator [7] at http://www.mas.ncl.ac.uk/graph-curvature/ Proposition 6.5. A distance-regular graph with second largest adjacency eigenvalue θ 1 = b 1 − 1 and µ = 1 cannot be Lichnerowicz sharp.…”
Section: Theorem 63 ([2]mentioning
confidence: 99%
“…Note furthermore that Chang stands for any one of the three Chang graphs and that the Doob graphs are given by Doob n,m = K n 4 ×Shk m with n, m ≥ 1, where Shk denotes the Shrikhande graph, and the (7, 2)-Kneser, Conway-Smith graph and Hall graph are the three locally Petersen graphs. The curvatures inf x∼y κ(x, y) were determined with the help of the curvature calculator [7] at http://www.mas.ncl.ac.uk/graph-curvature/ Proposition 6.5. A distance-regular graph with second largest adjacency eigenvalue θ 1 = b 1 − 1 and µ = 1 cannot be Lichnerowicz sharp.…”
Section: Theorem 63 ([2]mentioning
confidence: 99%
“…The curvatures of these examples were calculated numerically via the interactive web‐application at https://www.mas.ncl.ac.uk/graph-curvature/. For more details about this very useful tool we refer the readers to [9].…”
Section: Introductionmentioning
confidence: 99%
“…Beyond recent theoretical work on this notion (see [1,2,3,4,10,16]), there have been several applications outside mathematics such as in biology (see [5,18,23]) and in computing (see [13,21,22] ).…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%