activity
20222026
most citedBounding the diameter and eigenvalues of amply regular graphs via Lin-Lu-Yau curvature

6 citations · 6 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2026

Curvature-Distortion Numbers of Graphs: Prescribed Lin--Lu--Yau Curvature Lower Bounds

Qing Xia

We study an optimization problem for weighted Lin--Lu--Yau curvature. Given a graph and a prescribed lower curvature bound , we ask for the smallest multiplicative…

math.CO2026

Curvature-Distortion Numbers of Graphs: Nonnegative Lin--Lu--Yau Curvature

Qing Xia

We introduce the curvature-distortion number, a scale-invariant parameter measuring the least multiplicative spread of positive edge weights required to make a weighted discrete cu…

math.CO2026

Extremal Lin--Lu--Yau Curvature: Graph Density, Girth, and Short Cycles

Qing Xia

We develop a variational framework for extremal Lin--Lu--Yau curvature under positive edge reweighting with the combinatorial metric fixed. For a connected locally finite graph …

math.CO2026

Ollivier--Ricci Idleness Functions and Edge-Connectivity of Hypergraphs

Qing Xia

We give a local geometric criterion ensuring that the edge-connectivity of a hypergraph equals its minimum incidence degree: every locally finite connected -uniform linear hyper…

math.CO2026

Idleness Functions for Ollivier-Ricci Curvature on Hypergraphs

Qing Xia

Let be a locally finite simple hypergraph, equip with the hyperpath metric, and consider the equal-edges random walk \cite{CoupetteEtAl2023}. For adjacent ve…

math.CO2025

Edge-connectivity and non-negative Lin-Lu-Yau curvature

Shiping Liu, Qing Xia

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…

math.CO2022★ 6 cited

Bounding the diameter and eigenvalues of amply regular graphs via Lin-Lu-Yau curvature

Xueping Huang, Shiping Liu, Qing Xia

An amply regular graph is a regular graph such that any two adjacent vertices have common neighbors and any two vertices with distance have common neighbors. We prove a…