English
Related papers

Related papers: Connectivity versus Lin-Lu-Yau curvature

200 papers

By definition, the edge-connectivity of a connected graph is no larger than its minimum degree. In this paper, we prove that the edge connectivity of a finite connected graph with non-negative Lin-Lu-Yau curvature is equal to its minimum…

Combinatorics · Mathematics 2026-04-13 Shiping Liu , Qing Xia

An amply regular graph is a regular graph such that any two adjacent vertices have $\alpha$ common neighbors and any two vertices with distance $2$ have $\beta$ common neighbors. We prove a sharp lower bound estimate for the Lin--Lu--Yau…

Combinatorics · Mathematics 2024-06-12 Xueping Huang , Shiping Liu , Qing Xia

By Hall's marriage theorem, we study lower bounds of the Lin-Lu-Yau curvature of amply regular graphs with girth $3$ or $4$ under different parameter restrictions. As a consequence, we show that each conference graph has positive Lin-Lu-Yau…

Combinatorics · Mathematics 2022-01-26 Xintian Li , Shiping Liu

The definition of Ricci curvature on graphs was given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Math., 2009. Recently, a powerful limit-free formulation of Lin-Lu-Yau curvature using the graph Laplacian…

Combinatorics · Mathematics 2025-12-30 Huiqiu Lin , Zhe You

Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S.…

Combinatorics · Mathematics 2023-09-12 Dandan Fan , Xiaofeng Gu , Huiqiu Lin

We derive explicit formulas for the Lin-Lu-Yau curvature and the Ollivier-Ricci curvature in terms of graph parameters and an optimal assignment. Utilizing these precise expressions, we examine the relationship between the Lin-Lu-Yau…

Combinatorics · Mathematics 2024-12-06 Moritz Hehl

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…

Combinatorics · Mathematics 2024-08-20 Camino Balbuena , Peter Dankelmann

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and…

Combinatorics · Mathematics 2013-01-24 Michael S. Payne , Attila Pór , Pavel Valtr , David R. Wood

Let $\kappa'(G)$, $\kappa(G)$, $\mu_{n-1}(G)$ and $\mu_1(G)$ denote the edge-connectivity, vertex-connectivity, the algebraic connectivity and the Laplacian spectral radius of $G$, respectively. In this paper, we prove that for integers…

Combinatorics · Mathematics 2020-01-06 Zhen-Mu Hong , Hong-Jian Lai , Zheng-Jiang Xia

In this paper, we show that all simple outerplanar graphs $G$ with minimum degree at least $2$ and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most $9$. Furthermore, if $G$ is maximally outerplanar, then $G$ has…

Combinatorics · Mathematics 2025-10-01 George Brooks , Fadekemi Osaye , Anna Schenfisch , Zhiyu Wang , Jing Yu

Let $G$ be a (multi)graph of order $n$ and let $u,v$ be vertices of $G$. The maximum number of internally disjoint $u$-$v$ paths in $G$ is denoted by $\kappa_G(u,v)$, and the maximum number of edge-disjoint $u$-$v$ paths in $G$ is denoted…

Combinatorics · Mathematics 2018-10-25 Rocío M. Casablanca , Lucas Mol , Ortrud R. Oellermann

We show that if a planar graph $G$ with minimum degree at least $3$ has positive Lin-Lu-Yau Ricci curvature on every edge, then $\Delta(G)\leq 17$, which then implies that $G$ is finite. This is an analogue of a result of DeVos and Mohar…

Combinatorics · Mathematics 2020-10-09 Linyuan Lu , Zhiyu Wang

The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We…

Combinatorics · Mathematics 2009-05-20 Zubeyir Cinkir

We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…

Combinatorics · Mathematics 2025-07-25 Kaizhe Chen , Jack H. Koolen , Shiping Liu

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…

Combinatorics · Mathematics 2024-09-23 Xiaonan Liu , Linyuan Lu , Zhiyu Wang

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…

General Mathematics · Mathematics 2008-12-18 José Ignacio Alvarez-Hamelin , Jorge Rodolfo Busch

We prove a conjecture of Bonini et al. on the precise values of the Lin--Lu--Yau curvature of conference graphs, i.e., strongly regular graphs with parameters $(4\gamma+1,2\gamma,\gamma-1,\gamma)$. Our method depends only on the parameter…

Combinatorics · Mathematics 2026-02-13 Kaizhe Chen , Shiping Liu , Heng Zhang

We investigate the Ollivier-Ricci curvature and its modification introduced by Lin, Lu, and Yau on locally finite graphs. The main contribution of this work is a lower bound on the minimum vertex degree of a graph ensuring non-negative…

Combinatorics · Mathematics 2025-02-07 Moritz Hehl

In this paper, we prove that any simple $\{C_3,C_5\}$-free non-empty connected graph $G$ with LLY curvature bounded below by $\kappa>0$ has the order at most $2^{\frac{2}{\kappa}}$. This upper bound is achieved if and only if $G$ is a…

Combinatorics · Mathematics 2023-12-29 E. G. K. M. Gamlath , Xiaonan Liu , Linyuan Lu , Xiaofan Yuan

In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each…

Spectral Theory · Mathematics 2009-09-16 Ali Ajdari Rad , Mahdi Jalili , Martin Hasler
‹ Prev 1 2 3 10 Next ›