Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
From MaRDI portal
Publication:648934
DOI10.1016/J.LAA.2011.06.028zbMATH Open1242.05160OpenAlexW2118974545MaRDI QIDQ648934FDOQ648934
Authors: Changjiang Bu, Jiang Zhou 
Publication date: 29 November 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.06.028
Recommendations
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- Signless Laplacian determination for a family of double starlike trees
- scientific article; zbMATH DE number 2185948
- Some graphs determined by their signless Laplacian (distance) spectra
- Starlike trees are determined by their Laplacian spectrum
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Signless Laplacians of finite graphs
- On the spectral characterization of T-shape trees
- An introduction to the theory of graph spectra
- On graphs whose signless Laplacian index does not exceed 4.5
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- No starlike trees are cospectral
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Starlike trees are determined by their Laplacian spectrum
- Graphs cospectral with starlike trees
- Title not available (Why is that?)
Cited In (16)
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- Laplacian spectral characterization of some graphs obtained by product operation
- Laplacian spectral characterization of (broken) dandelion graphs
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- The kite graph is determined by its adjacency spectrum
- Vertex-degree-based topological indices over starlike trees
- Laplacian spectral characterization of some graph join
- The spectral characterization of wind-wheel graphs
- Signless Laplacian determination for a family of double starlike trees
- The signless Laplacian spectral radius of some strongly connected digraphs
- Spectral characterizations of the corona of a cycle and two isolated vertices
- Title not available (Why is that?)
- Spectral characterization of line graphs of starlike trees
- A special class of triple starlike trees characterized by Laplacian spectrum
- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
This page was built for publication: Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648934)
