On a Laplacian spectral characterization of graphs of index less than 2

DOI10.1016/j.laa.2008.04.001zbMath1152.05046OpenAlexW2011977824MaRDI QIDQ952064

Gholam Reza Omidi

Publication date: 6 November 2008

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

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

zbMATH Keywords

Laplacian matrixcospectral graphsspectra of graphs

Mathematics Subject Classification ID

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

Related Items (8)

On a signless Laplacian spectral characterization of \(T\)-shape trees ⋮ Laplacian spectral characterization of some graph join ⋮ Graphs with small second largest Laplacian eigenvalue ⋮ Line star sets for Laplacian eigenvalues ⋮ Laplacian spectral characterization of disjoint union of paths and cycles ⋮ On some forests determined by their Laplacian or signless Laplacian spectrum ⋮ A note on the spectral characterization of \(\theta \)-graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(T\)-shape tree is determined by its Laplacian spectrum
• On the Laplacian eigenvalues of a graph
• Which graphs are determined by their spectrum?
• The spectral characterization of graphs of index less than 2 with no path as a component

This page was built for publication: On a Laplacian spectral characterization of graphs of index less than 2