Wensheng Sun

activity

20242026

collaborators

5 papers

math.CO2026

Combinatorial explanation of the weighted Kirchhoff index of graphs

Wensheng Sun, Yujun Yang, Shou-Jun Xu

Let $G$ be a connected graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ , and let $ω : V (G) \to R^{+}$ be a positive vertex-weight function satisfying $ω (v_{i}) = x_{i}$ for each $v…

math.CO2026

On two conjectures concerning Kemeny's constant of graphs

Wei Li, Wensheng Sun, Yujun Yang

Kemeny's constant for a connected graph $G$ , denoted by $K (G)$ , is the expected time for a random walk to reach a randomly chosen vertex $u$ , 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 $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ 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 $G$ be a connected graph with $n$ vertices. The resistance distance $I^c ◯_{G} (i, j)$ between any two vertices $i$ and $j$ of $G$ is defined as the effective resistance between the…

math.CO2024

Solution to a conjecture on resistance distances of block tower graphs

Wensheng Sun, Yujun Yang, Wuxian Chen +1

Let $G$ be a connected graph. The resistance distance between two vertices $u$ and $v$ of $G$ , denoted by $R_{G} [u, v]$ , is defined as the net effective resistance between them in t…