Monster graphs are determined by their Laplacian spectra
From MaRDI portal
(Redirected from Publication:5880902)
Recommendations
Cites work
- A note on Laplacian graph eigenvalues
- An introduction to the theory of graph spectra
- Eigenvalues of the Laplacian of a graph∗
- Laplacian spectral characterization of 3-rose graphs
- Laplacian spectral determination of path-friendship graphs
- No star-like trees are Laplacian co-spectral
- Note on deleting a vertex and weak interlacing of the Laplacian spectrum
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- Proof of conjectures on adjacency eigenvalues of graphs
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The Laplacian spectrum of a graph
- The Laplacian Spectrum of a Graph II
- The multi-fan graphs are determined by their Laplacian spectra
- The spectral characterization of butterfly-like graphs
- The spectral characterization of wind-wheel graphs
- Which graphs are determined by their spectrum?
Cited in
(4)
This page was built for publication: Monster graphs are determined by their Laplacian spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880902)