H
Huiqiu Lin
Researcher at East China University of Science and Technology
Publications - 95
Citations - 1052
Huiqiu Lin is an academic researcher from East China University of Science and Technology. The author has contributed to research in topics: Spectral radius & Eigenvalues and eigenvectors. The author has an hindex of 16, co-authored 78 publications receiving 729 citations. Previous affiliations of Huiqiu Lin include East China Normal University.
Papers
More filters
Posted Content
Perfect matching and distance spectral radius in graphs and bipartite graphs
Yuke Zhang,Huiqiu Lin +1 more
TL;DR: In this article, a distance spectral radius condition was proposed to guarantee the existence of a perfect matching in a bipartite graph, where the spectral radius is defined as the distance between the eigenvalues and the matching number of a graph.
Journal ArticleDOI
Spectral radius and edge‐disjoint spanning trees
TL;DR: In this paper , the authors further extend the results in terms of the number of edges and the spectral radius, respectively, and prove tight sufficient conditions to guarantee that the maximum spanning tree packing number of a graph with extremal graphs can be characterized.
Posted Content
Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs.
TL;DR: In this paper, the spectral radius of the largest eigenvalue of a graph was shown to be 2m(1-1/r) for any k ≥ 2k+2.
Posted Content
On balanced characteristic functions of canonical cliques in Paley graphs of square order
Sergey Goryainov,Huiqiu Lin +1 more
TL;DR: In this paper, it was shown that the balanced characteristic functions of canonical cliques in a Paley graph of square order span the entire eigenspace of the graph, which is the first step to a second proof of the Erdos-Ko-Rado theorem for Paley graphs.
Posted Content
The spanning $k$-trees, perfect matchings and spectral radius of graphs
TL;DR: In this article, the authors provided sufficient conditions for the existence of a k-tree in a connected graph of order n and a perfect matching in a balanced bipartite graph with minimum degree δ.