The Randi\'c index and signless Laplacian spectral radius of graphs
Abstract
Given a connected graph G, the Randi\'c index R(G) is the sum of 1d(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: \[ q(G)R(G) ≤ cases 4n-4n & 4 ≤ n≤ 12 nn-1 & n≥ 13 cases \] with equality if and only if G=Kn for 4≤ n≤ 12 and G=Sn for n≥ 13, respectively. Deng, Balachandran, and Ayyaswamy (J. Math. Anal. Appl. 2014) verified this conjecture for 4 ≤ n ≤ 11. In this paper, we solve this conjecture completely.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.