The Randić index and signless Laplacian spectral radius of graphs

Abstract

Given a connected graph $G$, the Randić index $R(G)$ is the sum of $\frac{1}{\sqrt{d(u)d(v)}}$ over all edges $\{u,v\}$ of $G$, where $d(u)$ and $d(v)$ are the degree of vertices $u$ and $v$ respectively. Let $q(G)$ be the largest eigenvalue of the singless Laplacian matrix of $G$ and $n=|V(G)|$. Hansen and Lucas (2010) made the following conjecture: \[ \frac{q(G)}{R(G)} \leq \begin{cases} \frac{4n-4}{n} & 4 \leq n\leq 12 \frac{n}{\sqrt{n-1}} & n\geq 13 \end{cases} \] with equality if and only if $G=K_n$ for $4\le n\le 12$ and $G=S_n$ for $n\ge 13$, respectively. Deng, Balachandran, and Ayyaswamy (J. Math. Anal. Appl. 2014) verified this conjecture for $4\le n\le 11$. In this paper, we solve this conjecture completely.

14 pages