The $\hat{I}\pm$-spectral Turán type problems for graphs

Abstract

For $0\le \hat{I}\pm <1$, the $\hat{I}\pm$-spectral radius of a graph $G$ is defined as the largest eigenvalue of $A_{\hat{I}}\pm (G)=\hat{I}\pm D(G)+(1-\hat{I}\pm )A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of degrees and adjacency matrix of $G$, respectively. A graph is called color-critical if it contains an edge whose deletion reduces its chromatic number. The celebrated Erdős-Stone-Simonovits theorem asserts that $\mathrm{ex}(n,\mathcal{F})=\left(1-\frac{1}{\ddot{I}‡(\mathcal{F})-1}+o(1)\right)\frac{n^2}{2},$ where $\ddot{I}‡(\mathcal{F})$ is the chromatic number of $\mathcal{F}$. Nikiforov and Zheng et al. established the adjacency spectral and signless Laplacian spectral versions of this theorem, respectively. In this paper, we present the $\hat{I}\pm$-spectral version of this theorem, which unifies the aforementioned results. Furthermore, we characterize the $\hat{I}\pm$-spectral extremal graphs for color-critical graphs, thereby extending the existing results on adjacency spectral and signless Laplacian spectral extremal graphs for such graphs.

18