Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra (Q648934): Difference between revisions

Let \(G\) be a graph with the vertex set \(\{v_1,\dots,v_n\}\). The adjacency matrix of \(G\) is an \(n\times n\) matrix \(A(G)\) whose \((i, j)\)-entry is 1 if \(v_i\) is adjacent to \(v_j\) and 0 otherwise. The matrix \(Q(G) = D(G)+A(G)\) is called the signless Laplacian matrix of \(G\) where \(D(G)\) is the diagonal matrix whose \(i\)-the entry on the diagonal is the degree of \(v_i\). A graph is said to be determined by its \(Q\)-spectrum if there is no other non-isomorphic graph with the same signless Laplacain eigenvalues. The authors prove that all starlike trees whose maximum degree exceeds 4 are determined by their \(Q\)-spectra. For those with maximum degree at most 4, this was already done in [\textit{G. R. Omidi}, ``On a signless Laplacian spectral characterization of \(T\)-shape trees,'' Linear Algebra Appl. 431, No. 9, 1607--1615 (2009; Zbl 1169.05351)] and [\textit{G. R. Omidi} and \textit{E. Vatandoost}, ``Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra,'' Electron. J. Linear Algebra 20, 274--290 (2010; Zbl 1205.05151)].