Some graphs determined by their spectra

DOI10.1016/j.laa.2009.05.018zbMath1169.05354OpenAlexW2041226163MaRDI QIDQ840642

Heping Zhang, Xiao-Ling Zhang

Publication date: 14 September 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.018

zbMATH Keywords

Laplacian spectrumadjacency spectrumcospectral graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

$Kite_{p+2,p}$ is determined by its Laplacian spectrum ⋮ On the spectral characterization of pineapple graphs ⋮ Laplacian spectral characterization of some graph join ⋮ The spectral characterization of wind-wheel graphs ⋮ On the spectral characterization of Kite graphs ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Vertex neighborhood restricted edge achromatic sums of graphs ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ A combinatorial formula for the Schur coefficients of chromatic symmetric functions ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Kite graphs determined by their spectra ⋮ Laplacian spectral determination of path-friendship graphs ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ Which cospectral graphs have same degree sequences ⋮ A study on the pendant number of graph products ⋮ Zero forcing number of degree splitting graphs and complete degree splitting graphs ⋮ The kite graph is determined by its adjacency spectrum ⋮ Laplacian spectral characterization of some unicyclic graphs ⋮ 3-Sequent achromatic sum of graphs

Cites Work

• Unnamed Item
• 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
• On graphs with exactly one eigenvalue less than -1
• Laplacian matrices of graphs: A survey
• Problems in algebraic combinatorics
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• A certain polynomial of a graph and graphs with an extremal number of trees
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• Laplacian spectra and spanning trees of threshold graphs
• On the spectral characterization of T-shape trees
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• On the nullity of graphs
• Graphs with Exactly Two Negative Eigenvalues
• The Laplacian Spectrum of a Graph II