3 papers
math.CO2023
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…
math.CO2023
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…
math.CO2022
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…