2 citations · 2 across the 20 of their papers we have counts for
4 papers · 1 filter
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…
Spectral extremal results on edge blow-up of graphs
Longfei Fang, Huiqiu Lin
Let and be the maximum size and maximum spectral radius of an -free graph of order , respectively. The value is called the…
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…