Yuanyuan Chen

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Spectral radius, toughness and $k$ -factor of graphs

Yuanyuan Chen, Huiqiu Lin, Shucheng Li

A $k$ -regular spanning subgraph of $G$ is called a $k$ -factor. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] presented a tight sufficient condition in terms of the spectr…

math.CO2023

Toughness and spectral radius in graphs

Yuanyuan Chen, Dandan Fan, Huiqiu Lin

The Brouwer's toughness conjecture states that every $d$ -regular connected graph always has $t (G) > \frac{d}{λ} - 1$ where $λ$ is the second largest absolute eigenvalue of the adjacency…

Spectral radius, toughness and k-factor of graphs

Toughness and spectral radius in graphs

Spectral radius, toughness and $k$ -factor of graphs