Some graphs determined by their \(A_\alpha\)-spectra (Q6124423): Difference between revisions

Let \(G\) be a graph, \(A(G)\) its adjacency matrix, \(D(G)\) the diagonal matrix of vertex degrees and \(\alpha\in [0,1]\). Then \(A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G)\). The multiset of eigenvalues of \(A_\alpha(G)\) is called the \(A_\alpha\)-spectrum of \(G\). Two graphs are \(A_\alpha\)-cospectral if they have the same \(A_\alpha\)-spectrum. A graph \(G\) is determined by its \(A_\alpha\)-spectrum if any graph \(A_\alpha\)-cospectral to \(G\) is isomorphic to \(G\). This paper is related to the problem posed in [\textit{H. Lin} et al., Discrete Math. 342, No. 2, 441--450 (2019; Zbl 1400.05147)] that reads the following: Characterize more graphs determined by their \(A_\alpha\)-spectra such that \(G\vee K_m, m\geq 1\) are also determined by their \( A_\alpha\)-spectra for \(\alpha\in(\frac{1}{2},1)\). The main results proves that if \[G\in\big\{ K_{\underbrace{2,\ldots, 2}_{\lfloor\frac{n}{2}\rfloor -1}}\vee(K_1\cup K_2),K_{\underbrace{2,\ldots, 2}_{\frac{n}{2}}},\bigcup_{i=1}^t C_{s_i}),\overline{(\bigcup_{i=1}^t C_{s_i})},\bigcup_{i=1}^t P_{s_i}, F_n, nK_1\big\},\] then both \(G\) and \(G\vee K_m\), \(m\geq 2\) are determined by \(A_\alpha\)-spectra (\(s_1+\cdots+ s_t=n\)). The paper also includes an open problem on \(A_\alpha\)-spectral determination of \(K_1\vee \bigcup_{i=1}^t P_{s_i}\), \(s_i\geq 1\), \(s_1+\ldots+s_t=n\) for \(\alpha\in(\frac{1}{2},1)\).