Jinlong Shu

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

9 citations · 15 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2021★ 6 cited

Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs

Mingqing Zhai, Huiqiu Lin, Jinlong Shu

Nikiforov [Some inequalities for the largest eigenvalue of a graph, Combin. Probab. Comput. 179--189] showed that if $G$ is $K_{r + 1}$ -free then the spectral radius $ρ(G)\leq\sqrt{2…

math.CO2017★ 9 cited

More results on the distance (signless) Laplacian eigenvalues of graphs

Jie Xue, Huiqiu Lin, Kinkar Ch. Das +1

Let $G$ be a connected graph with vertex set $V (G)$ and edge set $E (G)$ . Let $T r (G)$ be the diagonal matrix of vertex transmissions of $G$ and $D (G)$ be the distance matrix of $G$ .…