English

Localized Tur\'{a}n-type inequalities for $Q$-index

Combinatorics 2026-05-25 v1

Abstract

For a connected graph GG, let q(G)q(G) denote the QQ-index of GG, i.e., the largest eigenvalue of its signless Laplacian matrix. Abreu and Nikiforov (2013) showed that q(G)2n(11ω(G)), q(G) \leq 2n\left(1-\frac{1}{\omega(G)}\right), where ω(G)\omega(G) denotes the clique number of GG. We first give a short algebraic proof of this result. For a vertex vV(G)v\in V(G), let c(v)c(v) denote the order of the largest clique of GG containing vv. Our main result is the following vertex localized bound that refines the result of Abreu and Nikiforov: q(G)2vV(G)(11c(v)). q(G) \leq 2\sum_{v\in V(G)}\left(1-\frac{1}{c(v)}\right). Equality holds precisely for complete bipartite graphs when ω(G)=2\omega(G)=2, and for regular complete ω(G)\omega(G)-partite graphs when ω(G)3\omega(G)\geq 3. As a consequence, we also obtain an analogous localized inequality for the AαA_\alpha-matrix of GG. Finally, we generalize the above localized inequality to vertex-weighted signed graphs. This contributes to the localization program for spectral Tur\'{a}n-type results.

Keywords

Cite

@article{arxiv.2605.23283,
  title  = {Localized Tur\'{a}n-type inequalities for $Q$-index},
  author = {M. Rajesh Kannan and Hitesh Kumar and Shivaramakrishna Pragada},
  journal= {arXiv preprint arXiv:2605.23283},
  year   = {2026}
}

Comments

Comments and suggestions are welcome