Spectral characterizations of sandglass graphs

DOI10.1016/j.aml.2009.01.050zbMath1173.05340OpenAlexW2054354608MaRDI QIDQ1033076

Zhanting Yuan, Pengli Lu, Xiaogang Liu, Xue-rong Yong

Publication date: 6 November 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.01.050

zbMATH Keywords

Laplacian spectrumcospectral graphsadjacency spectrumbicyclic graphsandglass graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Laplacian spectral characterization of dumbbell graphs and theta graphs ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ Per-spectral characterizations of bicyclic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• The \(T\)-shape tree is determined by its Laplacian spectrum
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Starlike trees are determined by their Laplacian spectrum
• Spectral characterizations of lollipop graphs
• The multi-fan graphs are determined by their Laplacian spectra
• The lollipop graph is determined by its spectrum
• Spectra of unicyclic graphs
• On the Laplacian eigenvalues of a graph
• A certain polynomial of a graph and graphs with an extremal number of trees
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
• The spectral characterization of graphs of index less than 2 with no path as a component
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum

This page was built for publication: Spectral characterizations of sandglass graphs