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 2022Show all

4 papers · 1 filter

math.CO2022★ 1 cited

Spectral conditions for $k$ -extendability and $k$ -factors of bipartite graphs

Dandan Fan, Huiqiu Lin

Let $G$ be a connected graph. If $G$ contains a matching of size $k$ , and every matching of size $k$ is contained in a perfect matching of $G$ , then $G$ is said to be \emph{ $k$ -ext…

math.CO2022

Spectral radius and edge-disjoint spanning trees

Dandan Fan, Xiaofeng Gu, Huiqiu Lin

The spanning tree packing number of a graph $G$ , denoted by $τ (G)$ , is the maximum number of edge-disjoint spanning trees contained in $G$ . The study of $τ (G)$ is one of the classi…

math.CO2022

Spectral radius and (globally) rigidity of graphs in $R^{2}$

Dandan Fan, Xueyi Huang, Huiqiu Lin

Over the past half century, the rigidity of graphs in $R^{2}$ has aroused a great deal of interest. Lovász and Yemini (1982) proved that every $6$ -connected graph is rigid in $R^{2}$ .…

math.CO2022

Toughness, hamiltonicity and spectral radius in graphs

Dandan Fan, Huiqiu Lin, Hongliang Lu

The study of the existence of hamiltonian cycles in a graph is a classic problem in graph theory. By incorporating toughness and spectral conditions, we can consider Chvátal's conj…

Spectral conditions for k-extendability and k-factors of bipartite graphs

Spectral radius and edge-disjoint spanning trees

Spectral radius and (globally) rigidity of graphs in R2

Toughness, hamiltonicity and spectral radius in graphs

Spectral conditions for $k$ -extendability and $k$ -factors of bipartite graphs

Spectral radius and (globally) rigidity of graphs in $R^{2}$