Bell Graphs are Determined by their Laplacian Spectra

DOI10.46793/kgjmat2302.203aMaRDI QIDQ6166502

Ali Zeydi Abdian

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

zbMATH Keywords

Laplacian spectrumcospectral graphsspectral characterization\(L\)-cospectralBell graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Tarantula graphs are determined by their Laplacian spectrum ⋮ Unnamed Item ⋮ Laplacian spectral determination of path-friendship graphs ⋮ The spectral determination of the connected multicone graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The spectral characterization of wind-wheel graphs
• Signless Laplacians of finite graphs
• The multi-fan graphs are determined by their Laplacian spectra
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On the spectral characterizations of \(\infty \)-graphs
• Which graphs are determined by their spectrum?
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
• Laplacian spectral characterization of 3-rose graphs
• The number of trees in a graph. I. II
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• No star-like trees are Laplacian co-spectral
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II

This page was built for publication: Bell Graphs are Determined by their Laplacian Spectra