45 citations · 46 across the 11 of their papers we have counts for
12 papers
The existence of biregular spanning subgraphs in bipartite graphs via spectral radius
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is q…
Spectral expansion properties of pseudorandom bipartite graphs
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
An -biregular bipartite graph is a bipartite graph with bipartition such that each vertex in has degree and each vertex in has degree . By the bipart…
Eigenvalues and factors: a survey
Dandan Fan, Huiqiu Lin, Hongliang Lu +1
A factor of a graph is a spanning subgraph satisfying some given conditions. An earlier survey of factors can be traced back to the Akiyama and Kano [J. Graph Theory, 1985, 9: 1-42…
Toughness and spectral radius in graphs
Yuanyuan Chen, Dandan Fan, Huiqiu Lin
The Brouwer's toughness conjecture states that every -regular connected graph always has where is the second largest absolute eigenvalue of the adjacency…
l-connectivity, l-edge-connectivity and spectral radius of graphs
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq…
Spectral conditions for -extendability and -factors of bipartite graphs
Dandan Fan, Huiqiu Lin
Let be a connected graph. If contains a matching of size , and every matching of size is contained in a perfect matching of , then is said to be \emph{-ext…
Spectral radius and edge-disjoint spanning trees
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
The spanning tree packing number of a graph , denoted by , is the maximum number of edge-disjoint spanning trees contained in . The study of is one of the classi…
Spectral radius and (globally) rigidity of graphs in
Dandan Fan, Xueyi Huang, Huiqiu Lin
Over the past half century, the rigidity of graphs in has aroused a great deal of interest. Lovász and Yemini (1982) proved that every -connected graph is rigid in .…
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 radius and -factors in graphs
Dandan Fan, Huiqiu Lin, Hongliang Lu
An -factor of a graph is a spanning subgraph such that for each . In this paper, we provide spectral conditions for the existence o…
The spanning -trees, perfect matchings and spectral radius of graphs
Dandan Fan, Sergey Goryainov, Xueyi Huang +1
A -tree is a spanning tree in which every vertex has degree at most . In this paper, we provide a sufficient condition for the existence of a -tree in a connected graph wi…
The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
Dandan Fan, Guoping Wang, Yinfeng Zhu
Suppose that the vertex set of a connected graph is . Then we denote by the sum of distances between and all other vertices of .…