On a signless Laplacian spectral characterization of \(T\)-shape trees
From MaRDI portal
Publication:840658
DOI10.1016/j.laa.2009.05.035zbMath1169.05351OpenAlexW2076121233MaRDI QIDQ840658
Publication date: 14 September 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.035
adjacency matrixLaplacian matrixcospectral graphssignless Laplacian matrixspectra of graphs\(T\)-shape treesadjacency spectrasignless Laplacian spectra
Related Items (31)
Monster graphs are determined by their Laplacian spectra ⋮ Exponentially many graphs have a \(Q\)-cospectral mate ⋮ Graphs determined by their \(A_\alpha\)-spectra ⋮ Signless Laplacian determination for a family of double starlike trees ⋮ The spectral characterization of wind-wheel graphs ⋮ On the spectral characterization of Kite graphs ⋮ The spectral characterization of butterfly-like graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ On the signless Laplacian spectral determination of the join of regular graphs ⋮ On the signless Laplacian spectral characterization of the line graphs of T-shape trees ⋮ Color signless Laplacian energy of graphs ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Note on the spectral characterization of some cubic graphs with maximum number of triangles ⋮ On the spectral characterization of some unicyclic graphs ⋮ Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\) ⋮ The spectral characterization of \(\infty\)-graphs ⋮ Unnamed Item ⋮ Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Spectral characterization of the complete graph removing a path of small length ⋮ The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges ⋮ On the spectral characterization of Π-shape trees ⋮ New bounds on the energy of a graph ⋮ Spectral characterizations of graphs with small spectral radius ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On the two largest \(Q\)-eigenvalues of graphs ⋮ Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity ⋮ Which cospectral graphs have same degree sequences ⋮ A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum ⋮ The kite graph is determined by its adjacency spectrum ⋮ Spectral characterization of line graphs of starlike trees
Cites Work
- Unnamed Item
- Unnamed Item
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Starlike trees are determined by their Laplacian spectrum
- On a Laplacian spectral characterization of graphs of index less than 2
- Which graphs are determined by their spectrum?
- Some results on starlike and sunlike graphs
- On the spectral characterization of T-shape trees
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
This page was built for publication: On a signless Laplacian spectral characterization of \(T\)-shape trees
