From the 1 of 5 linked papers with an AI index.
5 papers
Maximum spread of -minor-free graphs II: the non-admissible cases
William Linz, Linyuan Lu, Zhiyu Wang
We have previously determined the maximum-spread -minor-free graph(s) on vertices when is sufficiently large, , and or $t\ge \frac{3}{2}(s-3) +…
On some structural properties of graphs with non-negative resistance curvature
Gyaneshwar Agrahari, Christin Bibby, Sean Boros +3
The paper investigates graphs that admit edge weights yielding nonnegative or positive vertex resistance curvature, disproving several conjectures, providing examples of non‑tough…
Ollivier Ricci-flow on weighted graphs
Shuliang Bai, Yong Lin, Linyuan Lu +2
We study the existence of solutions of Ricci flow equations of Ollivier-Lin-Lu-Yau curvature defined on weighted graphs. Our work is motivated by\cite{NLLG} in which the discrete t…
On the 3-colorability of triangle-free and fork-free graphs
Joshua Schroeder, Zhiyu Wang, Xingxing Yu
A graph is said to satisfy the Vizing bound if , where and denote the chromatic number and clique number of , respectively. It was conject…
Maximum spread of -minor-free graphs
William Linz, Linyuan Lu, Zhiyu Wang
The spread of a graph is the difference between the largest and smallest eigenvalue of the adjacency matrix of . In this paper, we consider the family of graphs which contai…