Yujun Yang

collaborators

5 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 $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.CO2026

The size of $k$ -th order generalized Fibonacci cubes

Jianxin Wei, Yujun Yang

Let $k \geq 2$ . Then the $k$ -th order Fibonacci cube $I^_{n}^{(k)}$ is the subgraph of the hypercube $Q_{n}$ induced by vertices without $k$ consecutive $1$ s. The case $k = 2$ correspo…

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

Odd clique minors and chromatic bounds of {3 $K_{1}$ , paraglider}-free graphs

Yuqing Ji, Yue Wang, Yujun Yang +1

A paraglider, house, 4-wheel, is the graph that consists of a cycle $C_{4}$ plus an additional vertex adjacent to three vertices, two adjacent vertices, all the vertices of the $C_{4}$ …

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…

On two conjectures concerning Kemeny's constant of graphs

The size of k-th order generalized Fibonacci cubes

A solution to Godsil's conjecture on the edge-connectivity of graphs in association schemes

Odd clique minors and chromatic bounds of {3K1​, paraglider}-free graphs

On the minimum constant resistance curvature conjecture of graphs

The size of $k$ -th order generalized Fibonacci cubes

Odd clique minors and chromatic bounds of {3 $K_{1}$ , paraglider}-free graphs