A note on the $A_{\hat{I}}\pm$-spectral radius of graphs

Abstract

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\hat{I}\pm \in [0,1]$, Nikiforov [Merging the $A$- and $Q$-spectral theories, Appl. Anal. Discrete Math. 11 (2017) 81--107] defined the matrix $A_{\hat{I}}\pm (G)$ as $A_{\hat{I}}\pm (G)=\hat{I}\pm D(G)+(1-\hat{I}\pm )A(G).$ Let $u$ and $v$ be two vertices of a connected graph $G$. Suppose that $u$ and $v$ are connected by a path $w_0(=v)w_1\cdots w_{s-1}{w}_s(=u)$ where $d(w_i)=2$ for $1\le i\le s-1$. Let $G_{p,s,q}(u,v)$ be the graph obtained by attaching the paths $P_p$ to $u$ and $P_q$ to $v$. Let $s=0,1$. Nikiforov and Rojo [On the $\hat{I}\pm$-index of graphs with pendent paths, Linear Algebra Appl. 550 (2018) 87--104] conjectured that $\ddot{I}{}_{\hat{I}}\pm (G_{p,s,q}(u,v))<\ddot{I}{}_{\hat{I}}\pm (G_{p-1,s,q+1}(u,v))$ if $p\ge q+2.$ In this paper, we confirm the conjecture. As applications, firstly, the extremal graph with maximal $A_{\hat{I}}\pm$-spectral radius with fixed order and cut vertices is characterized. Secondly, we characterize the extremal tree which attains the maximal $A_{\hat{I}}\pm$-spectral radius with fixed order and matching number. These results generalize some known results.