Dandan Fan

activity

20192024

k

-trees, perfect matchings and spectral radius of graphs

45 citations · 46 across the 11 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

Spectral radius and $[a, b]$ -factors in graphs

Dandan Fan, Huiqiu Lin, Hongliang Lu

An $[a, b]$ -factor of a graph $G$ is a spanning subgraph $H$ such that $a \leq d_{H} (v) \leq b$ for each $v \in V (G)$ . In this paper, we provide spectral conditions for the existence o…

math.CO2021★ 45 cited

The spanning $k$ -trees, perfect matchings and spectral radius of graphs

Dandan Fan, Sergey Goryainov, Xueyi Huang +1

A $k$ -tree is a spanning tree in which every vertex has degree at most $k$ . In this paper, we provide a sufficient condition for the existence of a $k$ -tree in a connected graph wi…

Spectral radius and [a,b]-factors in graphs

The spanning k-trees, perfect matchings and spectral radius of graphs

Spectral radius and $[a, b]$ -factors in graphs

The spanning $k$ -trees, perfect matchings and spectral radius of graphs