On a signless Laplacian spectral characterization of T-shape trees
From MaRDI portal
Publication:840658
Recommendations
- Signless Laplacian spectral characterization of line graphs of T-shape trees
- On the signless Laplacian spectral characterization of the line graphs of T-shape trees.
- Some graphs determined by their signless Laplacian (distance) spectra
- On the spectral characterization of T-shape trees
- scientific article; zbMATH DE number 6383832
Cites work
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On a Laplacian spectral characterization of graphs of index less than 2
- On the spectral characterization of T-shape trees
- Some results on starlike and sunlike graphs
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Starlike trees are determined by their Laplacian spectrum
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Which graphs are determined by their spectrum?
Cited in
(38)- Graphs determined by their \(A_\alpha\)-spectra
- Spectral characterization of the complete graph removing a path of small length
- Spectral characterizations of graphs with small spectral radius
- Which cospectral graphs have same degree sequences
- Note on the spectral characterization of some cubic graphs with maximum number of triangles
- Signless Laplacian determination for a family of double starlike trees
- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- The kite graph is determined by its adjacency spectrum
- Exponentially many graphs have a \(Q\)-cospectral mate
- On the spectral characterization of T-shape trees
- Color signless Laplacian energy of graphs
- Some graphs determined by their (signless) Laplacian spectra
- Spectral characterization of line graphs of starlike trees
- Signless Laplacian spectral characterization of line graphs of T-shape trees
- On the signless Laplacian spectral determination of the join of regular graphs
- scientific article; zbMATH DE number 6383832 (Why is no real title available?)
- On the signless Laplacian spectral characterization of the line graphs of T-shape trees.
- The spectral characterization of wind-wheel graphs
- Spectral characterization of -shape trees
- The spectral characterization of butterfly-like graphs
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- On the spectral characterization of some unicyclic graphs
- The spectral characterization of \(\infty\)-graphs
- On the spectral characterization of \(\Pi\)-shape trees
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- On the spectral characterization of kite graphs
- A simple characterization of the spectral uniqueness of the T-shape trees
- Monster graphs are determined by their Laplacian spectra
- scientific article; zbMATH DE number 7683915 (Why is no real title available?)
- New bounds on the energy of a graph
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Spectral faux trees
- On the two largest Q-eigenvalues of graphs
- Peacock graphs are determined by their Laplacian spectra
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
This page was built for publication: On a signless Laplacian spectral characterization of \(T\)-shape trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840658)
