The spectral characterization of graphs of index less than 2 with no path as a component

DOI10.1016/j.laa.2007.10.012zbMath1134.05060OpenAlexW2010518095MaRDI QIDQ2477545

Gholam Reza Omidi

Publication date: 14 March 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.2007.10.012

zbMATH Keywords

Laplacian matrixcospectral graphsspectra of graphs

Mathematics Subject Classification ID

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

Related Items

Two-dimensional fracture mechanics problems for solids with sharp and rounded V-notches ⋮ Spectral determination of graphs whose components are paths and cycles ⋮ On the spectral characterization of the union of complete multipartite graph and some isolated vertices ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Constructing graphs with given spectrum and the spectral radius at most 2 ⋮ On a Laplacian spectral characterization of graphs of index less than 2 ⋮ The cospectral equivalence classes of graphs having an isolated vertex ⋮ A note on the spectral characterization of dumbbell graphs ⋮ A note on the spectral characterization of \(\theta \)-graphs ⋮ Spectral characterizations of sandglass graphs

Cites Work

• 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
• On the Laplacian eigenvalues of a graph
• Which graphs are determined by their spectrum?
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• Unnamed Item
• Unnamed Item
• Unnamed Item