Bell Graphs are Determined by their Laplacian Spectra
From MaRDI portal
Publication:6166502
DOI10.46793/KGJMAT2302.203AMaRDI QIDQ6166502FDOQ6166502
Publication date: 2 August 2023
Published in: Kragujevac Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://elib.mi.sanu.ac.rs/files/journals/kjm/76/3_eng.html
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Signless Laplacians of finite graphs
- 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
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Laplacian spectral characterization of 3-rose graphs
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- The spectral characterization of wind-wheel graphs
- The multi-fan graphs are determined by their Laplacian spectra
- On the spectral characterizations of \(\infty \)-graphs
- The number of trees in a graph. I. II
- On the spectral characterizations of 3-rose graphs
- No star-like trees are Laplacian co-spectral
Cited In (5)
This page was built for publication: Bell 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 Q6166502)