3 papers
math.CO2026
On two conjectures concerning Kemeny's constant of graphs
Wei Li, Wensheng Sun, Yujun Yang
Kemeny's constant for a connected graph , denoted by , is the expected time for a random walk to reach a randomly chosen vertex , regardless of the choice of…
math.CO2025
A solution to Godsil's conjecture on the edge-connectivity of graphs in association schemes
Wensheng Sun, Yujun Yang, Shou-Jun Xu
A graph is called equiarboreal if the number of spanning trees containing a given edge in is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], God…
math.CO2025
On the minimum constant resistance curvature conjecture of graphs
Wensheng Sun, Yujun Yang, Shou-Jun Xu
Let be a connected graph with vertices. The resistance distance between any two vertices and of is defined as the effective resistance between the…