Monster graphs are determined by their Laplacian spectra
From MaRDI portal
Publication:5880902
DOI10.33044/revuma.1769OpenAlexW4308415646MaRDI QIDQ5880902
Ali Zeydi Abdian, Ali Reza Ashrafi, Mohammad Reza Oboudi, Lowell W. Beineke, Gholam Hossein Fath-Tabar
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
Cites Work
- Unnamed Item
- The spectral characterization of wind-wheel graphs
- The spectral characterization of butterfly-like graphs
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The multi-fan graphs are determined by their Laplacian spectra
- A note on Laplacian graph eigenvalues
- Which graphs are determined by their spectrum?
- Proof of conjectures on adjacency eigenvalues of graphs
- The Laplacian spectrum of a graph
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Laplacian spectral characterization of 3-rose graphs
- Note on deleting a vertex and weak interlacing of the Laplacian spectrum
- No star-like trees are Laplacian co-spectral
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- Laplacian spectral determination of path-friendship graphs
This page was built for publication: Monster graphs are determined by their Laplacian spectra