Localized Turán-type inequalities for $Q$-index

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kannan, M. Rajesh, Kumar, Hitesh, Pragada, Shivaramakrishna
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910247578238976
author Kannan, M. Rajesh
Kumar, Hitesh
Pragada, Shivaramakrishna
author_facet Kannan, M. Rajesh
Kumar, Hitesh
Pragada, Shivaramakrishna
contents 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) \leq 2n\left(1-\frac{1}{ω(G)}\right), \] where $ω(G)$ denotes the clique number of $G$. We first give a short algebraic proof of this result. For a vertex $v\in 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) \leq 2\sum_{v\in V(G)}\left(1-\frac{1}{c(v)}\right). \] Equality holds precisely for complete bipartite graphs when \(ω(G)=2\), and for regular complete \(ω(G)\)-partite graphs when \(ω(G)\geq 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_23283
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Localized Turán-type inequalities for $Q$-index
Kannan, M. Rajesh
Kumar, Hitesh
Pragada, Shivaramakrishna
Combinatorics
05C50, 05C35, 15A42
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) \leq 2n\left(1-\frac{1}{ω(G)}\right), \] where $ω(G)$ denotes the clique number of $G$. We first give a short algebraic proof of this result. For a vertex $v\in 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) \leq 2\sum_{v\in V(G)}\left(1-\frac{1}{c(v)}\right). \] Equality holds precisely for complete bipartite graphs when \(ω(G)=2\), and for regular complete \(ω(G)\)-partite graphs when \(ω(G)\geq 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.
title Localized Turán-type inequalities for $Q$-index
topic Combinatorics
05C50, 05C35, 15A42
url https://arxiv.org/abs/2605.23283