On some forests determined by their Laplacian or signless Laplacian spectrum
From MaRDI portal
(Redirected from Publication:980101)
Recommendations
- Some trees are determined by their Laplacian spectra
- Spectral determination of graphs whose components are paths and cycles
- Graphs determined by their (signless) Laplacian spectra
- Two classes of bicyclic graphs are determined by their Laplacian spectrum
- Two classes of unicyclic graphs determined by their Laplacian spectra
Cites work
- Eigenvalue bounds for the signless laplacian
- Enumeration of cospectral graphs.
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3465473 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- No starlike trees are cospectral
- On a Laplacian spectral characterization of graphs of index less than 2
- Signless Laplacians of finite 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
(14)- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter d
- \(\{-1,0,1\}\)-basis for the null space of a forest
- Laplacian spectral characterization of 3-rose graphs
- Laplacian spectral characterization of disjoint union of paths and cycles
- Laplacian spectral characterization of some graph join
- Laplacian spectral characterization of some graphs obtained by product operation
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- On the Laplacian spectral radii of Halin graphs
- Spectral determination of graphs whose components are paths and cycles
- Computing some Laplacian coefficients of forests
- On determination of caterpillars with four terminal vertices by their Laplacian spectrum
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Trees with minimal Laplacian coefficients
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
This page was built for publication: On some forests determined by their Laplacian or signless Laplacian spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980101)
