Localized Turán-type inequalities for Q-index
Abstract
For a connected graph \(G\), let q(G) denote the Q-index of G, i.e., the largest eigenvalue of its signless Laplacian matrix. Abreu and Nikiforov (2013) showed that \[ q(G) ≤ 2n(1-1ω(G)), \] where ω(G) denotes the clique number of G. We first give a short algebraic proof of this result. For a vertex v∈ V(G), let \(c(v)\) denote the order of the largest clique of \(G\) containing \(v\). Our main result is the following vertex localized bound that refines the result of Abreu and Nikiforov: \[ q(G) ≤ 2Σv∈ V(G)(1-1c(v)). \] Equality holds precisely for complete bipartite graphs when \(ω(G)=2\), and for regular complete \(ω(G)\)-partite graphs when \(ω(G)≥ 3\). As a consequence, we also obtain an analogous localized inequality for the Aα-matrix of G. Finally, we generalize the above localized inequality to vertex-weighted signed graphs. This contributes to the localization program for spectral Turán-type results.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.