activity
20172026
most citedMore results on the distance (signless) Laplacian eigenvalues of graphs

9 citations · 22 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

21 papers · 1 filter

math.CO2023

Extremal spectral results of planar graphs without vertex-disjoint cycles

Longfei Fang, Huiqiu Lin, Yongtang Shi

Given a planar graph family , let and be the maximum size and maximum spectral radius…

math.CO20232 cited

Spectral extremal problem on copies of -cycle

Longfei Fang, Mingqing Zhai, Huiqiu Lin

Denote by the disjoint union of cycles of length . Let and be the maximum size and spectral radius over all -vertex -free graphs, re…

math.CO20221 cited

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…

math.CO2022

State transfer on integral mixed circulant graphs

Xing-Kun Song, Huiqiu Lin

A mixed circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perf…

math.CO2022

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 .…

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…