On some forests determined by their Laplacian or signless Laplacian spectrum
From MaRDI portal
Publication:980101
DOI10.1016/J.CAMWA.2009.04.005zbMATH Open1189.05106OpenAlexW2002794080MaRDI QIDQ980101FDOQ980101
Authors: Zoran Stanić, Slobodan K. Simić 
Publication date: 28 June 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.04.005
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
cospectral graphsSmith graphsspectral determination(signless) Laplacian spectrumthe largest eigenvalues
Cites Work
- Signless Laplacians of finite graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Title not available (Why is that?)
- Eigenvalue bounds for the signless laplacian
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- On a Laplacian spectral characterization of graphs of index less than 2
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- No starlike trees are cospectral
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Starlike trees are determined by their Laplacian spectrum
Cited In (14)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- Laplacian spectral characterization of some graphs obtained by product operation
- Trees with minimal Laplacian coefficients
- On determination of caterpillars with four terminal vertices by their Laplacian spectrum
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Laplacian spectral characterization of some graph join
- Spectral determination of graphs whose components are paths and cycles
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- \(\{-1,0,1\}\)-basis for the null space of a forest
- Computing some Laplacian coefficients of forests
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- Laplacian spectral characterization of 3-rose graphs
- Laplacian spectral characterization of disjoint union of paths and cycles
- On the Laplacian spectral radii of Halin graphs
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)
