Monster graphs are determined by their Laplacian spectra
From MaRDI portal
Publication:5880902
DOI10.33044/REVUMA.1769OpenAlexW4308415646MaRDI QIDQ5880902FDOQ5880902
L. W. Beineke, G. H. Fath-Tabar, Ali Zeydi Abdian, A. R. Ashrafi, Mohammad Reza Oboudi
Publication date: 9 March 2023
Published in: Revista de la Unión Matemática Argentina (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33044/revuma.1769
Recommendations
Cites Work
- A note on Laplacian graph eigenvalues
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- Which graphs are determined by their spectrum?
- An introduction to the theory of graph spectra
- Proof of conjectures on adjacency eigenvalues of graphs
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Laplacian spectral characterization of 3-rose graphs
- The spectral characterization of wind-wheel graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The multi-fan graphs are determined by their Laplacian spectra
- The Laplacian spectrum of a graph
- The spectral characterization of butterfly-like graphs
- No star-like trees are Laplacian co-spectral
- Note on deleting a vertex and weak interlacing of the Laplacian spectrum
- Laplacian spectral determination of path-friendship graphs
Cited In (2)
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)
