9 citations · 10 across the 7 of their papers we have counts for
8 papers
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh +2
We initiate a systematic study of approximation schemes for fundamental optimization problems on disk graphs, a common generalization of both planar graphs and unit-disk graphs. Ou…
Maxima of spectral radius of irregular graphs with given maximum degree
Jie Xue, Ruifang Liu
Let be the maximum spectral radius of connected irregular graphs on vertices with maximum degree . Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow \in…
A spectral extremal problem on graphs with given size and matching number
Mingqing Zhai, Jie Xue, Ruifang Liu
Brualdi and Hoffman (1985) proposed the problem of determining the maximal spectral radius of graphs with given size. In this paper, we consider the Brualdi-Hoffman type problem of…
Fractional matching number and spectral radius of nonnegative matrix of graphs
Ruifang Liu, Hong-Jian Lai, Litao Guo +1
A fractional matching of a graph is a function such that for any , where is incident wit…
A note on the -spectral radius of graphs
Huiqiu Lin, Xing Huang, Jie Xue
Let be a graph with adjacency matrix and let be the diagonal matrix of the degrees of . For any real , Nikiforov [Merging the - and -spectral…
Graphs determined by their -spectra
Huiqiu Lin, Xiaogang Liu, Jie Xue
Let be a graph with vertices, and let and denote respectively the adjacency matrix and the degree matrix of . Define for any r…